Totally correct logic program transformations via well-founded annotations

DOI10.1007/s10990-008-9024-6zbMath1194.68095OpenAlexW2056630677MaRDI QIDQ2271905

Maurizio Proietti, Alberto Pettorossi

Publication date: 4 August 2009

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2108/41687

zbMATH Keywords

logic programmingprogram transformation ruleswell-founded orderingspartial and total correctness

Mathematics Subject Classification ID

Logic programming (68N17) Theory of software (68N99)

Related Items (1)

Constraint-based correctness proofs for logic program transformations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Termination of rewriting
• Unfold/fold transformation of stratified programs
• Reasoning about termination of pure Prolog programs
• Strong termination of logic programs
• A Transformation System for Developing Recursive Programs
• The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
• Simultaneous Replacement in Normal Programs
• Synthesis and transformation of logic programs using unfold/fold proofs

This page was built for publication: Totally correct logic program transformations via well-founded annotations