Induction-recursion and initial algebras (2003)

by Peter Dybjer , Anton Setzer
Venue:Annals of Pure and Applied Logic
Citations:28 - 11 self

Documents Related by Co-Citation

42 A finite axiomatization of inductive-recursive definitions – Peter Dybjer, Anton Setzer - 1999
44 Indexed Induction-Recursion – Peter Dybjer, Anton Setzer - 2001
260 Programming in Martin-Löf’s Type Theory. An Introduction – B Nordström, K Petersson, J M Smith - 1990
65 A General Formulation of Simultaneous Inductive-Recursive Definitions in Type Theory – Peter Dybjer - 1998
42 Universes for Generic Programs and Proofs in Dependent Type Theory – Marcin Benke, Peter Dybjer, Patrik Jansson - 2003
342 Intuitionistic Type Theory – Per Martin-Löf - 1984
13 A partial formalisation of a dependently typed language as an inductive-recursive family – Nils Anders Danielsson - 2007
36 Internal Type Theory – Peter Dybjer - 1996
65 Inductive Families – Peter Dybjer - 1997
40 Syntax and Semantics of Dependent Types – Martin Hofmann - 1997
32 On universes in type theory – Erik Palmgren - 1998
23 Inductive Families. Formal Aspects of Computing 6(4 – P Dybjer
10 Type theory should eat itself – J Chapman
141 Intuitionistic type theory. Bibliopolis – P Martin-Löf - 1984
83 Infinite Objects in Type Theory – Thierry Coquand
264 Constructive mathematics and computer programming – P Martin-Lof - 1982
61 Containers - constructing strictly positive types, Theoretical Computer Science 342 (2005) 3–27, applied Semantics: Selected Topics – M Abott, T Altenkirch, N Ghani
66 A Categorical Programming Language – Tatsuya Hagino, Tatsuya Hagino - 1987
18 Constructing Universes for Generic Programming – P Morris - 2007