A linear logical view of linear type isomorphisms

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

Volumn 1683, Issue , 1999, Pages 250-265

  Balat, Vincent ^a   Di Cosmo, Roberto ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS); SET THEORY;

CORRECTNESS CRITERION; LIBRARY SEARCH; LINEAR LAMBDA CALCULUS; LINEAR LOGIC; LINEAR TYPES; PROOF NET;

COMPUTER CIRCUITS;

EID: 22844455511     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48168-0_18     Document Type: Conference Paper

References (22)

1. A. Andreev and S. Soloviev. A deciding algorithm for linear isomorphism of types with complexity o(nlog2(n)). In E. Moggi and G. Rossolini, editors, Category Theory and Computer Science, number 1290 in LNCS, pages 197–210, 1997.
2. M.-V. Aponte and R. Di Cosmo. Type isomorphisms for module signatures. In Programming Languages Implementation and Logic Programming (PLILP), volume 1140 of Lecture Notes in Computer Science, pages 334–346. Springer- Verlag, 1996.
3. G. Berry and P.-L. Curien. Theory and practice ofsequen tial algorithms: the kernel ofthe applicative language CDS. In M. Nivat and J. Reynolds, editors, Algebraic methods in semantics, pages 35–87. Cambridge University Press, 1985.
4. K. Bruce, R. Di Cosmo, and G. Longo. Provable isomorphisms oft ypes. Mathematical Structures in Computer Science, 2(2):231–247, 1992.
5. K. Bruce and G. Longo. Provable isomorphisms and domain equations in models oft yped languages. ACM Symposium on Theory of Computing (STOC 85), May 1985.
6. D. Delahaye, R. Di Cosmo, and B. Werner. Recherche dans une biblioth`eque de preuves Coq en utilisant le type et modulo isomorphismes. In PRC/GDR de programmation, Pˆole Preuves et Specifications Algebriques, November 1997.
7. R. Di Cosmo. Invertibility ofterms and valid isomorphisms. a prooftheoretic study on second order λ-calculus with surjective pairing and terminal object. Technical Report 91-10, LIENS - Ecole Normale Superieure, 1991.
8. R. Di Cosmo. Type isomorphisms in a type assignment framework. In 19th Ann. ACM Symp. on Principles of Programming Languages (POPL), pages 200–210. ACM, 1992.
9. R. Di Cosmo. Deciding type isomorphisms in a type assignment framework. Journal of Functional Programming, 3(3):485–525, 1993. Special Issue on ML.
10. R. Di Cosmo. Isomorphisms of types: from λ-calculus to information retrieval and language design. Birkhauser, 1995. ISBN-0-8176-3763-X.
11. R. Di Cosmo and G. Longo. Constuctively equivalent propositions and isomorphisms ofob jects (or terms as natural transformations). In Moschovakis, editor, Logic from Computer Science, volume 21 of Mathematical Sciences Research Institute Publications, pages 73–94. Springer Verlag, Berkeley, 1991.
12. K. Dosen and Z. Petric. Isomorphic objects in symmetric monoidal closed categories. Technical Report 95-49-R, IRIT, 1995.
13. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50, 1987.
14. S. Mac Lane and G. M. Kelly. Coherence in Closed Categories. Journal of Pure and Applied Algebra, 1(1):97–140, 1971.
15. C. F. Martin. Axiomatic bases for equational theories of natural numbers. Notices of the Am. Math. Soc., 19(7):778, 1972.
16. L. Meertens and A. Siebes. Universal type isomorphisms in cartesian closed categories. Centrum voor Wiskunde en Informatica, Amsterdam, the Netherlands. E-mail: lambert,arno@cwi.nl, 1990.
17. th Int. Conf. on Automated Deduction. Lecture Notes in Computer Science, 449, July 1990.
18. M. Rittri. Searching program libraries by type and proving compiler correctness by bisimulation. PhD thesis, University ofG¨oteborg, G¨oteborg, Sweden, 1990.
19. M. Rittri. Using types as search keys in function libraries. Journal of Functional Programming, 1(1):71–89, 1991.
20. C. Runciman and I. Toyn. Retrieving re-usable software components by polymorphic type. Journal of Functional Programming, 1(2):191–211, 1991.
21. S. V. Soloviev. The category offinite sets and cartesian closed categories. Journal of Soviet Mathematics, 22(3):1387–1400, 1983.
22. S. V. Soloviev. A complete axiom system for isomorphism of types in closed categories. In A. Voronkov, editor, Logic Programming and Automated Reasoning, 4th International Conference, volume 698 of Lecture Notes in Artificial Intelligence (subseries of LNCS), pages 360–371, St. Petersburg, Russia, 1993. Springer-Verlag.