Dijkstra Monads in Monadic Computation - Coalgebraic Methods in Computer Science Access content directly
Conference Papers Year : 2014

Dijkstra Monads in Monadic Computation

Bart Jacobs
  • Function : Author
  • PersonId : 976960

Abstract

The Dijkstra monad has been introduced recently for capturing weakest precondition computations within the context of program verification, supported by a theorem prover. Here we give a more general description of such Dijkstra monads in a categorical setting. We first elaborate the recently developed view on program semantics in terms of a triangle of computations, state transformers, and predicate transformers. Instantiations of this triangle for different monads T show how to define the Dijkstra monad associated with T , via the logic involved. Technically, we provide a morphism of monads from the state monad transformation applied to T , to the Dijkstra monad associated with T . This monad map is precisely the weakest precondition map in the triangle, given in categorical terms by substitution.
Fichier principal
Vignette du fichier
328263_1_En_8_Chapter.pdf (481.7 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01408757 , version 1 (05-12-2016)

Licence

Attribution

Identifiers

Cite

Bart Jacobs. Dijkstra Monads in Monadic Computation. 12th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Apr 2014, Grenoble, France. pp.135-150, ⟨10.1007/978-3-662-44124-4_8⟩. ⟨hal-01408757⟩
60 View
219 Download

Altmetric

Share

Gmail Facebook X LinkedIn More