Strong categorical datatypes II: A term logic for categorical programming
From MaRDI portal
(Redirected from Publication:673963)
Recommendations
Cites work
- scientific article; zbMATH DE number 426302 (Why is no real title available?)
- A co-induction principle for recursively defined domains
- A note on categorical datatypes
- Categorical data types in parametric polymorphism
- Codatatypes in ML
- Introduction to distributive categories
- Parametricity of extensionally collapsed term models of polymorphism and their categorical properties
- Strong functors and monoidal monads
- Substitution revisited
Cited in
(13)- Coalgebras as types determined by their elimination rules
- Bootstrapping Inductive and Coinductive Types in HasCASL
- scientific article; zbMATH DE number 426302 (Why is no real title available?)
- Strongly normalising cyclic data computation by iteration categories of second-order algebraic theories
- Global semantic typing for inductive and coinductive computing
- Fixed-Point Elimination in the Intuitionistic Propositional Calculus
- Semantics for first-order affine inductive data types via slice categories
- μ-Bicomplete Categories and Parity Games
- Structural induction and coinduction in a fibrational setting
- Deforestation, program transformation, and cut-elimination
- Classical (co)recursion: Mechanics
- Induction, coinduction, and adjoints
- Cyclic datatypes modulo bisimulation based on second-order algebraic theories
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)
