Reducing types in applicative languages with structured data

  • E. Astesiano
  • G. Costa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 107)


Finite Type Denotational Semantic Ground Type Vector Term Vector Context 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. AC1.
    E. Astesiano, G. Costa, Languages with reducing reflexive types, Proc. ICALP '80, Lecture Notes in C.S. 85, Springer, Berlin, 1980, 38–50.Google Scholar
  2. AC2.
    ==== The insensitivity theorem for non-reducing reflexive types, Rapporto Scientifico N.80, Sept. 1980, Istituto di Matematica dell'Università di Genova.Google Scholar
  3. ADJ.
    J.A. Goguen, J.W. Thatcher, E.G. Wagner, J.B. Wright, Initial algebra semantics and continuous algebras, JACM 24 (1977) 68–95.CrossRefGoogle Scholar
  4. B.
    G.Berry, Modèles complètement adéquats et stables des λ-calculs typés, Thèse d'Etat, Université Paris VII, 1979.Google Scholar
  5. H.
    R. Hindley, An abstract Church-Rosser theorem II: applications, J. Symb. Logic 39 (1974) 1–21.Google Scholar
  6. K.
    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.Google Scholar
  7. L.
    J.J.Lévy, Reductions correctes et optimales dans le λ-calcul, Thèse d'Etat, Université Paris VII, 1978.Google Scholar
  8. M.
    R. Milner, Fully abstract models of typed λ-calculi, TCS 4 (1977) 1–22.Google Scholar
  9. MMN.
    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.Google Scholar
  10. S.
    D. Scott, Data types as lattices, SIAM J. Comput. 5 (1976) 522–587.Google Scholar
  11. W.
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • E. Astesiano
    • 1
  • G. Costa
    • 1
  1. 1.Istituto di MatematicaUniversità di GenovaGenovaItaly

Personalised recommendations