Simply typed lambda calculus with first-class environments
Shin-ya Nishizaki
Source: Publ. Res. Inst. Math. Sci. Volume 30, Number 6 (1994), 1055-1121.
Primary Subjects: 68Q55
Secondary Subjects: 03B40, 68N15
Full-text: Open access
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.prims/1195164948
Mathematical Reviews number (MathSciNet):
MR1322946
Zentralblatt MATH identifier:
0837.68012
Digital Object Identifier: doi:10.2977/prims/1195164948
References
[1] MIT Scheme Reference Manual, MIT.
[2] Abelson, H. and Sussman, G. J., Structure and Interpretation of Computer Programs, The MIT Press, 1985.
Zentralblatt MATH:
1092.68550
[3] Curien, P-L., An abstract framework for environment machines, Theoretical Computer Science, 82 (1991), 389-402.
Mathematical Reviews (MathSciNet):
MR1112776
Zentralblatt MATH:
0727.68033
[4] Curien, P-L., Categorical combinators, Information and Control, 69 (1986), 188-254.
Mathematical Reviews (MathSciNet):
MR848440
Zentralblatt MATH:
0607.03005
[5] Curien, P-L., Categorical combinators, sequential algorithms, and functional programming, Birkhauser, second edition, 1993.
Mathematical Reviews (MathSciNet):
MR1231971
Zentralblatt MATH:
0814.68085
[6] Curien, P-L., Hardin, T. and Levy, J-J., Confluence Properties of Weak and Strong Calculi of Explicit Substitutions, Rapports de Recherche 1617, INRIA, February 1992.
Zentralblatt MATH:
0885.03014
[7] Girard, J-Y., Taylor, P. and Lafont, Y., Proofs and Types, Cambridge Tracts in Compu. Sci., 1, Cambridge University Press, 1989.
Mathematical Reviews (MathSciNet):
MR1003608
Zentralblatt MATH:
0671.68002
[8] Griffin, T. G., A formulae-as-types notion of control, Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, 1990.
[9] Gunter, C. A., Semantics of programming languages, structures and techniques, The MIT Press, 1992.
Mathematical Reviews (MathSciNet):
MR1194880
Zentralblatt MATH:
0823.68059
[10] Jategaonkar, L. A. and Mitchell, J. C., ML with extended pattern matching and subtypes, Proceedings of the 1988 Conference on LISP and FunctionalProgramming, (1988), 198-211.
[11] Jategaonkar, L. A. and Mitchell, Type inference with extended pattern matching and subtypes, Fundamenta Informaticae, 19 (1993), 127-166.
Mathematical Reviews (MathSciNet):
MR1270349
Zentralblatt MATH:
0801.68017
[12] Abadi, M., Cardelli, L., Curien, P-L. and Levy, J-J., Explicit substitutions, Proceedings of the Seventeenth Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, San Francisco, California, January 1990.
Mathematical Reviews (MathSciNet):
MR1140338
Zentralblatt MATH:
0941.68542
[13] Ohori, A., A compilation method for ML-style polymorphic record calculi, Conference Record of the Nineteenth Annual ACM Symposium on Principles of Programming Languages, (1992), 154-165.
[14] Remy, D., Typechecking records and variants in a natural extention of ML, Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, (1989), 60-67.
[15] Wand, M., Complete type inference for simple objects, Proceedings of the Second Annual IEEE Symposium on Logic in Computer Science, (1987), 37-44.
Publications of the Research Institute for Mathematical Sciences
