Generic Weakest Precondition Semantics from Monads Enriched with Order - Coalgebraic Methods in Computer Science Access content directly
Conference Papers Year : 2014

Generic Weakest Precondition Semantics from Monads Enriched with Order

Ichiro Hasuo
  • Function : Author
  • PersonId : 962128

Abstract

We devise a generic framework where a weakest precondition semantics, in the form of indexed posets, is derived from a monad whose Kleisli category is enriched by posets. It is inspired by Jacobs’ recent identification of a categorical structure that is common in various predicate transformers, but adds generality in the following aspects: (1) different notions of modality (such as “may” vs. “must”) are captured by Eilenberg-Moore algebras; (2) nested branching—like in games and in probabilistic systems with nondeterministic environments—is modularly modeled by a monad on the Eilenberg-Moore category of another.
Fichier principal
Vignette du fichier
328263_1_En_2_Chapter.pdf (478.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Licence

Attribution

Identifiers

Cite

Ichiro Hasuo. Generic Weakest Precondition Semantics from Monads Enriched with Order. 12th International Workshop on Coalgebraic Methods in Computer Science (CMCS 2014), Apr 2014, Grenoble, France. pp.10-32, ⟨10.1007/978-3-662-44124-4_2⟩. ⟨hal-01408750⟩
74 View
216 Download

Altmetric

Share

Gmail Facebook X LinkedIn More