A self-applicable partial evaluator and its use in incremental compilation

DOI10.1007/BF03037133zbMath0654.68024MaRDI QIDQ1108782

S. H. Smith

Publication date: 1988

Published in: New Generation Computing (Search for Journal in Brave)

zbMATH Keywords

partial evaluationknowledge-based systemsPrologcompiler generationmeta programmingincremental compilationcompiler generator generationself-application

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (5)

Partial evaluation of metaprograms in a ``multiple worlds logic language ⋮ Partial evaluation with inference rules ⋮ Role of logic programming in the FGCS project ⋮ How to control unfolding when specializing interpreters ⋮ A general criterion for avoiding infinite unfolding during partial deduction

Cites Work

• Unnamed Item
• Negation and control in PROLOG
• Unfolding rules for GHC programs
• A partial evaluator, and its use as a programming tool
• How to invent a Prolog machine

This page was built for publication: A self-applicable partial evaluator and its use in incremental compilation