Completeness of global evaluation logic (2006)
| Venue: | IN MFCS 06, LNCS 4162 |
| Citations: | 2 - 1 self |
BibTeX
@INPROCEEDINGS{Goncharov06completenessof,
author = {Sergey Goncharov and Lutz Schröder and Till Mossakowski},
title = {Completeness of global evaluation logic},
booktitle = {IN MFCS 06, LNCS 4162},
year = {2006},
pages = {447--458},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Monads serve the abstract encapsulation of side effects in semantics and functional programming. Various monad-based specification languages have been introduced in order to express requirements on generic side-effecting programs. A basic role is played here by global evaluation logic, concerned with formulae which may be thought of as being universally quantified over the state space; this formalism is the fundament of more advanced logics such as monad-based Hoare logic or dynamic logic. We prove completeness of global evaluation logic for models in cartesian categories with a distinguished Heyting algebra object.
