Preview
Unable to display preview. Download preview PDF.
References
E. Astesiano, G. Costa, Languages with reducing reflexive types, Proc. ICALP '80, Lecture Notes in C.S. 85, Springer, Berlin, 1980, 38–50.
==== The insensitivity theorem for non-reducing reflexive types, Rapporto Scientifico N.80, Sept. 1980, Istituto di Matematica dell'Università di Genova.
J.A. Goguen, J.W. Thatcher, E.G. Wagner, J.B. Wright, Initial algebra semantics and continuous algebras, JACM 24 (1977) 68–95.
G.Berry, Modèles complètement adéquats et stables des λ-calculs typés, Thèse d'Etat, Université Paris VII, 1979.
R. Hindley, An abstract Church-Rosser theorem II: applications, J. Symb. Logic 39 (1974) 1–21.
J.W.Klop, A counterexample to the Church-Rosser property for λ-calculus with sur jective pairing, Preprint N.102, Jan. 1979, Dept. Math. Univ. of Utrecht.
J.J.Lévy, Reductions correctes et optimales dans le λ-calcul, Thèse d'Etat, Université Paris VII, 1978.
R. Milner, Fully abstract models of typed λ-calculi, TCS 4 (1977) 1–22.
R.Milner, L.Morris, M.Newey, A logic for computable functions with reflexive and polymorphic types, in G.Huet, G.Kahn eds., Proving and improving programs (Coll. IRIA, Arc et Senans, 1975) IRIA, 1975.
D. Scott, Data types as lattices, SIAM J. Comput. 5 (1976) 522–587.
C.P. Wadsworth, The relation between computational and denotational properties of Scott's D∞ model of the λ-calculus, SIAM J. Comput. 5 (1976) 488–521.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Astesiano, E., Costa, G. (1981). Reducing types in applicative languages with structured data. In: Díaz, J., Ramos, I. (eds) Formalization of Programming Concepts. ICFPC 1981. Lecture Notes in Computer Science, vol 107. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10699-5_98
Download citation
DOI: https://doi.org/10.1007/3-540-10699-5_98
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10699-9
Online ISBN: 978-3-540-38654-4
eBook Packages: Springer Book Archive