Strong categorical datatypes II: A term logic for categorical programming

DOI10.1016/0304-3975(94)00099-5zbMath0874.68033OpenAlexW1979170753MaRDI QIDQ673963

Dwight Spencer, J. Robin B. Cockett

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

zbMATH Keywords

categorical programming language implementation

Mathematics Subject Classification ID

Theory of programming languages (68N15) Logic in computer science (03B70)

Related Items

μ-Bicomplete Categories and Parity Games ⋮ Classical (co)recursion: Mechanics ⋮ Deforestation, program transformation, and cut-elimination ⋮ Fixed-Point Elimination in the Intuitionistic Propositional Calculus ⋮ Structural induction and coinduction in a fibrational setting ⋮ Induction, Coinduction, and Adjoints ⋮ Coalgebras as Types Determined by Their Elimination Rules

Cites Work

• Unnamed Item
• Codatatypes in ML
• Substitution revisited
• A co-induction principle for recursively defined domains
• Strong functors and monoidal monads
• Introduction to distributive categories
• Categorical data types in parametric polymorphism
• Parametricity of extensionally collapsed term models of polymorphism and their categorical properties
• A note on categorical datatypes