Recursion over objects of functional type

Mathematical Structures in Computer Science

Volumn 11, Issue 4, 2001, Pages 555-572

  Despeyroux, Joelle ^a   Leleu, Pierre ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1142294673     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129501003346     Document Type: Article

References (22)

1. Akama, Y. (1993) On Mints reduction for ccc-calculus. In: Proceedings TLCA. Springer-Verlag Lecture Notes in Computer Science 664 1–12.
2. Bierman, G. and de Paiva, V. (1996) Intuitionistic necessity revisited. In: Technical Report CSRP-96-10, School of Computer Science, University of Birmingham.
3. Cosmo, R.D. and Kesner, D. (1993) A Confluent Reduction for the Extensional Typed 2-calculus. Proceedings ICALP'93. Springer-Verlag Lecture Notes in Computer Science 700.
4. Davies, R. and Pfenning, F. (1996) A modal analysis of staged computation. In: Steele, G.L. (ed.) Proceedings of the 23rd Annual Symposium on Principles of Programming Languages, St. Petersburg Beach, Florida, ACM Press 258–270.
5. Despeyroux, J., Felty, A. and Hirschowitz, A. (1995) Higher-order abstract syntax in Coq. In: Dezani, M. and Plotkin, G. (eds.) Proceedings of the TLCA 95 Int. Conference on Typed Lambda Calculi and Applications. Springer-Verlag Lecture Notes in Computer Science 902 124–138.
6. Despeyroux, J. and Hirschowitz, A. (1994) Higher-order syntax and induction in Coq. In: Proceedings of the FPAR'94 Int. Conference. Springer-Verlag Lecture Notes in Artificial Intelligence 822 73 159–173.
7. Despeyroux, J. and Leleu P. (1998) A modal 2-calcul with iteration and case constructs. In: Proceedings of the annual Types for Proofs and Programs seminar. Springer-Verlag Lecture Notes in Computer Science 1657.
8. Despeyroux, J. and Leleu P. (1999) Primitive recursion for higher-order abstract syntax with dependent types. In: Informal proceedings of the FFoC'99 IMLA Workshop on Intuitionistic Modal Logics and Applications.
9. Despeyroux, J. and Leleu P. (2000) Metatheoretic results for a modal lambda-calculus. Journal of Functional and Logic Programming 2000 (1).
10. Despeyroux, J., Pfenning, F. and Schurmann, C. (1997) Primitive recursion for higher-order abstract syntax. In: Proceedings of the TFCA'97 Int. Conference. Springer-Verlag Lecture Notes in Computer Science 1210 147–163. (An extended version is available as CMU Technical Report CMU-CS-96-172.)
11. Ghani, N. (1996) Eta Expansions in System F. Technical Report LIENS-96-10, LIENS-DMI.
12. Girard, J.-Y., Lafont, Y. and Taylor, P. (1989) Proofs and Types, Cambridge University Press.
13. Harper, R., Honsell, F. and Plotkin, G. (1993) A framework for defining logics. Journal of the Association for Computing Machinery 40 (1) 143–184.
14. Hofmann, M. (1999) Semantical analysis of higher-order abstract syntax. In: Proceedings of the International Conference on Logic In Computer Sciences, LICS, IEEE Computer Society Press 204–213.
15. Jay, C. and Ghani, N. (1995) The Virtues of Eta-Expansion. Journal of Functional Programming 5 (2) 135–154.
16. Leleu P. (1997) A modal 2-calculus with iteration and case constructs. Research Report RR-3322, INRIA.
17. McDowell, R. and Miller, D. (1997) A logic for reasoning with higher-order abstract syntax: An extended abstract. In: Proc. of LICS'97.
18. Paulin-Mohring, C. (1992) Inductive definitions in the system coq. rules and properties. In: Proc. of the TFCA'93 Int. Conference. Springer-Verlag Lecture Notes in Computer Science 664 328–345.
19. Pfenning, F. and Schumann, C. (1998) Automated Theorem Proving in a Simple Meta Logic for LF. In: Proceedings of the CADE-15 Conference, Lindau, Germany.
20. Pfenning, F. and Wong, H.-C. (1995) On a modal 2-calculus for S4. In: Brookes, S. and Main, M. (eds.) Proceedings of the 11th MFPS Conference, New Orleans, Louisiana. Electronic Notes in TCS 1, Elsevier.
21. Pfenning, F. and Xi, H. (1999) Dependent types in practical programming. In: Proceedings of the POPL'99 International Conference, San Antonio, Texas.
22. Werner, B. (1994) Une Theorie des Constructions Inductives, Ph. D. thesis, Universite Paris VII.