Skip to main content
SpringerLink
Log in

Definition of the semantics of programming language constructs in terms of λ-calculus. I

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, Automatic Computer Design [in Russian], Naukova Dumka, Kiev (1975).

    Google Scholar 

  2. S. A. Abramov and I. N. Antipov, Programming in Simplified ALGOL [in Russian], Nauka, Moscow (1978).

    Google Scholar 

  3. V. M. Savinkov and V. D. Tsal'p, ALGOL Programming, [in Russian], Vysshaya Shkola, Moscow (1975).

    Google Scholar 

  4. S. K. Abdali, “A lambda-calculus model of programming languages,” J. Comput. Lang.,1, 303–320 (1976).

    Google Scholar 

  5. J. W. Backus, “Can programming be liberated from the von Neumann style? A function style and its algebra programs,” Comm. ACM,21, No. 8, 613–642 (1978).

    Google Scholar 

  6. J. deBakker and W. P. deRoever, “A calculus for recursive program schemes,” in: Automata, Languages, and Programming, Amsterdam (1973), pp. 167–197.

  7. H. Barendregt, “A global representation of the recursive functions in λ-calculus,” Theor. Comput. Sci.,3, No. 2, 225–242 (1976).

    Google Scholar 

  8. J. R. Hindley, B. Lercher, and J. P. Seldin, Introduction to Combinatory Logic, Cambridge Univ. Press (1972).

  9. J. R. Hindley, “The principal type-scheme of an object in combinatory logic,” Trans. Am. Math Soc.,146, 29–60 (1969).

    Google Scholar 

  10. P. J. Landin, “The mechanical evaluation of expressions,” Comput. J., No. 6, 308–320 (1964).

    Google Scholar 

  11. Z. Manna, Mathematical Theory of Computation, McGraw-Hill, New York (1974).

    Google Scholar 

  12. B. J. Robinet, “About the logical foundation of data types,” in: New Directions in Algorithmic Languages, Paris (1976), pp. 63–79.

  13. D. Scott, “Data types as lattices,” SIAM J. Comput.,5, No. 3, 522–587 (1976).

    Google Scholar 

  14. S. Stenlund, Combinators, λ-Terms, and Proof-Theory, Reidel, Dordrecht (1972).

    Google Scholar 

  15. J. Vuillemin, Syntaxe, sémantique et axiomatique d'un langage de programmation simple, Birkhäuser Verlag, Basel (1975).

    Google Scholar 

Download references

Authors
  1. V. N. Domrachev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu. V. Kapitonova
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. L. G. Samoilenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 19–23, September–October, 1981.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Domrachev, V.N., Kapitonova, Y.V. & Samoilenko, L.G. Definition of the semantics of programming language constructs in terms of λ-calculus. I. Cybern Syst Anal 17, 590–595 (1981). https://doi.org/10.1007/BF01068776

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01068776

Keywords

Search

Navigation