Partial evaluation of metaprograms in a ``multiple worlds logic language

DOI10.1007/BF03037139zbMath0654.68022OpenAlexW2049362499MaRDI QIDQ1108779

Giorgio Levi, Giuseppe Sardu

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1007/bf03037139

zbMATH Keywords

partial evaluationlogic programmingPrologmetaprogrammingautomatic compilationKBMSknowledge based systemknowlege base management systemmetainterpretermultiple worlds

Mathematics Subject Classification ID

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

Related Items

How to control unfolding when specializing interpreters, A general criterion for avoiding infinite unfolding during partial deduction, Mixtus: An automatic partial evaluator for full Prolog, Sound and complete partial deduction with unfolding based on well-founded measures

Cites Work

• Unnamed Item
• A self-applicable partial evaluator and its use in incremental compilation
• Composing recursive logic programs with clausal join
• Mixed computation: potential applications and problems for study
• On the partial computation principle