A consistent extension of the lambda-calculus as a base for functional programming languages
DOI10.1016/S0019-9958(82)90458-2zbMATH Open0553.68025MaRDI QIDQ3216136FDOQ3216136
Authors: Klaus J. Berkling, Elfriede Fehr 
Publication date: 1982
Published in: Information and Control (Search for Journal in Brave)
Recommendations
denotational semanticsfunctional programming languageBerkling Reduction Languageefficient mechanical implementation of lambda calculuslambda-barvariable binding mechanisms
General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65)
Cited In (13)
- Enriching the lambda calculus with contexts: toward a theory of incremental program construction
- A lambda-calculus for dynamic binding
- A \(\rho\)-calculus of explicit constraint application
- Title not available (Why is that?)
- Title not available (Why is that?)
- Note on Algol and conservatively extending functional programming
- An extension of lambda-calculus for functional programming
- \(\pi\)-RED - a graph reducer for a full-fledged \(\lambda\)-calculus
- Symbolic manipulation in an extended λ-calculus
- CINNI -- a generic calculus of explicit substitutions and its application to \(\lambda\)-, \(\sigma\)- and \(\pi\)-calculi
- Functional back-ends within the lambda-sigma calculus
- Spinal atomic \(\lambda\)-calculus
- Scheme: A interpreter for extended lambda calculus
This page was built for publication: A consistent extension of the lambda-calculus as a base for functional programming languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3216136)
