2002 · 123 citations · 19 references
Natural SciencesMathematicsAlgebraPhilosophy Of MathematicsTheory Of ComputationAbstract AlgebraCategory TheoryFixed Point TheoryOperator TheoryRecursion TheoryAxiomatization Of Algebraic StructuresAxiomsCompletenessDomain TheoryEquational LogicFixed-point LogicMonadsOperators
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.
19
Notions of computation and monads
Eugenio Moggi · Information and Computation · 1991 · 1.7K citations
Introduction to Higher Order Categorical Logic.
J. L. Bell, J. Lambek, Philip Scott · Journal of Symbolic Logic · 1989 · 1.1K citations
Humanities, Mathematics, Logic +11
Computational lambda-calculus and monads
Eugenio Moggi · 2003 · 858 citations
Computing, Computer Science, Algebra +13