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.
Cite
@article{arxiv.1503.00948,
title = {Hilbert-Post completeness for the state and the exception effects},
author = {Jean-Guillaume Dumas and Dominique Duval and Burak Ekici and Damien Pous and Jean-Claude Reynaud},
journal= {arXiv preprint arXiv:1503.00948},
year = {2015}
}
Comments
Siegfried Rump (Hamburg University of Technology), Chee Yap (Courant Institute, NYU). Sixth International Conference on Mathematical Aspects of Computer and Information Sciences , Nov 2015, Berlin, Germany. 2015, LNCS