Preview
Unable to display preview. Download preview PDF.
References
The Programming Language ADA. Reference Manual LNCS 106, Springer-Verlag, 1981
Andrzej Blikle A Guided Tour of Naive Denotational Semantics and the Mathematics of MetaSoft internal report of the Dept. of Comp. Sci., Techn. Univ. of Denmark, Lyngby, 1986
Andrzej Blikle MetaSoft Primer: Towards a Metalanguage for Applied Denotational Semantics LNCS 288, Springer-Verlag, 1987
Andrzej Blikle, Andrzej Tarlecki Naive Denotational Semantics in “Information Processing 83” Proc. of IFIP-Congress, North-Holland, pp. 345–355, 1983
Andrzej Borzyszkowski, Ryszard Kubiak, Jacek Leszczyłowski, Stefan Sokolowski Set-Theoretic Type Theory in preparation
Kim B. Bruce, Albert R. Meyer The Semantics of Second-Order Polymorphic Lambda Calculus in “Semantics of Data Types” Proc. of International Symposium, Sophia-Antipolis, LNCS 173, pp. 131–144, Springer-Verlag, 1984
P. M. Cohn Universal Algebra D. Reidel Publishing Co., 1981
S. Fortune, D. Leivant, M. O'Donnell The Expressiveness of Simple and Second-Order Type Structures JACM (30), pp. 151–185, 1983
J-Y. Girard. Interprétation fonctionelle et élimination des coupures dans l'aritmétique d'ordre supérieure Thèse d'Etat, Université Paris VII, 1972.
Michael J. Gordon, Robin J. Milner, Christopher P. Wadsworth Edinburgh LCF LNCS 78, Springer-Verlag, 1979
Robert Harper, David B. Macqueen, Robin Milner Standard ML Edinburgh University Internal Report ECS-LFCS-86-2, March 1986
J. Roger Hindley, Jonathan P. Seldin Introduction to Combinators and λ-Calculus Cambridge University Press, 1986
Robin Milner A Theory of Polymorphism in Programming Journal of Computer and System Sciences, Vol.17, pp. 348–375, 1978
Andrew M. Pitts Polymorphism is Set Theoretic, Constructively in “Category Theory in Computer Science”, LNCS 283, pp. 12–39, Springer-Verlag, 1987
J. C. Reynolds Towards a theory of type structure in B. Robinet, ed. Colloquium sur la programmation, pp. 408–425, LNCS 19, Springer-Verlag, 1974.
John C. Reynolds Polymorphism Is Not Set-Theoretic in “Semantics of Data Types” Proc. of International Symposium, Sophia-Antipolis, LNCS 173, pp. 145–156, Springer-Verlag, 1984
Dana Scott Data types as lattices Programming Research Group Technical Monographs, PRG-5, Oxford University, 1974
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borzyszkowski, A., Kubiak, R., Sokołowski, S. (1988). A set-theoretic model for a typed polymorphic lambda calculus a contribution to MetaSoft. In: Bloomfield, R.E., Marshall, L.S., Jones, R.B. (eds) VDM '88 VDM — The Way Ahead. VDM 1988. Lecture Notes in Computer Science, vol 328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50214-9_21
Download citation
DOI: https://doi.org/10.1007/3-540-50214-9_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50214-2
Online ISBN: 978-3-540-45955-2
eBook Packages: Springer Book Archive