Notes on sconing and relators

  • John C. Mitchell
  • Andre Scedrov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 702)

Abstract

This paper describes a semantics of typed lambda calculi based on relations. The main mathematical tool is a category-theoretic method of sconing, also called glueing or Freyd covers. Its correspondence to logical relations is also examined.

Keywords

Toll Cali 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ACC93]
    M. Abadi, L. Cardelli, and P.-L. Curien. Formal parametric polymorphism. In Proc. 20-th ACM Symposium on Principles of Programming Languages, 1993.Google Scholar
  2. [AbJ91]
    S. Abramsky and T.P. Jensen. A relational approach to strictness analysis for higher-order polymorphic functions. In Proc. 18-th ACM Symposium on Principles of Programming Languages, 1991.Google Scholar
  3. [BFS90]
    E.S. Bainbridge, P.J. Freyd, A. Scedrov, and P.J. Scott. Functorial Polymorphism. Theoretical Computer Science, 70:35–64, 1990. Corrigendum ibid., 71:431, 1990.Google Scholar
  4. [BTC88]
    V. Breazu-Tannen and T. Coquand. Extensional models for polymorphism. Theoretical Computer Science, 59:85–114, 1988.Google Scholar
  5. [BMM90]
    K. B. Bruce, A. R. Meyer, and J. C. Mitchell. The semantics of second-order lambda calculus. Information and Computation, 85(1):76–134, 1990. Reprinted in Logical Foundations of Functional Programming, ed. G. Huet, Addison-Wesley (1990) 213–273.Google Scholar
  6. [CMS91]
    L. Cardelli, J.C. Mitchell, S. Martini, and A. Scedrov. An extension of system F with Subtyping. To appear in Information and Computation. Extended abstract in T.Ito and A.R. Meyer (eds.), Theoretical Aspects of Computer Software, pages 750–770. Springer-Verlag LNCS 526, 1991.Google Scholar
  7. [CGW89]
    T. Coquand, C.A. Gunter, and G. Winskel. Domain theoretic models of polymorphism. Information and Computation, 81:123–167, 1989.Google Scholar
  8. [CP92]
    R.L. Crole and A.M. Pitts. New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic. Information and Computation, 98:171–210, 1992.Google Scholar
  9. [Fre93]
    P.J. Freyd. Structural polymorphism. Theoretical Computer Science, to appear.Google Scholar
  10. [FrS90]
    P.J. Freyd and A. Scedrov. Categories, Allegories. Mathematical Library, North-Holland, 1990.Google Scholar
  11. [FRR92]
    P.J. Freyd, E.P. Robinson, and G. Rosolini. Functorial parametricity. In Proc. 7-th Annual IEEE Symposium on Logic in Computer Science, pages 444–452, 1992.Google Scholar
  12. [FRS92]
    P.J. Freyd, E.P. Robinson, and G. Rosolini. Dinaturality for free. In M.P. Fourman, P.T. Johnstone, and A.M. Pitts, eds., Applications of Categories in Computer Science, pages 107–118. London Math. Soc. Lecture Note Series, vol. 177, Cambridge Univ. Press, 1992.Google Scholar
  13. [Gir86]
    J.-Y. Girard. The system F of variable types, fifteen years later. Theoretical Computer Science, 45:159–192, 1986. Reprinted in Logical Foundations of Functional Programming, ed. G. Huet, Addison-Wesley (1990) 87–126.Google Scholar
  14. [GLT89]
    J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 1989.Google Scholar
  15. [GSS91]
    J.-Y. Girard, A. Scedrov, and P.J. Scott. Normal forms and cut-free proofs as natural transformations. In: Y.N. Moschovakis, editor, Logic from Computer Science, Proc. M.S.R.I. Workshop, Berkeley, 1989. M.S.R.I. Series, Springer-Verlag, 1991.Google Scholar
  16. [Has90]
    R. Hasegawa. Categorical data types in parametric polymorphims. Manuscript, 1990.Google Scholar
  17. [Has91]
    R. Hasegawa. Parametricity of extensionally collapsed term models of polymorphism and their categorical properties. In T.Ito and A.R. Meyer (eds.), Theoretical Aspects of Computer Software, pages 495–512. Springer-Verlag LNCS 526, 1991.Google Scholar
  18. [KR77]
    A. Kock, G.E. Reyes. Doctrines in categorical logic. In J. Barwise, editor, Handbook of Mathematical Logic, pages 283–313. North-Holland, 1977.Google Scholar
  19. [Laf88]
    Y. Lafont. Logiques, Categories & Machines. Thèse de Doctorat, Université Paris VII, 1988.Google Scholar
  20. [LS86]
    J. Lambek and P.J. Scott. Introduction to Higher-Order Categorical Logic. Cambridge studies in advanced mathematics 7, Cambridge University Press, 1986.Google Scholar
  21. [MaR92]
    Q. Ma and J.C. Reynolds. Types, abstraction, and parametric polymorphism, Part 2. In S. Brookes et al., editors, Mathematical Foundations of Programming Semantics, Proceedings 1991, pages 1–40. Springer-Verlag LNCS 598, 1992.Google Scholar
  22. [McL71]
    S. Mac Lane. Categories for the Working Mathematician. Graduate Texts in Mathematics, Springer-Verlag, 1971.Google Scholar
  23. [Mai91]
    H. Mairson. Outline of a proof theory of parametricity. In Proc. 5-th Intern. Symp. on Functional Programming and Computer Architecture, 1991.Google Scholar
  24. [MS76]
    R.E. Milne and C. Strachey. A theory of programming language semantics. Chapman and Hall, London, and Wiley, New York, 1976.Google Scholar
  25. [Mit86]
    J.C. Mitchell. A type-inference approach to reduction properties and semantics of polymorphic expressions. In ACM Conference on LISP and Functional Programming, pages 308–319, August 1986. Revised version in Logical Foundations of Functional Programming, ed. G. Huet, Addison-Wesley (1990) 195–212.Google Scholar
  26. [Mit88]
    J.C. Mitchell. Polymorphic type inference and containment. Information and Computation, 76(2/3):211–249, 1988. Reprinted in Logical Foundations of Functional Programming, ed. G. Huet, Addison-Wesley (1990) 153–194.Google Scholar
  27. [Mit90]
    J.C. Mitchell. Type systems for programming languages. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 365–458. North-Holland, 1990.Google Scholar
  28. [MM85]
    J.C. Mitchell and A.R. Meyer. Second-order logical relations. In Logics of Programs, pages 225–236. Springer-Verlag LNCS 193, June 1985.Google Scholar
  29. [MM91]
    J.C. Mitchell and E. Moggi. Kripke-style models for typed lambda calculus. Annals Pure Appl. Logic, 51:99–124, 1991.Google Scholar
  30. [MS89]
    J.C. Mitchell and P.J. Scott. Typed lambda calculus and cartesian closed categories. In J. W. Gray and A. Scedrov, editors, Categories in Computer Science and Logic, Contemporary Math., vol. 92, pages 301–316. Amer. Math. Society, 1989.Google Scholar
  31. [Mgg89]
    E. Moggi. Computational lambda calculus and monads. In Proc. 4 th IEEE Symposium on Logic in Computer Science, pages 14–23, IEEE Computer Society Press, 1989.Google Scholar
  32. [Mog91]
    E. Moggi. A category-theoretic account of program modules. Math. Structures in Computer Science, 1(1):103–139, 1991.Google Scholar
  33. [OHT93]
    P.W. O'Hearn and R.D. Tennent. Relational parametricity and local variables. In Proc. 20-th ACM Symposium on Principles of Programming Languages, 1993.Google Scholar
  34. [Pit87]
    A.M. Pitts. Polymorphism is set-theoretic, constructively. In Category Theory and Computer Science, Proceedings Edinburgh, 1987, pages 12–39. Springer-Verlag LNCS volume 283, 1987.Google Scholar
  35. [Plo80]
    G.D. Plotkin. Lambda definability in the full type hierarchy. In To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 363–373. Academic Press. 1980.Google Scholar
  36. [Rey74]
    J.C. Reynolds. On the relation between direct and continuation semantics. In Second Colloq. Automata, Languages and Programming, pages 141–156. Springer-Verlag LNCS, 1974.Google Scholar
  37. [Rey83]
    J.C. Reynolds. Types, abstraction, and parametric polymorphism. In R. E. A. Mason, editor, Information Processing '83, pages 513–523. North-Holland, 1983.Google Scholar
  38. [ScS82]
    A. Scedrov and P.J. Scott. A note on the Friedman slash and Freyd covers. In A.S. Troelstra and D. van Dalen, editors, The L. E. J. Brouwer Symposium, pages 443–452. North-Holland, 1982.Google Scholar
  39. [See87]
    R.A.G. Seely. Categorical semantics for higher order polymorphic lambda calculus. Journal of Symbolic Logic, 52:969–989, 1987.Google Scholar
  40. [Sta85]
    R. Statman. Logical relations and the typed lambda calculus. Information and Control, 65:85–97, 1985.Google Scholar
  41. [Str67]
    C. Strachey. Fundamental concepts in programming languages. Unpublished lecture notes, International Summer School in Computer Programming, Copenhagen, August, 1967.Google Scholar
  42. [Wad89]
    P. Wadler. Theorems for free! In 4th Internat. Symp. on Functional Programming Languages and Computer Architecture, London, pages 347–359, Assoc. for Comp. Machinery, 1989.Google Scholar

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • John C. Mitchell
    • 1
    • 2
  • Andre Scedrov
    • 1
    • 2
  1. 1.Department of Computer ScienceStanford UniversityStanford
  2. 2.Department of MathematicsUniversity of PennsylvaniaPhiladelphia

Personalised recommendations