Hilbert-Post completeness for the state and the exception effects

Abstract : In this paper, we present a novel framework for studying the syntactic completeness of computational effects and we apply it to the exception effect. When applied to the states effect, our framework can be seen as a generalization of Pretnar's work on this subject. We first introduce a relative notion of Hilbert-Post completeness, well-suited to the composition of effects. Then we prove that the exception effect is relatively Hilbert-Post complete, as well as the " core " language which may be used for implementing it; these proofs have been formalized and checked with the proof assistant Coq.
Complete list of metadatas

Contributor : Jean-Guillaume Dumas <>
Submitted on : Monday, March 2, 2015 - 6:33:34 PM
Last modification on : Tuesday, June 18, 2019 - 3:24:04 PM
Long-term archiving on : Sunday, May 31, 2015 - 11:31:11 AM


Files produced by the author(s)


  • HAL Id : hal-01121924, version 1
  • ARXIV : 1503.00948


Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous, Jean-Claude Reynaud. Hilbert-Post completeness for the state and the exception effects. 2015. ⟨hal-01121924v1⟩



Record views


Files downloads