A predicative strong normalisation proof for a λ-calculus with interleaving inductive types

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1956, Issue , 2000, Pages 21-40

  Abel, Andreas ^a   Altenkirch, Thorsten ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS;

COINDUCTIVE TYPES; FIXPOINTS; INDUCTIVE DEFINITIONS; INDUCTIVE-TYPE; LAMBDA CALCULUS; MONOTONE OPERATORS; NORMALISATION; POSITIVE OPERATOR;

DIFFERENTIATION (CALCULUS);

EID: 84977479266     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44557-9_2     Document Type: Conference Paper

References (23)

1. Andreas Abel and Thorsten Altenkirch. A predicative analysis of structural recursion. Submitted to the Journal of Functional Programming, December 1999.
2. Andreas Abel. A semantic analysis of structural recursion. Master’s thesis, Ludwig-Maximilians-University Munich, 1999. http://www.informatik.uni-muenchen.de/~abel/publications/.
3. Peter Aczel. Notes on constructive set theory. Available from the WWW, 1997.
4. Thorsten Altenkirch. Constructions, Inductive Types and Strong Normalization. PhD thesis, University of Edinburgh, November 1993.
5. Thorsten Altenkirch. Logical relations and inductive/coinductive types. 1998.
6. Thorsten Altenkirch and Bernhard Reus. Monadic presentations of lambda terms using generalized inductive types. In Computer Science Logic 99, 1999.
7. Holger Benl. Starke Normalisierung für die Heyting-Arithmetik mit induktiven Typen. Master’s thesis, Ludwig-Maximillians-Universitat, Munchen, 1998.
8. Frederic Blanqui, Jean-Pierre Jouannaud, and Mitsuhiro Okada. Inductive data type systems. To appear in Theoretical Computer Science, 1999. Wilfried Buchholz. The wμ+1-rule. In Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-Theoretical Studies, volume 897 of Lecture Notes in Mathematics, pages 188-233. 1981.
9. Thierry Coquand and Christine Mohring. Inductively defined types. In P. Lof and G. Mints, editors, LNCS 389, volume 417 of Lecture Notes in Computer Science, pages 50-66. Springer-Verlag, 1989.
10. Infinite objects in type theory. LNCS, pages 62-78, Berlin, 1994. Springer-Verlag.
11. Peter Dybjer. Inductive sets and families in Martin-Löfs type theory and their set-theoretic semantics. Technical Report Report 62, Programming Methodology Group, Chalmers University, 1991.
12. Herman Geuvers. Inductive and coinductive types with iteration and recursion. In Workshop on Types for Proofs and Programs, Bâstad, pages 193-217, 1992.
13. J. Y. Girard. Interprétation fonctionelle et élimination des coupures dans l’arithétique d’ordre supérieur. PhD thesis, Universite Paris VII, 1972. J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge University Press, 1989.
14. Tatsuya Hagino. A Categorical Programming Language. PhD thesis, University of Edinburgh, September 1987.
15. C.B. Jay, G. Belle, and E. Moggi, Functorial ML. Journal of Functional Programming, 8(6):573-619, 1998.
16. J. P. Jouannaud and M. Okada. Abstract data type systems. Theoretical Computer Science, 173, 1997.
17. Ralph Loader. Equational theories for inductive types. Annals of Pure and, Applied Logic, 84:175-217, 1997.
18. Zhaohui Luo. An Extended Calculus of Constructions. PhD thesis, University of Edinburgh, 1990.
19. Per Martin-Lof. Intuitionistic Type Theory. Bibliopolis, 1984.
20. Ralph Matthes. Extensions of System F by Iteration And Primitive Recursion on Monotone Inductive Types. PhD thesis, University of Munich, 1998.
21. Nax P. Mendler. Inductive Definition in Type Theory. PhD thesis, Cornell University, 1988.
22. John C. Reynolds. Polymorphism is not set-theoretic. In Gilles Kahn, David B. MacQueen, and Gordon D. Plotkin, editors, Semantics of Data Types, volume 173 of Lecture Notes in Computer Science, pages 145-156, Berlin, 1984. Springer-Verlag.
23. W. W. Tait. Intensional interpretations of functionals of finite type I. Journal of Symbolic Logic, 32(2):198-212, June 1967.