Advertisement

Discriminability of infinite sets of terms in the D-models of the λ-calculus

  • S. Ronchi della Rocca
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 112)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    H. Barendregt, The λ-calculus, its syntax and semantic, North-Holland, Amsterdam, to appear.Google Scholar
  2. [2]
    C. Böhm, Alcune proprietà delle forme β-η-normali del λ-k-calcolo, I.A.C., 696, Roma, (1968).Google Scholar
  3. [3]
    C. Böhm, The CUCH as a Formal and Description Language, in: Formal Language Description Languages, T.B. Steel, ed. North-Holland, Amsterdam (1966), 179–197.Google Scholar
  4. [4]
    C. Böhm, Strutture Informative e loro trasformazioni, Atti del III Seminario sul trattamento automatico delle Informazioni, Ist. Matematico “U. Dini”, Firenze, (1972).Google Scholar
  5. [5]
    C. Böhm, M. Dezani-Ciancaglini, Combinatori al Problems, Combinator equations and Normal Forms, Lecture Notes in Computer Science, 14, (1974), 170–184.Google Scholar
  6. [6]
    C. Böhm, M. Dezani-Ciancaglini, P. Peretti, S. Ronchi Della Rocca, A discrimination Algorithm inside λ-η-calculus, Theoretical Computer Science, 8, (1979), 271–291.Google Scholar
  7. [7]
    A. Church, The calculi of λ-conversion, Annals of Mathematics, 6, Princenton, New Jersey, (1941).Google Scholar
  8. [8]
    M. Coppo, M. Dezani-Ciancaglini, S. Ronchi Della Rocca, (Semi)-separability of finite sets of terms in Scott's D∞-models of the λ-calculus, Lecture notes in Computer Science, 62, (1978), 142–164.Google Scholar
  9. [9]
    H.B. Curry, R. Feys, W. Craig, Combinatory logic, vol. I, North Holland, Amsterdam, (1968).Google Scholar
  10. [10]
    H.B. Curry, J.R. Hindley, S.P. Seldin, Combinatory logic, vol. II, North Holland, Amsterdam, (1972).Google Scholar
  11. [11]
    M. Dezani, Characterization of normal forms possessing inverse in the λ-β-η-calculus, Theoretical Computer Science, 2, (1976), 323–337.Google Scholar
  12. [12]
    R. Hindley, The discrimination Theorem holds for combinatory weak reduction (Note), Theoretical Computer Science, 8, 3, (1979), 393–394.Google Scholar
  13. [13]
    C.P. Wadsworth, The Relation between Computational and Denotational Properties for Scott's D∞-models of the Lambda-calculus, SIAM Journal Comput., 5,3, (1976), 488–521.Google Scholar
  14. [14]
    C.P. Wadsworth, Some unusual λ-calculus numeral Systems, to H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, ed. J.P. Seldin and J.R. Hindley, (1980).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • S. Ronchi della Rocca
    • 1
  1. 1.Istituto di Scienza dell'Informazione - C.M. D'Azeglio42 - Torino

Personalised recommendations