New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic
DOI10.1016/0890-5401(92)90018-BzbMath0763.03031OpenAlexW1977260399MaRDI QIDQ1193588
Publication date: 27 September 1992
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(92)90018-b
correctnessmonadfixpoint inductioncategorical semantics of computationsfixpoint computationshigher-order typed constructive predicate logic
Semantics in the theory of computing (68Q55) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Combinatory logic and lambda calculus (03B40) Higher-type and set recursion theory (03D65) Proof theory and constructive mathematics (03F99)
Related Items
Cites Work
- Notions of computation and monads
- The calculus of constructions
- LCF considered as a programming language
- A type-theoretical alternative to ISWIM, CUCH, OWHY
- HYPERDOCTRINES, NATURAL DEDUCTION AND THE BECK CONDITION
- Logic and Computation
- Algebraic specification of data types: A synthetic approach
- The Category-Theoretic Solution of Recursive Domain Equations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item