Proving the correctness of recursion-based automatic program transformations

DOI10.1016/0304-3975(96)00074-6zbMath0874.68025OpenAlexW2060717017MaRDI QIDQ671683

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)

Related Items

Proving the correctness of recursion-based automatic program transformations

Uses Software

• Refal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proving the correctness of recursion-based automatic program transformations
• A syntactic theory of sequential control
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• The concept of a supercompiler
• Infinite trees in normal form and recursive equations having a unique solution
• Partial evaluation in logic programming
• A Transformation System for Developing Recursive Programs