A finite axiomatization of inductive-recursive definitions (1999)

by Peter Dybjer , Anton Setzer
Venue:Typed Lambda Calculi and Applications, volume 1581 of Lecture Notes in Computer Science
Citations:42 - 14 self

Documents Related by Co-Citation

44 Indexed Induction-Recursion – Peter Dybjer, Anton Setzer - 2001
76 Inductive Sets and Families in Martin-Löf's Type Theory and Their Set-Theoretic Semantics – Peter Dybjer - 1991
342 Intuitionistic Type Theory – Per Martin-Löf - 1984
65 Inductive Families – Peter Dybjer - 1997
65 A General Formulation of Simultaneous Inductive-Recursive Definitions in Type Theory – Peter Dybjer - 1998
28 Induction-recursion and initial algebras – Peter Dybjer, Anton Setzer - 2003
32 On universes in type theory – Erik Palmgren - 1998
156 An intuitionistic theory of types: predicative part – P Martin-Löf - 1975
42 Universes for Generic Programs and Proofs in Dependent Type Theory – Marcin Benke, Peter Dybjer, Patrik Jansson - 2003
163 Inductive Definitions in the System Coq Rules and Properties – Christine Paulin-Mohring - 1992
77 Monadic Presentations of Lambda Terms Using Generalized Inductive Types – Thorsten Altenkirch, Bernhard Reus - 1999
264 Constructive mathematics and computer programming – P Martin-Lof - 1982
19 Inductively defined types, preliminary version – T Coquand, C Paulin-Mohring - 1990
170 Towards a practical programming language based on dependent type theory – Ulf Norell - 2007
52 Generic programming within dependently typed programming – Thorsten Altenkirch, Conor Mcbride - 2003
178 PolyP - a polytypic programming language extension – Patrik Jansson, Johan Jeuring - 1997
40 Syntax and Semantics of Dependent Types – Martin Hofmann - 1997
219 Cayenne -- a Language With Dependent Types – Lennart Augustsson - 1998
109 Inductively defined types – Thierry Coquand, Christine Paulin - 1988