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

DOI10.1007/BF01068776zbMath0491.68034OpenAlexW2044603540MaRDI QIDQ3953161

V. N. Domrachev, L. G. Samojlenko, Yu. V. Kapitonova

Publication date: 1981

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01068776

zbMATH Keywords

lambda calculusarray manipulationoperational semantics of an Algol-like language

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Combinatory logic and lambda calculus (03B40)

Related Items (1)

One method of defining the semantics of programming language constructs in terms of lambda calculus. II

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A global representation of the recursive functions in the \(\lambda\)- calculus
• Combinators, \(\lambda\)-terms and proof theory
• Data Types as Lattices
• A lambda-calculus model of programming languages—II. Jumps and procedures
• Can programming be liberated from the von Neumann style?
• The Principal Type-Scheme of an Object in Combinatory Logic
• The Mechanical Evaluation of Expressions

This page was built for publication: Definition of the semantics of programming language constructs in terms of ?-calculus. I