Data refinement, call by value and higher order programs

DOI10.1007/BF01210999zbMath0841.68034OpenAlexW2008212936MaRDI QIDQ1906039

David A. Naumann

Publication date: 2 July 1996

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01210999

zbMATH Keywords

refinement calculuspredicate transformersprogramming calculialgorithmic refinementLax exponent

Mathematics Subject Classification ID

Theory of programming languages (68N15) Data structures (68P05)

Related Items (2)

Category Theoretic Models of Data Refinement ⋮ Soundness of data refinement for a higher-order imperative language

Cites Work

• Predicate transformers and higher-order programs
• Laws of data refinement
• Domain theory in logical form
• Data refinement of predicate transformers
• Inductive data types for predicate transformers
• An algebraic construction of predicate transformers
• A recursion theorem for predicate transformers on inductive data types
• Proof of correctness of data representations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Data refinement, call by value and higher order programs