Strong categorical datatypes II: A term logic for categorical programming
From MaRDI portal
Publication:673963
DOI10.1016/0304-3975(94)00099-5zbMATH Open0874.68033OpenAlexW1979170753MaRDI QIDQ673963FDOQ673963
Authors: J. R. B. Cockett, Dwight Spencer 
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00099-5
Recommendations
Cites Work
- Strong functors and monoidal monads
- Title not available (Why is that?)
- Introduction to distributive categories
- Substitution revisited
- A co-induction principle for recursively defined domains
- Categorical data types in parametric polymorphism
- Parametricity of extensionally collapsed term models of polymorphism and their categorical properties
- A note on categorical datatypes
- Codatatypes in ML
Cited In (13)
- Deforestation, program transformation, and cut-elimination
- Bootstrapping Inductive and Coinductive Types in HasCASL
- Strongly normalising cyclic data computation by iteration categories of second-order algebraic theories
- Semantics for first-order affine inductive data types via slice categories
- Structural induction and coinduction in a fibrational setting
- Cyclic datatypes modulo bisimulation based on second-order algebraic theories
- Global semantic typing for inductive and coinductive computing
- μ-Bicomplete Categories and Parity Games
- Fixed-Point Elimination in the Intuitionistic Propositional Calculus
- Coalgebras as types determined by their elimination rules
- Induction, coinduction, and adjoints
- Title not available (Why is that?)
- Classical (co)recursion: Mechanics
This page was built for publication: Strong categorical datatypes II: A term logic for categorical programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673963)
