Constructively Equivalent Propositions and Isomorphisms of Objects, or Terms as Natural Transformations

  • Roberto Di Cosmo
  • Giuseppe Longo
Conference paper
Part of the Mathematical Sciences Research Institute Publications book series (MSRI, volume 21)


In these notes, we sketch a recent application of the typed and type-free λ-calculus to Proof Theory and Category Theory. The proof is fairly incomplete and we refer the reader interested in the lengthy technical details to Bruce & DiCosmo & Longo [1990]. Our main purpose here is to hint a logical framework for the result below, in a rather preliminary and problematic form. The occasion is provided by the kind invitation to deliver a lecture at a meeting with such a stimulating title.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Asperti A., Longo G. [1986], Categories of partial morphisms and the relation between type-structures, Mathematical Problems in Computation Theory, Warsaw, December 1985; Banach Center Publications, 21, 1987.Google Scholar
  2. Asperti A., Longo G. [1991], Categories, Types and Structures: An Introduction to Category Theory for the Working Computer Scientist, M.I.T. Press, to appear.MATHGoogle Scholar
  3. Bainbridge E., Freyd P., Scedrov A., P.J. Scott [1990], Functorial polymorphism, Theoretical Computer Science 70, 35–64.MathSciNetMATHCrossRefGoogle Scholar
  4. Bruce K., Di Cosmo R., Longo G. [1990], Provable isomorphisms of types, LIENS, technical report 90–14. (to appear: MSCS).Google Scholar
  5. Bruce K., Longo G. [1985], Provable isomorphisms and domain equations in models of typed languages, (Preliminary version) 1985 A.CM. Symposium on Theory of Computing (STOC 85), Providence (R.I.).Google Scholar
  6. Bruce K., Longo G. [1990], Modest models for inheritance and explicit polymorphism, Info& Comp. 87,1–2.MathSciNetCrossRefGoogle Scholar
  7. Cardelli L., Longo G. [1990], A semantic basis for Quest, DIGITAL, System Research Center, Report 55 (preliminary version: Conference on Lisp and Funct. Progr., Nice, June 1990) (to appear: Journal of Functional Programming).Google Scholar
  8. Longo G. [1988], From type-structures to type theories lecture notes, Spring semester 1987/8, Computer Science Dept., C.M.U.Google Scholar
  9. Longo G. [1990], The new role of mathematical logic: a tool for computer science, Information Sciences, special issue on “Past, Present and Future of C.S”., to appear.Google Scholar
  10. Martin C.F. [1972], Axiomatic bases for equational theories of natural numbers, (abstract) Notices Am. Math. Soc. 19,7, 778.Google Scholar
  11. Mints G.E. [1977], Closed categories and the theory of proofs, Translated from Zapiski Nauchnykh Seminarov Leniongradslogo Otdeleniya Matematicheskogo Instituta im VA. Steklova AN SSSR, 68, 83–114.MATHGoogle Scholar
  12. Mints G.E. [198?], A simple proof of the coherence theorem for cartesian closed categories, Bibliopolis (to appear in translation from russian).Google Scholar
  13. Rittri M. [1990a], Using types as search keys in function libraries, Journal of Functional Programming, Vol. 1 (1990).Google Scholar
  14. Rittri M. [1990b], Retrieving library identifiers by equational matching of types, X Int. Conf. on Automated Deduction, Kaiserslautern, Germany (Proceedings in LNCS, Spriger-Verlag).Google Scholar
  15. Soloviev S.V. [1983], The category of finte sets and Cartesian closed categories, J. Soviet Mathematics 22 3, 1387–1400.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag New York, Inc. 1992

Authors and Affiliations

  • Roberto Di Cosmo
    • 1
    • 2
  • Giuseppe Longo
    • 1
    • 2
  1. 1.Dipartimento Di InformaticaUniversitá Di PisaItaly
  2. 2.LIENS, Ecole Normale SupérieureParisFrance

Personalised recommendations