Introduction to higher order categorical logic
Introduction to higher order categorical logic
Independence of the equational axioms for iteration theories
Journal of Computer and System Sciences
Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
Notions of computation and monads
Information and Computation
Semantics of programming languages: structures and techniques
Semantics of programming languages: structures and techniques
The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
A characterisation of the least-fixed-point operator by dinaturality
Theoretical Computer Science
Axiomatic domain theory in categories of partial maps
Axiomatic domain theory in categories of partial maps
Induction and recursion on the partial real line with applications to Real PCF
Theoretical Computer Science - Special issue on real numbers and computers
Information and Computation
Models of Sharing Graphs: A Categorical Semantics of Let and Letrec
Models of Sharing Graphs: A Categorical Semantics of Let and Letrec
Uncertain Programming
The Equivalence Problem for Deterministic Pushdown Automata is Decidable
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Computational Adequacy in an Elementary Topos
Proceedings of the 12th International Workshop on Computer Science Logic
Complete Cuboidal Sets in Axiomatic Domain Theory
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
General synthetic domain theory – a logical approach
Mathematical Structures in Computer Science
A uniform approach to domain theory in realizability models
Mathematical Structures in Computer Science
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Axioms for Recursion in Call-by-Value
Higher-Order and Symbolic Computation
Linearly Used Effects: Monadic and CPS Transformations into the Linear Lambda Calculus
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Categories of Processes Enriched in Final Coalgebras
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Axioms for Recursion in Call-by-Value
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Duality between Call-by-Name Recursion and Call-by-Value Iteration
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
An equational notion of lifting monad
Theoretical Computer Science - Category theory and computer science
On the equational definition of the least prefixed point
Theoretical Computer Science - Mathematical foundations of computer science
An extension theorem with an application to formal tree series
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Free iterative theories: a coalgebraic view
Mathematical Structures in Computer Science
Combining effects: sum and tensor
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Parameterizations and Fixed-Point Operators on Control Categories
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Extensional Universal Types for Call-by-Value
APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
On traced monoidal closed categories
Mathematical Structures in Computer Science
Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
A general framework for sound and complete Floyd-Hoare logics
ACM Transactions on Computational Logic (TOCL)
Iteration Grove Theories with Applications
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Electronic Notes in Theoretical Computer Science (ENTCS)
Parameterizations and fixed-point operators on control categories
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Polarized proof nets with cycles and fixpoints semantics
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Finite dimensional vector spaces are complete for traced symmetric monoidal categories
Pillars of computer science
A semantical approach to equilibria and rationality
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
From Coalgebraic to Monoidal Traces
Electronic Notes in Theoretical Computer Science (ENTCS)
Equational properties of iterative monads
Information and Computation
Traces for coalgebraic components
Mathematical Structures in Computer Science
Elgot theories: A new perspective on the equational properties of iteration
Mathematical Structures in Computer Science
Relating computational effects by ⊤⊤-lifting
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Kleene theorem in partial conway theories with applications
Algebraic Foundations in Computer Science
Computation-by-Interaction with effects
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Correct looping arrows from cyclic terms
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Parameterizations and Fixed-Point Operators on Control Categories
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
A Representation Theorem for Unique Decomposition Categories
Electronic Notes in Theoretical Computer Science (ENTCS)
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Relating computational effects by ττ-lifting
Information and Computation
A parameterized graph transformation calculus for finite graphs with monadic branches
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
A Connection Between Concurrency and Language Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
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 characterization 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.