A confluent reduction for the λ-calculus with surjective pairing and terminal object

Journal of Functional Programming

Volumn 6, Issue 2, 1996, Pages 299-327

  Curien, Pierre Louis ^a   Di Cosmo, Roberto ^b  

^a Centre National de la Recherche Scientifique   (France)

^b LIENS (CNRS URA 1327) DMI   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042901811     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0956796800001696     Document Type: Article

References (25)

1. Akama, Y. (1993) On Mints' reductions for ccc-Calculus. Typed lambda calculus and applications. LNCS 664, pp. 1-12. Springer-Verlag.
2. Barendregt, H. (1984) The lambda calculus; its syntax and semantics (revised edition). North Holland.
3. Breazu-Tannen, V. (1988) Combining algebra and higher order types. In: Proceedings of the symposium on logic in computer science (LICS), pp. 82-90.
4. Breazu-Tannen, V. and Gallier, J. (1994) Polymorphic rewiting preserves algebraic confluence. Information and Computation. To appear.
5. Bruce, K., Di Cosmo, R. and Longo, G. (1992) Provable isomorphisms of types. Mathematical Structures in Computer Science, 2(2), 231-247.
6. Cubric, D. (1992) On free CCC. Distributed on the types mailing list.
7. ≤. Information and Computation. To appear.
8. de Vrijer, R. C. (1987) Surjective pairing and strong normalization: two themes in λ-calculus. Ph.D. thesis, Universiteit van Amsterdam.
9. Dezani-Ciancaglini, M. (1976) Characterization of normal forms possessing an inverse in the λβη calculus. Theoretical Computer Science, 2, 323-337.
10. Di Cosmo, R. (1994) Second order isomorphic types. A proof theoretic study on second order λ-calculus with surjective pairing and terminal object. Information and Computation. To appear.
11. Di Cosmo, R. and Kesner, D. (1994a) Combining first order algebraic rewriting systems, recursion and extensional lambda calculi. In: Abiteboul, S. and Shamir, E. (eds), International Conference on Automata, Languages and Programming (ICALP), pp. 462-472. Lecture Notes in Computer Science, 820. Springer-Verlag.
12. Di Cosmo, Ro. and Kesner, D. (1994b) Simulating expansions without expansions. Mathematical Structures in Computer Science, 4, 1-48.
13. Dougherty, D. J. (1993) Some lambda calculi with categorical sums and products. In: Proceedings of the Fifth International Conference on Rewriting Techniques and Applications (RTA).
14. Girard, J.-Y., Lafont, Y. and Taylor, P. (1990) Proofs and Types. Cambridge University Press.
15. Hardin, T. (1989) Confluence results for the pure strong categorical logic C.C.L.; λ-calculi as subsystems of C.C.L. Theoretical Computer Science, 65(2), 291-342.
16. Jay, C. B. and Ghani, N. (1992) The Virtues of Eta-expansion. Tech. rept. ECS-LFCS-92-243. LFCS. University of Edimburgh.
17. Klop, J. W. (1980) Combinatory reduction systems. Mathematical Center Tracts, 27.
18. Lambek, J. and Scott, P. J. (1986) An Introduction to Higher Order Categorical Logic. Cambridge University Press.
19. Mints, G. A simple proof of the coherence theorem for cartesian closed categories. Bibliopolis. To appear.
20. Nipkow, T. (1990) A critical pair lemma for higher-order rewrite systems and its application to λ*. In: First Annual Workshop on Logical Frameworks.
21. Obtulowicz, A. (1987) Algebra of constructions I. The Word Problem for Partial Algebras. Information and Computation, 73(2), 129-173.
22. Poigné, A. and Voss, J. (1987) On the implementation of abstract data types by programming language constructs. Journal of Computer and System Science, 34(2-3), 340-376.
23. Pottinger, G. (1981) The Church Rosser Theorem for the Typed lambda-calculus with Surjective Pairing. Notre Dame Journal of Formal Logic, 22(3), 264-268.
24. Tait, W. W. (1967) Intensional interpretation of functionals of finite type I. Journal of Symbolic Logic, 32.
25. Troelstra, A. S. (1986) Strong normalization for typed terms with surjective pairing. Notre Dame Journal of Formal Logic, 27(4).