Abstract
We present the latest version of the LOGEN partial evaluation system for logic programs. In particular we present new binding-types, and show how they can be used to effectively specialise a wide variety of interpreters. We show how to achieve Jones-optimality in a systematic way for several interpreters. Finally, we present and specialise a nontrivial interpreter for a small functional programming language. Experimental results are also presented, highlighting that the LOGEN system can be a good basis for generating compilers for high-level languages. © Springer-Verlag 2004.
Cite
CITATION STYLE
Leuschel, M., Craig, S. J., Bruynooghe, M., & Vanhoof, W. (2004). Specialising interpreters using offline partial deduction. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3049, 340–375. https://doi.org/10.1007/978-3-540-25951-0_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
