Refinement for Monadic Programs

MaRDI QIDQ7361144FDO

Authors Peter Lammich

Publication date 30 January 2012

Cites work

• A Powerdomain Construction
• Code generation via higher-order rewrite systems
• Data Refinement
• Encoding, decoding and data refinement
• Unnamed Publication
• Unnamed Publication
• Unnamed Publication
• Unnamed Publication
• Imperative Functional Programming with Isabelle/HOL
• Isabelle/HOL. A proof assistant for higher-order logic
• Modular compiler verification. A refinement-algebraic approach advocating stepwise abstraction
• Proof of correctness of data representations
• Refinement Calculus
• Refinement concepts formalised in higher order logic
• Secure Microkernels, State Monads and Scalable Refinement
• The Isabelle collections framework

Cited in

(6)

• Kruskal's Algorithm for Minimum Spanning Forest
• The Boustrophedon Transform, the Entringer Numbers, and Related Sequences
• NREST: Nondeterministc RESult monad with Time
• The Partition Function and the Pentagonal Number Theorem
• Jinja with Threads
• Collections Framework

This page was built for software: Refinement for Monadic Programs