Monad-independent Hoare logic in HasCasl

DOI10.1007/3-540-36578-8_19MaRDI QIDQ4417837zbMATH OpenFDO

Authors Lutz Schröder, Till Mossakowski

Publication date 30 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2621/26210261.htm

Mathematics Subject Classification ID

Logic in computer science (03B70) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Monad-independent Dynamic Logic in HasCasl
• Monad-independent dynamic logic in HasCasl.
• The Hoare logic of deterministic and nondeterministic monadic recursion schemes
• The expressive power of Horn monadic linear logic
• scientific article; zbMATH DE number 2110621
• HALO, Haskell to logic through denotational semantics
• Monadic Translation of Intuitionistic Sequent Calculus
• Monadic logic programs and functional complexity

Cited in

(10)

• HasCasl: integrated higher-order specification and program development
• The HASCASL prologue: Categorical syntax and semantics of the partial \(\lambda\)-calculus
• A Hoare Logic for the State Monad
• Monad-independent Dynamic Logic in HasCasl
• Generic Hoare logic for order-enriched effects with exceptions
• Generic exception handling and the Java monad
• Abstract Predicates and Mutable ADTs in Hoare Type Theory
• Monad-independent dynamic logic in HasCasl.
• Dijkstra and Hoare monads in monadic computation
• A generic complete dynamic logic for reasoning about purity and effects

This page was built for publication: Monad-independent Hoare logic in HasCasl

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