Proof Theory of Martin-Lof Type Theory -- An (2004)

by Overview Anton Setzer , Anton Setzer
Venue:Mathematiques et Sciences Humaines, 42 année, n o 165:59 – 99
Citations:4 - 2 self

Active Bibliography

28 Induction-recursion and initial algebras – Peter Dybjer, Anton Setzer - 2003
43 Indexed Induction-Recursion – Peter Dybjer, Anton Setzer - 2001
65 A General Formulation of Simultaneous Inductive-Recursive Definitions in Type Theory – Peter Dybjer - 1998
5 Ordinals and Interactive Programs – Peter Hancock - 2000
11 P.: Dependent types at work – Ana Bove, Peter Dybjer - 2009
42 A finite axiomatization of inductive-recursive definitions – Peter Dybjer, Anton Setzer - 1999
22 A Brief Overview of Agda – A Functional Language with Dependent Types – Ana Bove, Peter Dybjer, Ulf Norell
18 Well-ordering proofs for Martin-Löf Type Theory – Anton Setzer - 1998
1 A data type of partial recursive functions in Martin-Löf Type Theory. 35pp, submitted – Anton Setzer - 2007
31 Constructions, Inductive Types and Strong Normalization – Thorsten Altenkirch - 1993
98 Martin-Löf’s Type Theory – B. Nordström, K. Petersson, J. M. Smith - 2000
7 Partial computations in constructive type theory – Scott F. Smith - 1991
1 Propositional Functions and Families of Types – Jan M. Smith - 1989
4 TYPE THEORY AND HOMOTOPY – Steve Awodey
22 Normalization by evaluation for Martin-Löf type theory with one universe – Andreas Abel, Klaus Aehlig, Peter Dybjer - 2007
66 Inductive Families – Peter Dybjer - 1997
7 The art of ordinal analysis – Michael Rathjen - 2006
Small Induction Recursion – Peter Hancock, Conor Mcbride, Lorenzo Malatesta, Thorsten Altenkirch
1 A Generic Formal Metatheory Framework for First-Order Representations – Gyesik Lee, Bruno C. D. S. Oliveira, Sungkeun Cho, Kwangkeun Yi