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

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01121924
Contributor : Jean-Guillaume Dumas <>
Submitted on : Thursday, October 8, 2015 - 11:12:52 AM
Last modification on : Thursday, July 4, 2019 - 9:54:02 AM
Long-term archiving on : Saturday, January 9, 2016 - 10:19:07 AM

Files

HP-Completeness.pdf
Files produced by the author(s)

Identifiers

Citation

Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Jean-Claude Reynaud, Damien Pous. Hilbert-Post completeness for the state and the exception effects. Sixth International Conference on Mathematical Aspects of Computer and Information Sciences, Nov 2015, Berlin, Germany. pp.596-610, ⟨10.1007/978-3-319-32859-1_51⟩. ⟨hal-01121924v3⟩

Share

Metrics

Record views

648

Files downloads

155