A consistent extension of the lambda-calculus as a base for functional programming languages

DOI10.1016/S0019-9958(82)90458-2zbMath0553.68025MaRDI QIDQ3216136

Klaus J. Berkling, Elfriede Fehr

Publication date: 1982

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

denotational semanticsfunctional programming languageBerkling Reduction Languageefficient mechanical implementation of lambda calculuslambda-barvariable binding mechanisms

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)

Related Items

Unnamed Item ⋮ A \(\rho\)-calculus of explicit constraint application ⋮ Spinal atomic \(\lambda\)-calculus ⋮ \(\pi\)-RED - a graph reducer for a full-fledged \(\lambda\)-calculus