The University of Southampton
University of Southampton Institutional Repository

Specializing interpreters using offline partial deduction

Specializing interpreters using offline partial deduction
Specializing interpreters using offline partial deduction
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 non-trivial 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.
Partial Evaluation, Logic Programming, Partial Deduction, Interpreters, Offline Specialization, Self-application
Leuschel, Michael
c2c18572-66cf-4f84-ade4-218ce3afe78b
Craig, Stephen J.
57faf371-ad85-41b5-96e4-4c52eddecb23
Bruynooghe, Maurice
d330a4d8-e9d8-4994-8672-0a89fe4df305
Vanhoof, Wim
b5c3bd66-143d-4301-95fa-afdc35e03539
Leuschel, Michael
c2c18572-66cf-4f84-ade4-218ce3afe78b
Craig, Stephen J.
57faf371-ad85-41b5-96e4-4c52eddecb23
Bruynooghe, Maurice
d330a4d8-e9d8-4994-8672-0a89fe4df305
Vanhoof, Wim
b5c3bd66-143d-4301-95fa-afdc35e03539

Leuschel, Michael, Craig, Stephen J., Bruynooghe, Maurice and Vanhoof, Wim (2003) Specializing interpreters using offline partial deduction 36pp.

Record type: Monograph (Project Report)

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 non-trivial 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.

Text
DSSE_TR_2003_5.pdf - Other
Download (463kB)

More information

Published date: November 2003
Keywords: Partial Evaluation, Logic Programming, Partial Deduction, Interpreters, Offline Specialization, Self-application

Identifiers

Local EPrints ID: 258567
URI: http://eprints.soton.ac.uk/id/eprint/258567
PURE UUID: 6f383647-0b7c-4dac-a71e-086a386cb26b

Catalogue record

Date deposited: 17 Nov 2003
Last modified: 14 Mar 2024 06:10

Export record

Contributors

Author: Michael Leuschel
Author: Stephen J. Craig
Author: Maurice Bruynooghe
Author: Wim Vanhoof

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×