Dijkstra Monads in Monadic Computation

DOI10.1007/978-3-662-44124-4_8MaRDI QIDQ2942780zbMATH OpenOpenAlexFDO

Authors Bart Jacobs

Publication date 11 September 2015

Published in Advanced Information Systems Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-44124-4_8

Mathematics Subject Classification ID

Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• Dijkstra and Hoare monads in monadic computation
• Dijkstra monads for free
• Monads for incremental computing
• Monads on composition graphs
• scientific article; zbMATH DE number 4024754
• Notions of computation and monads
• Monads in action
• scientific article; zbMATH DE number 2087441

Cited in

(10)

• Generic weakest precondition semantics from monads enriched with order
• The expectation monad in quantum foundations
• scientific article; zbMATH DE number 4047047 (Why is no real title available?)
• Total and partial computation in categorical quantum foundations
• Weakest preconditions in fibrations
• A recipe for state-and-effect triangles
• A recipe for state-and-effect triangles
• Dijkstra monads for free
• Generic weakest precondition semantics from monads enriched with order
• Dijkstra and Hoare monads in monadic computation

Describes a project that uses

Uses Software

• Ynot

This page was built for publication: Dijkstra Monads in Monadic Computation

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