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.
Supported in part by an NSF PYI Award, matching funds from Digital Equipment Corporation, the Powell Foundation, and Xerox Corporation; and the Wallace F. and Lucille M. Davis Faculty Scholarship.
Scedrov is an American Mathematical Society Centennial Research Fellow. He is partially supported by NSF Grant CCR-91-02753 and by ONR Grants N00014-88-K-0635 and N00014-92-J-1916.
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi, L. Cardelli, and P.-L. Curien. Formal parametric polymorphism. In Proc. 20-th ACM Symposium on Principles of Programming Languages, 1993.
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.
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.
V. Breazu-Tannen and T. Coquand. Extensional models for polymorphism. Theoretical Computer Science, 59:85–114, 1988.
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.
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.
T. Coquand, C.A. Gunter, and G. Winskel. Domain theoretic models of polymorphism. Information and Computation, 81:123–167, 1989.
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.
P.J. Freyd. Structural polymorphism. Theoretical Computer Science, to appear.
P.J. Freyd and A. Scedrov. Categories, Allegories. Mathematical Library, North-Holland, 1990.
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.
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.
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.
J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 1989.
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.
R. Hasegawa. Categorical data types in parametric polymorphims. Manuscript, 1990.
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.
A. Kock, G.E. Reyes. Doctrines in categorical logic. In J. Barwise, editor, Handbook of Mathematical Logic, pages 283–313. North-Holland, 1977.
Y. Lafont. Logiques, Categories & Machines. Thèse de Doctorat, Université Paris VII, 1988.
J. Lambek and P.J. Scott. Introduction to Higher-Order Categorical Logic. Cambridge studies in advanced mathematics 7, Cambridge University Press, 1986.
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.
S. Mac Lane. Categories for the Working Mathematician. Graduate Texts in Mathematics, Springer-Verlag, 1971.
H. Mairson. Outline of a proof theory of parametricity. In Proc. 5-th Intern. Symp. on Functional Programming and Computer Architecture, 1991.
R.E. Milne and C. Strachey. A theory of programming language semantics. Chapman and Hall, London, and Wiley, New York, 1976.
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.
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.
J.C. Mitchell. Type systems for programming languages. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 365–458. North-Holland, 1990.
J.C. Mitchell and A.R. Meyer. Second-order logical relations. In Logics of Programs, pages 225–236. Springer-Verlag LNCS 193, June 1985.
J.C. Mitchell and E. Moggi. Kripke-style models for typed lambda calculus. Annals Pure Appl. Logic, 51:99–124, 1991.
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.
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.
E. Moggi. A category-theoretic account of program modules. Math. Structures in Computer Science, 1(1):103–139, 1991.
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.
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.
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.
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.
J.C. Reynolds. Types, abstraction, and parametric polymorphism. In R. E. A. Mason, editor, Information Processing '83, pages 513–523. North-Holland, 1983.
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.
R.A.G. Seely. Categorical semantics for higher order polymorphic lambda calculus. Journal of Symbolic Logic, 52:969–989, 1987.
R. Statman. Logical relations and the typed lambda calculus. Information and Control, 65:85–97, 1985.
C. Strachey. Fundamental concepts in programming languages. Unpublished lecture notes, International Summer School in Computer Programming, Copenhagen, August, 1967.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mitchell, J.C., Scedrov, A. (1993). Notes on sconing and relators. In: Börger, E., Jäger, G., Kleine Büning, H., Martini, S., Richter, M.M. (eds) Computer Science Logic. CSL 1992. Lecture Notes in Computer Science, vol 702. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56992-8_21
Download citation
DOI: https://doi.org/10.1007/3-540-56992-8_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56992-3
Online ISBN: 978-3-540-47890-4
eBook Packages: Springer Book Archive