Implementing circularity using partial evaluation

DOI10.1007/3-540-44978-7_6MaRDI QIDQ4529774zbMATH OpenFDO

Authors Julia L. Lawall

Publication date 6 May 2002

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/2053/20530084

Mathematics Subject Classification ID

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

Recommendations

• Computing circular separability
• Programming techniques for partial evaluation
• From partial evaluation to mixed computation
• Using circular programs to eliminate multiple traversals of data
• Dynamic partial evaluation
• Implementation with partial verification
• Partial evaluation of computation process, revisited.
• Loop checking in partial deduction
• scientific article; zbMATH DE number 2090857

Cited in

(1)

• Shortcut fusion rules for the derivation of circular and higher-order programs

This page was built for publication: Implementing circularity using partial evaluation

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