Classical isomorphisms of types

Mathematical Structures in Computer Science

Volumn 15, Issue 5, 2005, Pages 969-1004

  Laurent, Olivier ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750711048     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129505004895     Document Type: Article

References (28)

1. Abramsky, S., Honda, K. and McCusker, G. (1998) A fully abstract game semantics for general references. In: Proceedings of the thirteenth annual symposium on Logic In Computer Science, IEEE Computer Society Press 334-344.
2. Abramsky, S. and Jagadeesan, R. (1994) Games and full completeness for multiplicative linear logic. Journal of Symbolic Logic 59 (2) 543-574.
3. Abramsky, S. and McCusker, G. (1999) Full abstraction for idealized algol with passive expressions. Theoretical Computer Science 227 3-42.
4. Abramsky, S. and Melliès, P.-A. (1999) Concurrent games and full completeness. In: Proceedings of the fourteenth annual symposium on Logic In: Computer Science, IEEE Computer Society Press 431-442.
5. Baillot, P., Danos, V., Ehrhard, T. and Regnier, L. (1997) Believe it or not, AJM's games model is a model of classical linear logic. In: Proceedings of the twelfth annual symposium on Logic In Computer Science, IEEE Computer Society Press 68-75.
6. Balat, V. and Di Cosmo, R. (1999) A linear logical view of linear type isomorphisms. In: Flum, J. and Rodríguez-Artalejo, M. (eds.) Computer Science Logic. Springer-Verlag Lecture Notes in Computer Science 1683 250-265.
7. Barthe, G. and Pons, O. (2001) Type isomorphisms and proof reuse in dependent type theory. In: Honsell, F. and Miculan, M. (eds.) Foundations of Software Science and Computation Structures. Springer-Verlag Lecture Notes in Computer Science 2030 57-71.
8. Berry, G. and Curien, P.-L. (1982) Sequential algorithms on concrete data structures. Theoretical Computer Science 20 265-321.
9. Bruce, K., Di Cosmo, R. and Longo, G. (1992) Provable isomorphisms of types. Proceedings of Symposium on Symbolic Computation, ETH, Zurich. Mathematical Structures in Computer Science 2 (2) 231-247.
10. Danos, V., Joinet, J.-B. and Schellinx, H. (1995) LKQ and LKT: Sequent calculi for second order logic based upon dual linear decompositions of classical implication. In: Girard, J.-Y., Lafont, Y. and Regnier, L. (eds.) Advances in Linear Logic. London Mathematical Society Lecture Note Series, Cambridge University Press 222 211-224.
11. Danos, V., Joinet, J.-B. and Schellinx, H. (1997) A new deconstructive logic: linear logic. Journal of Symbolic Logic 62 (3) 755-807.
12. Delahaye, D., Di Cosmo, R. and Werner, B. (1997) 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.
13. Dezani-Ciancaglini, M. (1976) Characterization of normal forms possessing an inverse in the λβη-calculus. Theoretical Computer Science 2 323-337.
14. Di Cosmo, R. (1995) Isomorphisms of Types, Progress in Theoretical Computer Science, Birkhäuser.
15. Fiore, M., Di Cosmo, R. and Balat, V. (2002) Remarks on isomorphisms in typed lambda calculi with empty and sum types. In: Proceedings of the seventeenth annual symposium on Logic In Computer Science, IEEE Computer Society Press 147-156.
16. Harmer, R. (1999) Games and Full Abstraction for Nondeterministic Languages, Ph.D. thesis, Imperial College and University of London.
17. Lang, S. (2002) Algebra (third edition), Graduate Texts in Mathematics, Springer.
18. Laurent, O. (2002) Étude de la polarisation en logique, Thèse de doctorat, Université Aix-Marseille II.
19. Laurent, O. (2005) Syntax vs. semantics: a polarized approach. To appear in Theoretical Computer Science.
20. Levy, P. B. (1999) Call-by-push-value: A subsuming paradigm. In: Girard, J.-Y. (ed.) Typed Lambda Calculi and Applications '99. Springer-Verlag Lecture Notes in Computer Science 1581 228-242.
21. Macintyre, A. (1991) Schanuel's conjecture and free exponential rings. Annals of Pure and Applied Logic 51 241-246.
22. Padovani, V. (2001) Retracts in simple types. In: Abramsky, S. (ed.) Typed Lambda Calculi and Applications '01. Springer-Verlag Lecture Notes in Computer Science 2044 376-384.
23. Palsberg, J. and Zhao, T. (2001) Efficient and flexible matching of recursive types. Information and Computation 171 364-387.
24. Plotkin, G. (1975) Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science 1 125-159.
25. Rittri, M. (1991) Using types as search keys in function libraries. Journal of Functional Programming 1 (1) 71-89.
26. Selinger, P. (2001) Control categories and duality: on the categorical semantics of the lambda-mu calculus. Mathematical Structures in Computer Science 11 (2) 207-260.
27. Soloviev, S. (1983) The category of finite sets and cartesian closed categories. Journal of Soviet Mathematics 22 (3) 1387-1400.
28. van den Dries, L. (1984) Exponential rings, exponential polynomials and exponential functions. Pacific Journal of Mathematics 113 (1) 51-66.