Completeness of global evaluation logic

Authors:
Sergey Goncharov;Lutz Schröder;Till Mossakowski
Affiliations:
Department of Computer Science, University of Bremen, Germany;,Department of Computer Science, University of Bremen, Germany;,Department of Computer Science, University of Bremen, Germany
Venue:
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Year:
2006

Citing 11
Cited 3

Notions of computation and monads

Information and Computation
Term rewriting systems

Handbook of logic in computer science (vol. 2)
Proving termination with multiset orderings

Communications of the ACM
Coalgebras and monads in the semantics of java

Theoretical Computer Science - Special issue: Algebraic methodology and software technology
Monadic encapsulation of effects: a revised approach (extended version)

Journal of Functional Programming
Monadic parsing in Haskell

Journal of Functional Programming
Monadic regions

Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Monad-independent Dynamic Logic in HasCasl

Journal of Logic and Computation
On a monadic semantics for freshness

Theoretical Computer Science - Applied semantics: Selected topics
Monad-independent Hoare logic in HasCasl

FASE'03 Proceedings of the 6th international conference on Fundamental approaches to software engineering
A Semantics For Evaluation Logic

Fundamenta Informaticae

HasCasl: Integrated higher-order specification and program development

Theoretical Computer Science
A generic complete dynamic logic for reasoning about purity and effects

FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
A Relatively Complete Generic Hoare Logic for Order-Enriched Effects

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.