An investigation of Jones optimality and BTI-universal specializers

DOI10.1007/s10990-008-9033-5zbMath1188.68112OpenAlexW2004061793WikidataQ62038250 ScholiaQ62038250MaRDI QIDQ1029807

Robert Glück

Publication date: 13 July 2009

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10990-008-9033-5

zbMATH Keywords

partial evaluationbinding-time improvementsFutamura projectionsinterpretive approachJones optimalityself-interpreterspecializer generation

Mathematics Subject Classification ID

Theory of software (68N99)

Related Items (1)

Self-generating program specializers

Uses Software

• WSDFU

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A regeneration scheme for generating extensions
• Partial evaluation and \(\omega\)-completeness of algebraic specifications
• On the partial computation principle
• Transformation by interpreter specialisation
• Efficient and flexible access control via Jones-optimal logic program specialisation
• Imperative-program transformation by instrumented-interpreter specialization
• A positive supercompiler
• Efficient self-interpretation in lambda calculus
• On Jones-Optimal Specializers: A Case Study Using Unmix

This page was built for publication: An investigation of Jones optimality and BTI-universal specializers