Proving the correctness of recursion-based automatic program transformations

DOI10.1016/0304-3975(96)00074-6MaRDI QIDQ671683zbMATH OpenOpenAlexFDO

Authors David Sands

Publication date 27 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(96)00074-6

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Recommendations

• Proving the correctness of recursion-based automatic program transformations
• Automatic Correctness Proofs for Logic Program Transformations
• scientific article; zbMATH DE number 2222694
• scientific article; zbMATH DE number 108494
• Proving theorems by program transformation
• On the Proof Theory of Program Transformations
• scientific article; zbMATH DE number 4113956
• Correctness of program transformations as a termination problem
• scientific article; zbMATH DE number 1555192
• Recursive program optimization through inductive synthesis proof transformation

Cites work

• scientific article; zbMATH DE number 4180818 (Why is no real title available?)
• scientific article; zbMATH DE number 42475 (Why is no real title available?)
• scientific article; zbMATH DE number 3631906 (Why is no real title available?)
• scientific article; zbMATH DE number 194911 (Why is no real title available?)
• scientific article; zbMATH DE number 236855 (Why is no real title available?)
• A Transformation System for Developing Recursive Programs
• A syntactic theory of sequential control
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Infinite trees in normal form and recursive equations having a unique solution
• Partial evaluation in logic programming
• Proving the correctness of recursion-based automatic program transformations
• The concept of a supercompiler

Cited in

(11)

• Correctness of a higher-order removal transformation through a relational reasoning.
• A Structure-directed Total Correctness Proof Rule for Recursive Procedure Calls
• On proving the correctness of program transformations based on free theorems for higher-order polymorphic calculi
• Proving the correctness of recursion-based automatic program transformations
• Proving the correctness of recursion-based automatic program transformations
• Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
• scientific article; zbMATH DE number 2242599 (Why is no real title available?)
• Correctness of program transformations as a termination problem
• Deforestation, program transformation, and cut-elimination
• scientific article; zbMATH DE number 3890701 (Why is no real title available?)
• scientific article; zbMATH DE number 4113956 (Why is no real title available?)

Describes a project that uses

Uses Software

• Refal

This page was built for publication: Proving the correctness of recursion-based automatic program transformations

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