A Simple Lambda-Calculus Model of Programming Languages - Softcover

Inhaltsangabe

A simple lambda-calculus model for programming languages presents a rigorous approach to representing programs as lambda-expressions. It shows how external input-output behavior can be captured functionally, without importing machine-level or imperative concepts.

The work argues for a pure lambda-calculus foundation, where program constructs are translated into lambda expressions and all semantics are handled by lambda-calculus rules. It also demonstrates how assignments can be modeled with substitution, avoiding explicit memory or fetch-store notions. The model is shown to apply to ALGOL 60 and a range of advanced features, including parallel statements, labels, and coroutines, through exact LC representations. Examples and informal explanations aim to illuminate how this representation can express and analyze program behavior and execution traces.

• Representations of common language constructs as lambda-expressions.
• Pure functional semantics that preserve properties like consistency and confluence.
• Mechanisms for handling variables, scopes, arrays, and control flow within the lambda framework.
• Illustrative examples showing how programs map to LC forms and how traces of execution can emerge from reduction.

Ideal for readers interested in formal models of programming languages and the theoretical foundations of program representation.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.