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

DOI10.1007/BF00249018zbMATH Open0733.68013OpenAlexW2121496138MaRDI QIDQ809591FDOQ809591

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

Recommendations

• scientific article
• Publication:4944882
• scientific article; zbMATH DE number 1222414
• scientific article
• Publication:4506395

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

• A Transformation System for Developing Recursive Programs
• Compiling control
• Title not available (Why is that?)
• Integrity constraint checking in stratified databases
• On the transformation of logic programs with instantiation based computation rules
• A technique for translating clausal specifications of numerical methods into efficient programs
• Title not available (Why is that?)

Cited In (3)

• Compiling control
• Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation
• Title not available (Why is that?)

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)