On the Proof Theory of Program Transformations

DOI10.1093/JIGPAL/3.4.643zbMATH Open0833.68076OpenAlexW1968296897MaRDI QIDQ4847375FDOQ4847375

Authors: Martin C. Henson 

Publication date: 20 September 1995

Published in: Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/85b35d1ffc2f75f2817e601bb9cce9fdafa31593

Recommendations

• An Intensional Semantics for Elementary Program Transformations
• scientific article; zbMATH DE number 1555192
• scientific article; zbMATH DE number 782031
• scientific article; zbMATH DE number 785053
• Representing proof transformations for program optimization

zbMATH Keywords

constructive set theoryprogram transformationintensional semantics

Mathematics Subject Classification ID

Proof theory in general (including proof-theoretic semantics) (03F03) Other constructive mathematics (03F65) Semantics in the theory of computing (68Q55)

Cited In (10)

• System Description: The Proof Transformation System CERES
• A Transformational Approach to Prove Outermost Termination Automatically
• On transformations of untyped functional programs and their procedural semantics
• Title not available (Why is that?)
• An Intensional Semantics for Elementary Program Transformations
• Title not available (Why is that?)
• A Framework for Point-Free Program Transformation
• Formal program construction by transformations-computer-aided, intuition-guided programming
• Title not available (Why is that?)
• Proving the correctness of recursion-based automatic program transformations

This page was built for publication: On the Proof Theory of Program Transformations

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