Indexed induction-recursion

Journal of Logic and Algebraic Programming

Volumn 66, Issue 1, 2006, Pages 1-49

  Dybjer, Peter ^a   Setzer, Anton ^b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

Dependent type theory; Generic programming; Inductive definitions; Inductive families; Inductive recursive definitions; Initial algebras; Martin L f type theory; Normalisation proofs

Indexed keywords

FORMAL LOGIC; FUNCTIONS; MATHEMATICAL MODELS; THEOREM PROVING;

DEPENDENT TYPE THEORY; GENERIC PROGRAMMING; INDUCTIVE ALGEBRAS; INDUCTIVE DEFINITIONS; INDUCTIVE FAMILIES; INDUCTIVE-RECURSIVE DEFINITIONS; MARTIN-LÖ-F TYPE THEORY; NORMALIZATION PROOFS;

SET THEORY;

EID: 27744580384     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jlap.2005.07.001     Document Type: Article

References (32)

1. P. Aczel Frege Structures and the Notions of Proposition, Truth, and Set 1980 North-Holland Amsterdam pp. 31-59
2. T. Altenkirch, V. Gaspes, B. Nordström, B. vonSydow, A user's guide to ALF, 〈http://www.cs.chalmers.se /ComputingScience/Research/Logic/alf/ guide.html〉, 1996.
3. T. Altenkirch, C. McBride, Generic programming within dependently typed programming, in: Generic Programming, 2003, Proceedings of the IFIP TC2 Working Conference on Generic Programming, Schloss Dagstuhl, July 2002.
4. T. Altenkirch, B. Reus, Monadic presentations of lambda terms using generalized inductive types, in: Computer Science Logic, 1999.
5. M. Benke, P. Dybjer, and P. Jansson Universes for generic programs and proofs in dependent type theory Nordic J. Comput. 10 2003 265 289
6. A. Bove, and V. Capretta Nested general recursion and partiality in type theory R.J. Boulton P.B. Jackson Theorem Proving in Higher Order Logics: 43th International Conference, TPHOLs 2001 LNCS vol. 2152 2001 Springer-Verlag Berlin 121 135
7. C. Coquand, Agda, 〈http://www.cs.chalmers.se/~catarina/agda/〉, 2000.
8. C. Coquand A realizability interpretation of Martin-Löf's type theory G. Sambin J. Smith Twenty-Five Years of Constructive Type Theory 1998 Oxford University Press Oxford
9. T. Coquand, Pattern matching with dependent types, in: B. Nordström and Kent Petersson and Gordon Plotkin (Eds.), Proceedings of The 1992 Workshop on Types for Proofs and Programs, June 1992.
10. T. Coquand, and C. Paulin Inductively defined types, preliminary version COLOG '88, International Conference on Computer Logic LNCS vol. 417 1990 Springer-Verlag Berlin
11. P. Dybjer Inductive sets and families in Martin-Löf's type theory and their set-theoretic semantics G. Huet G. Plotkin Logical Frameworks 1991 Cambridge University Press Cambridge 280 306
12. P. Dybjer Inductive families Formal Aspects Comput. 6 1994 440 465
13. P. Dybjer A general formulation of simultaneous inductive-recursive definitions in type theory J. Symbolic Logic 65 2 2000 525 549
14. P. Dybjer, and A. Setzer A finite axiomatization of inductive-recursive definitions J.-Y. Girard Typed Lambda Calculi and Applications Lecture Notes in Computer Science vol. 1581 1999 Springer Berlin 129 146
15. P. Dybjer, A. Setzer, Indexed induction-recursion, in: Proof Theory in Computer Science, International Seminar, PTCS 2001 Dagstuhl Castle, Germany, LNCS, vol. 2183, 2001, pp. 93-113.
16. P. Dybjer, and A. Setzer Induction-recursion and initial algebras Ann. Pure Appl. Logic 124 2003 1 47
17. R. Hinze, and J. Jeuring Generic Haskell: Practice and theory R. Backhouse J. Gibbons Generic Programming LNCS vol. 2793 2003 Springer-Verlag Berlin 1 56
18. P. Jansson, and J. Jeuring PolyP-a polytypic programming language extension Proc. POPL'97 1997 ACM Press New York 470 482
19. L. Magnusson, and B. Nordström The ALF proof editor and its proof engine Types for Proofs and Programs Lecture Notes in Computer Science vol. 806 1994 Springer Berlin 213 317
20. P. Martin-Löf Constructive mathematics and computer programming Logic, Methodology and Philosophy of Science, VI, 1979 1982 North-Holland Amsterdam 153 175
21. P. Martin-Löf, On the meaning of the logical constants and the justification of the logical laws, Notes From a Series of Lectures Given in Siena, 1983.
22. P. Martin-Löf Intuitionistic Type Theory 1984 Bibliopolis Napels
23. P. Martin-Löf An intuitionistic theory of types G. Sambin J. Smith Twenty-Five Years of Constructive Type Theory 1998 Oxford University Press Oxford Reprinted version of an unpublished report from 1972
24. R. Matthes, Review of Dybjer, Peter and Setzer, Anton: Induction-recursion and initial algebras, Mathematical Reviews, 2005, MR2013392, in press.
25. B. Nordström, K. Petersson, and J. Smith Programming in Martin-Löf's Type Theory: An Introduction 1990 Oxford University Press Oxford
26. E. Palmgren, On Fixed Point Operators, Inductive Definitions and Universes in Martin-Löf's Type Theory, PhD thesis, Uppsala University, 1991.
27. E. Palmgren On universes in type theory G. Sambin J. Smith Twenty-Five Years of Constructive Type Theory 1998 Oxford University Press Oxford
28. C. Paulin-Mohring Inductive definitions in the system Coq-rules and properties Proceedings Typed λ-Calculus and Applications LNCS 1993 Springer-Verlag Berlin 328 345
29. H. Pfeifer, and H. Rueß Polytypic proof construction Y. Bertot Proc. TPHOLs'99 LNCS vol. 1690 1999 Springer-Verlag Berlin 55 72
30. H. Qiao Formalising formulas-as-types-as-objects T. Coquand P. Dybjer B. Nordström J. Smith Types for Proofs and Programs Lecture Notes in Computer Science vol. 1956 2000 Springer Berlin 174 194
31. A. Setzer Extending Martin-Löf type theory by one Mahlo-universe Arch. Math. Log. 39 2000 155 181
32. A. Setzer Proof theory of Martin-Löf type theory-an overview Mathematiques et Sciences Humaines 42 165 2004 59 99