Remarks on isomorphisms in typed lambda calculi with empty and sum types

Annals of Pure and Applied Logic

Volumn 141, Issue 1-2, 2006, Pages 35-50

  Fiore, Marcelo ^a   Di Cosmo, Roberto ^b,c   Balat, Vincent ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITÉ PARIS 13   (France)

^c INRIA Roquencourt   (France)

Author keywords

Tarski's high school algebra problem; Type isomorphism; Typed lambda calculus with sums

Indexed keywords

EID: 33747374376     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2005.09.001     Document Type: Article

References (31)

1. Aponte M.-V., and Di Cosmo R. Type isomorphisms for module signatures. Programming Languages Implementation and Logic Programming (PLILP). Lecture Notes in Computer Science vol. 1140 (1996), Springer-Verlag 334-346
2. Balat V., and Di Cosmo R. A linear logical view of linear type isomorphisms. Computer Science Logic. Lecture Notes in Computer Science vol. 1683 (1999), Springer-Verlag 250-265
3. Balat V., Di Cosmo R., and Fiore M. Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums. 31st Ann. ACM Symp. on Principles of Programming Languages. POPL (2004), ACM 64-76
4. Barthes G., and Pons O. Type isomorphisms and proof reuse in dependent type theory. In: Honsell F., and Miculan M. (Eds). FOSSACS. LNCS vol. 2030 (2001), Springer-Verlag 57-71
5. Bruce K., Di Cosmo R., and Longo G. Provable isomorphisms of types. Mathematical Structures in Computer Science 2 2 (1992) 231-247
6. K. Bruce, G. Longo, Provable isomorphisms and domain equations in models of typed languages, in: ACM Symposium on Theory of Computing, STOC 85, 1985
7. Burris S., and Lee S. Tarski's high school identities. American Mathematical Monthly 100 3 (1993) 231-236
8. Carboni A., Lack S., and Walters R.F.C. Introduction to extensive and distributive categories. Journal of Pure and Applied Algebra 84 (1993) 145-158
9. Cockett J.R.B. Introduction to distributive categories. Mathematical Structures in Computer Science 3 (1993) 277-307
10. D. Delahaye, R. Di Cosmo, B. Werner, Recherche dans une bibliothèque de preuves Coq en utilisant le type et modulo isomorphismes, in: PRC/GDR de programmation, Pôle Preuves et Spécifications Algébriques, 1997
11. Di Cosmo R. Type isomorphisms in a type assignment framework. 19th Ann. ACM Symp. on Principles of Programming Languages. POPL (1992), ACM 200-210
12. Di Cosmo R. Deciding type isomorphisms in a type assignment framework. Journal of Functional Programming 3 3 (1993) 485-525 (special issue on ML)
13. Di Cosmo R. Isomorphisms of Types: from λ-Calculus to Information Retrieval and Language Design (1995), Birkhauser
14. Di Cosmo R. Second order isomorphic types. A proof theoretic study on second order λ-calculus with surjective pairing and terminal object. Information and Computation (1995) 176-201
15. Doner J., and Tarski A. An extended arithmetic of ordinal numbers. Fundamenta Mathematica 65 (1969) 95-127
16. Dosen K., and Petric Z. Isomorphic objects in symmetric monoidal closed categories. Mathematical Structures in Computer Science 7 6 (1997) 639-662
17. M. Fiore, R. Di Cosmo, V. Balat, Extensional normalisation for typed lambda calculus with sums via Grothendieck logical relations. Manuscript, 2002
18. Gurevič R. Equational theory of positive numbers with exponentiation. Proceedings of the American Mathematical Society 94 1 (1985) 135-141
19. Gurevič R. Equational theory of positive numbers with exponentiation is not finitely axiomatizable. Annals of Pure and Applied Logic 49 (1990) 1-30
20. Lambek J., and Scott P. Introduction to Higher Order Categorical Logic. Cambridge Studies in Advanced Mathematics vol. 7 (1986), Cambridge University Press
21. Lawvere F.W. Left and right adjoint operations on spaces and data types. Theoretical Computer Science 316 (2004) 105-111
22. Martin C.F. Axiomatic bases for equational theories of natural numbers. Notices of the American Mathematical Society 19 7 (1972) 778
23. Rittri M. Retrieving library identifiers by equational matching of types. 10th Int. Conf. on Automated Deduction. Lecture Notes in Computer Science vol. 449 (1990), Springer-Verlag
24. M. Rittri, Searching program libraries by type and proving compiler correctness by bisimulation, Ph.D. Thesis, University of Göteborg, Göteborg, Sweden, 1990
25. Rittri M. Using types as search keys in function libraries. Journal of Functional Programming 1 1 (1991) 71-89
26. Runciman C., and Toyn I. Retrieving re-usable software components by polymorphic type. Journal of Functional Programming 1 2 (1991) 191-211
27. Schanuel S.H. Objective number theory and the retract chain condition. Journal of Pure and Applied Algebra 154 (2000) 295-298
28. Schanuel S.H. Transcendence in objective number theory. Rendiconti del Circolo Matematico di Palermo Serie II Suppl. 64 (2000) 43-48
29. Soloviev S.V. The category of finite sets and cartesian closed categories. Journal of Soviet Mathematics 22 3 (1983) 1387-1400
30. Soloviev S.V. A complete axiom system for isomorphism of types in closed categories. In: Voronkov A. (Ed). Logic Programming and Automated Reasoning, 4th International Conference. Lecture Notes in Artificial Intelligence vol. 698 (1993), Springer-Verlag 360-371
31. A.J. Wilkie, On exponentiation - A solution to Tarski's high school algebra problem, Math. Inst. Oxford University, 1981 (preprint)