Proving the correctness of recursion-based automatic program transformations
From MaRDI portal
Publication:671683
DOI10.1016/0304-3975(96)00074-6zbMATH Open0874.68025OpenAlexW2060717017MaRDI QIDQ671683FDOQ671683
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
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
- The concept of a supercompiler
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Partial evaluation in logic programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Transformation System for Developing Recursive Programs
- A syntactic theory of sequential control
- Title not available (Why is that?)
- Title not available (Why is that?)
- Infinite trees in normal form and recursive equations having a unique solution
- Title not available (Why is that?)
- Proving the correctness of recursion-based automatic program transformations
Cited In (11)
- Deforestation, program transformation, and cut-elimination
- Title not available (Why is that?)
- Correctness of program transformations as a termination problem
- 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
- Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
- Correctness of a higher-order removal transformation through a relational reasoning.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proving the correctness of recursion-based automatic program transformations
- Proving the correctness of recursion-based automatic program transformations
Uses Software
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)
