Infinite objects in type theory

DOI10.1007/3-540-58085-9_72zbMath1527.03008OpenAlexW1491165055MaRDI QIDQ6083690

Thierry Coquand

Publication date: 8 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58085-9_72

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Combinatory logic and lambda calculus (03B40) Type theory (03B38)

Related Items (3)

Generalizing Inference Systems by Coaxioms ⋮ Unnamed Item ⋮ Undecidability of equality for codata types

Cites Work

• An intensional characterization of the largest bisimulation
• Grammar semantics, analysis and parsing by abstract interpretation
• Co-induction in relational semantics
• Inductive families
• Logical reflection and formalism
• Constructive definition of certain analytic sets of numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Infinite objects in type theory