On-line and off-line partial evaluation: semantic specifications and correctness proofs

DOI10.1017/S0956796800001453MaRDI QIDQ4880487zbMATH OpenFDO

Authors Charles Consel, Siau-Cheng Khoo

Publication date 12 September 1996

Published in Journal of Functional Programming (Search for Journal in Brave)

zbMATH Keywords

logical relationssemantic specificationscore semantics

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)

Recommendations

• Correctness of on-line partial evaluation for a Pascal-like language
• A hybrid approach to online and offline partial evaluation
• scientific article; zbMATH DE number 1487847
• scientific article; zbMATH DE number 1231585

Cites work

• Abstract Interpretation, Logical Relations, and Kan Extensions
• Automatic autoprojection of higher order recursive equations
• Automatic binding time analysis for a typed \(\lambda\)-calculus
• Two-Level Functional Languages
• Two-level semantics and abstract interpretation

Cited in

(2)

• Proving the correctness of recursion-based automatic program transformations
• A hybrid approach to online and offline partial evaluation

This page was built for publication: On-line and off-line partial evaluation: semantic specifications and correctness proofs

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