Semantics of Untyped Functional Programs

Authors:
S. A. Nigiyan;S. A. Avetisyan
Affiliations:
Yerevan State University, ul. A. Manukyana 1, Yerevan, 375015 Armenia svt@yercsi.am;Yerevan State University, ul. A. Manukyana 1, Yerevan, 375015 Armenia svt@yercsi.am
Venue:
Programming and Computing Software
Year:
2002

Citing 2
Cited 2

Semantics of programming languages: structures and techniques

Semantics of programming languages: structures and techniques
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory

Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory

On basic semantics of untyped functional programs

Programming and Computing Software
LP structures on type lattices and some refactoring problems

Programming and Computing Software

Quantified Score

Hi-index	0.00

Visualization

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.