Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation

DOI10.1016/S0747-7171(06)80003-9zbMath0804.68025OpenAlexW2069926280MaRDI QIDQ1322838

Maurice Bruynooghe, Dmitri Boulanger

Publication date: 9 May 1994

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(06)80003-9

zbMATH Keywords

logic programsOLDT resolutionfold/unfold transformation

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• Compiling bottom-up and mixed derivations into top-down executable logic programs
• Declarative modeling of the operational behavior of logic languages
• Preservation of stronger equivalence in unfold/fold logic program transformation
• Specialisation of Prolog and FCP programs using abstract interpretation
• Unfold/fold transformation of stratified programs
• Termination proofs for logic programs
• A linear-time algorithm for finding all feedback vertices
• Recursive query processing: The power of logic
• Most specific logic programs
• Compiling control
• Partial evaluation in logic programming
• Abstract interpretation based on oldt resolution
• A Transformation System for Developing Recursive Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation