Download:
|
by Alex Simpson, Gordon Plotkin
In Proceedings of 15th Annual Symposium on Logic in Computer Science
http://www.dcs.ed.ac.uk/home/gdp/publications/fixpoints.ps.gz
Add To MetaCart
Abstract:
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operator is defined, embodying the equational properties of iteration theories. We prove a general completeness theorem for iteration operators, relying on a new, purely syntactic characterisation of the free iteration theory. We then show how iteration operators arise in axiomatic domain theory. One result derives them from the existence of sufficiently many bifree algebras (exploiting the universal property Freyd introduced in his notion of algebraic compactness). Another result shows that, in the presence of a parameterized natural numbers object and an equational lifting monad, any uniform fixed-point operator is necessarily an iteration operator. 1.
Citations
|
894
|
The lambda calculus, its syntax and semantics
– Barendregt
- 1984
|
|
565
|
Notions of computation and monads
– Moggi
- 1991
|
|
354
|
Computational lambda-calculus and monads
– Moggi
- 1989
|
|
301
|
An Introduction to Higher Order Categorical Logic
– Lambek, Scott
- 1986
|
|
165
|
The Formal Semantics of Programming Languages
– Winskel
- 1993
|
|
138
|
Semantics of Programming Languages
– Gunter
- 1992
|
|
129
|
Toposes, Triples and Theories
– Barr, Wells
- 1985
|
|
101
|
Traced monoidal categories
– Joyal, Street, et al.
- 1996
|
|
93
|
Algebraically complete categories
– Freyd
- 1991
|
|
61
|
Remarks on algebraically compact categories
– Freyd
- 1991
|
|
53
|
Models of Sharing Graphs: A Categorical Semantics of Let and Letrec
– Hasegawa
- 1999
|
|
46
|
New foundations for fixpoint computations: Fixhyperdoctrines and the fix-logic
– Crole, Pitts
- 1992
|
|
44
|
Iteration theories
– Bloom, Esik
- 1993
|
|
42
|
Games and Full Abstraction for a Functional Metalanguage with Recursive Types
– McCusker
- 1996
|
|
26
|
The equivalence problem for deterministic pushdown automata is decidable
– Senizergues
- 1997
|
|
20
|
Decidability of DPDA equivalence
– Stirling
- 2001
|
|
18
|
Complete cuboidal sets in axiomatic domain theory
– Fiore, Plotkin, et al.
- 1997
|
|
15
|
Axiomatic Domain Theory
– Fiore
- 1996
|
|
15
|
An extension of models of axiomatic domain theory to models of synthetic domain theory
– Fiore, Plotkin
- 1258
|
|
13
|
Recursive types in Kleisli categories. Unpublished manuscript
– Simpson
- 1992
|
|
12
|
The logic of recursive equations
– Hurkens, McArthur, et al.
- 1998
|
|
11
|
Strong monads, algebras and fixed points
– Mulry
- 1992
|
|
9
|
definable functionals and fij-conversion
– Statman
- 1983
|
|
8
|
Induction and recursion on the partial real line with applications to
– Streicher
- 1999
|
|
8
|
General synthetic domain theory --- a logical approach
– Streicher
- 1999
|
|
7
|
A uniform account of domain theory in realizability models
– Longley, Simpson
- 1997
|
|
6
|
Computational adequacy in an elementary topos
– Simpson
- 1999
|
|
5
|
Group axioms for iteration
– Ésik
- 1999
|
|
5
|
A characterisation of the least-fixed-point operator by dinaturality
– Simpson
- 1993
|
|
5
|
λ-definable functionals and βη-conversion
– Statman
- 1983
|
|
3
|
Independence of the equational axioms for iteration theories
– Ésik
- 1988
|
|
2
|
Equational lifting monads
– Bucalo, Führmann, et al.
- 1999
|
|
1
|
The Category C. Unpublished manuscript
– Eilenberg
|
|
1
|
Domains. The "Pisa" notes. Available from http://www.dcs.ed.ac.uk/home/gdp
– Plotkin
- 1983
|
|
1
|
Models of Sharing Graphs: A Categorical Semantics oflet andletrec. Distinguished Dissertation Series
– Hasegawa
- 1999
|
|
1
|
Domains. The “Pisa” notes. Available from http://www.dcs.ed.ac.uk/home/gdp
– Plotkin
- 1983
|
