Continuation-based partial evaluation without continuations

DOI10.1007/3-540-44898-5_21MaRDI QIDQ4813409zbMATH OpenFDO

Authors Peter J. Thiemann

Publication date 13 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2694/26940366.htm

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• A computational formalization for partial evaluation
• Partial evaluation of multi-paradigm declarative languages: Foundations, control, algorithms and efficiency
• Projection Factorisations in Partial Evaluation
• A hybrid approach to online and offline partial evaluation
• Partial evaluation of concurrent programs

Cited in

(3)

• A computational formalization for partial evaluation
• Implementing circularity using partial evaluation
• Obtaining lazy evaluation with continuations in SCHEME

This page was built for publication: Continuation-based partial evaluation without continuations

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