A partial evaluator for the untyped lambda-calculus
From MaRDI portal
Publication:4939696
DOI10.1017/S0956796800000058zbMath1155.68350WikidataQ117560165 ScholiaQ117560165MaRDI QIDQ4939696
Carsten K. Gomard, Neil D. Jones
Publication date: 9 February 2000
Published in: Journal of Functional Programming (Search for Journal in Brave)
fixed point operatoruntyped lambda-calculusself-applicable partial evaluatorresidual lambda-expressionstand-alone compilers
Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)
Related Items
Shifting the stage, Synthesizable high level hardware descriptions, Static consistency checking for Verilog wire interconnects, \textsc{Synbit}: synthesizing bidirectional programs using unidirectional sketches, Automatically Splitting a Two-Stage Lambda Calculus, The development of a partial evaluator for extended lambda calculus, Enhanced type inference for binding-time analysis, Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages, Two-level languages for program optimization, MetaML and multi-stage programming with explicit annotations, Lambda-dropping: Transforming recursive equations into programs with block structure, Efficient self-interpretation in lambda calculus
Cites Work
- Mixed computation of Prolog programs
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- A partial evaluator, and its use as a programming tool
- TEMPO: A unified treatment of binding time and parameter passing concepts in programming languages
- A theory of type polymorphism in programming
- Detecting global variables in denotational specifications
- Initial Algebra Semantics and Continuous Algebras
