|
 REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
Barendregt 84
|
Barendregt, H.P., The Lambda Calculus: Its Syntax and Semantics. North Holland, 1984 (revised edition).
|
| |
Beeson 82
|
Beeson, M., Recursive models for constructive set theories. Ann. Mathematical Log/c 23,1982, pages 127-178.
|
| |
Bruce and Meyer 84
|
|
| |
Bruce, Meyer and Mitchell 86
|
Bruce, K.B., Meyer, A.R. and Mitchell, J.C., The semantics of second-order lambda calculus. Information and Control, 1986. (to appear)
|
| |
Coppo 86
|
Coppo, M. and Zacchi, M., Type inference and logical relations. In Proc. IEEE Syrup. on Logic in Computer Sc/ence, June 1986. (to appear)
|
 |
Fortune, et. al. 83
|
|
| |
Girard 72
|
Girard, J.Y., Interpretation fonctionelle et elimination des coupures de I'arithmetique d'ordre superieur. Ph.D. thesis, (These D'Etat) Universite Paris VII 1972.
|
| |
Hindley and Longo 80
|
Hindley, R. and Longo, G., Lambda calculus models and extensionality. Z. Math. Logik Grundlag Math 26,1980. pages 289-310.
|
| |
Hindley 83a
|
Hindley, R., The Completeness Theorem for Typing Lambda Terms. Theor. Comp. Sc~'. 22,19~. pages 1-17.
|
| |
Kreisel 59
|
Kreisel, G., Interpretation of analysis by means of constructive functionals of finite types. In A. Heyting (ed.), Constructivity in Mathenuttics, pages 101-128. North-Holland, 1959.
|
| |
Leivant 83a
|
|
| |
Leivant 84
|
Leivant, D., Typing and convergence in the lambda calculus. Unpublished manuscript, 1984.
|
| |
MacQueen, Plotkin and Sethi 84
|
David MacQueen , Gordon Plotkin , Ravi Sethi, An ideal model for recursive polymorphic types, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.165-174, January 15-18, 1984, Salt Lake City, Utah, United States
[doi> 10.1145/800017.800528]
|
| |
MacQueen and Sethi 82
|
|
| |
McCracken 84
|
|
| |
Meyer 82
|
Meyer, A.R., What Is A Model of the Lambda Calculus ?. Information and Control 52, 11982, pages 87-122.
|
| |
Mitchell 84b
|
|
| |
Mitchell 84c
|
Mitchell, J.C., Semantic models for second-order lambda calculus. In Proc. 25-th IEEE Syrup. on Foundations of Computer Science, 1984, pages 289-299.
|
| |
Myhill and Shepherdson 55
|
Myhill, J.R. and Shepherdson, J.C., Effective operations on partial recursive func~ons. Zetischrift fur mathematische Logik und Grundlagen der M_at~tik 1,1955.
|
| |
Plotkin 85
|
Plofidn, G., Denotafional semantics with partial functions, lecture notes, C.S.L.I. Summer School, Stanford, 1985.
|
| |
Reynolds 74
|
|
| |
Rosolini 86
|
Rosolini, G., Continuity and Efffectiveness in Topoi. Ph.D. thesis, Merton College, Oxford 1986.
|
| |
Scott 76
|
Scott, D., Data Types as Lattices. Siam J. Computing 5, 31976, pages 522-587.
|
| |
Statman 82
|
Statman, R., Logical relations and the typed lambda calculus. Information and Control 65,1985. pages 85-97.
|
| |
Troelstra 73
|
Troelstra, A.S., Mathematical Investigation of lntuitionistic Arithmetic and Analysis. Lecture Notes in Mathematics, Vol. 344 Springer-Verlag, 1973.
|
CITED BY 5
|
|
Kim Bruce , John C. Mitchell, PER models of subtyping, recursive types and higher-order polymorphism, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.316-327, January 19-22, 1992, Albuquerque, New Mexico, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf