Partial evaluation of metaprograms in a ``multiple worlds logic language
DOI10.1007/BF03037139zbMATH Open0654.68022OpenAlexW2049362499MaRDI QIDQ1108779FDOQ1108779
Authors: 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
Recommendations
partial evaluationlogic programmingPrologmetaprogrammingautomatic compilationKBMSknowledge based systemknowlege base management systemmetainterpretermultiple worlds
Artificial intelligence (68T99) Theory of compilers and interpreters (68N20) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
Cited In (9)
- Partial evaluation in logic programming
- Sound and complete partial deduction with unfolding based on well-founded measures
- Mixtus: An automatic partial evaluator for full Prolog
- A general criterion for avoiding infinite unfolding during partial deduction
- Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
- Title not available (Why is that?)
- Mixed computation of Prolog programs
- How to control unfolding when specializing interpreters
- Title not available (Why is that?)
This page was built for publication: Partial evaluation of metaprograms in a ``multiple worlds logic language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108779)