Abstract
The paper is devoted to procedural semantics that use interpretation algorithms on which interpreters of untyped functional programming systems are based (or can be based). The aim of this study is to describe such algorithms and compare procedural semantics based on them both with each other and with the basic semantics defined by means of the fixed-point combinator Y.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Barendregt, H.P., The Lambda Calculus, Its Syntax and Semantics, North-Holland, 1981. Translated under the title Lambda-ischislenie, ego sintaksis i semantika, Moscow: Mir, 1985.
Stoy, J.E., Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, MIT, 1977.
Field, A.J. and Harrison, P.G., Functional Programming, Addison-Wesley, 1988. Translated under the title Funktsional'noe programmirovanie, Moscow: Mir, 1993.
Gunter, C.A., Semantics of Programming Languages, MIT, 1992.
Nigiyan, S.A. and Avetisyan, S.A., Solutions of Recursive Equations with a Separating Variable in the Untyped Lambda Calculus, Dokl. Akad. Nauk Armenii, 2001, vol. 101, no. 1, pp. 12-19.
Nigiyan, S.A., Functional Programming Languages, Programmirovanie, 1991, no. 5, pp. 77-86.
Nigiyan, S.A., Interpretation of Functional Programming Languages, Programmirovanie, 1993, no. 2, pp. 58-68.
Nigiyan, S.A. and Budagyan, L.E., On Execution of Functional Programs, Proc. of Int. Conf. on Computer Science and Information Technologies (CSIT-99), Yerevan, 1999, pp. 33-35.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Nigiyan, S.A., Avetisyan, S.A. Semantics of Untyped Functional Programs. Programming and Computer Software 28, 119–126 (2002). https://doi.org/10.1023/A:1015604813156
Issue Date:
DOI: https://doi.org/10.1023/A:1015604813156