The development of a partial evaluator for extended lambda calculus

DOI10.1007/BF02665950MaRDI QIDQ1264617zbMATH OpenFDO

Authors K. Appert

Publication date 19 November 1998

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

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

zbMATH Keywords

extended higher order lambda calculuspartial evaluation

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) General topics in the theory of software (68N01)

Review text

The goal of this paper is to describe the development of a partial evaluator for the language of extended higher order lambda calculus with the possibility to formalize and prove its main properties: correctness, completeness, termination, and optimality.

Recommendations

• A partial evaluator for the untyped lambda-calculus
• Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
• scientific article; zbMATH DE number 1499104
• scientific article; zbMATH DE number 177846

Cites work

• A partial evaluator for the untyped lambda-calculus
• Computations in APS
• Efficient self-interpretation in lambda calculus
• scientific article; zbMATH DE number 512905 (Why is no real title available?)
• scientific article; zbMATH DE number 194911 (Why is no real title available?)
• scientific article; zbMATH DE number 236855 (Why is no real title available?)
• Introduction to generalized type systems
• Programming in equational logic: Beyond strong sequentiality
• The lambda calculus, its syntax and semantics

Cited in

(2)

• A partial evaluator for a parallel lambda language
• A partial evaluator for the untyped lambda-calculus

Describes a project that uses

Uses Software

• APS-1
• APS

This page was built for publication: The development of a partial evaluator for extended lambda calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1264617)