Compiling bottom-up and mixed derivations into top-down executable logic programs

DOI10.1007/BF00249018MaRDI QIDQ809591zbMATH OpenOpenAlexFDO

Authors Bern Martens, Gunther Sablon, Maurice Bruynooghe, Danny De Schreye

Publication date 1991

Published in Journal of Automated Reasoning (Search for Journal in Brave)

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

zbMATH Keywords

program transformationcompilation of non-standard computation rulesCompiling Controlcontrol rules

Mathematics Subject Classification ID

Logic programming (68N17) Theory of compilers and interpreters (68N20)

Cites work

• scientific article; zbMATH DE number 4164123 (Why is no real title available?)
• scientific article; zbMATH DE number 193735 (Why is no real title available?)
• A Transformation System for Developing Recursive Programs
• A technique for translating clausal specifications of numerical methods into efficient programs
• Compiling control
• Integrity constraint checking in stratified databases
• On the transformation of logic programs with instantiation based computation rules

Cited in

(3)

• Compiling control
• Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation
• scientific article; zbMATH DE number 4110158 (Why is no real title available?)

This page was built for publication: Compiling bottom-up and mixed derivations into top-down executable logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809591)