A self-applicable partial evaluator and its use in incremental compilation
From MaRDI portal
This paper presents an experimental implementation of a self-applicable partial evaluator in Prolog used for compiler generation and compiler generator generation. The partial evaluator is an extension of a simple meta interpreter for Prolog programs, and its self-application is straightforward because of its simplicity. A method of incremental compilation is also described as a promising application of the partial evaluator for knowledge-based systems.
Recommendations
Cites work
Cited in
(13)- Partial evaluation of metaprograms in a ``multiple worlds logic language
- Partial evaluation with inference rules
- A general criterion for avoiding infinite unfolding during partial deduction
- Semantics-directed generation of a Prolog compiler
- Bootstrapping compiler generators from partial evaluators
- scientific article; zbMATH DE number 3940700 (Why is no real title available?)
- scientific article; zbMATH DE number 3978352 (Why is no real title available?)
- scientific article; zbMATH DE number 4050967 (Why is no real title available?)
- scientific article; zbMATH DE number 1738296 (Why is no real title available?)
- A sketch-based technique for the derivation of self-interpreters
- Role of logic programming in the FGCS project
- Functional and Logic Programming
- How to control unfolding when specializing interpreters
This page was built for publication: A self-applicable partial evaluator and its use in incremental compilation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108782)