Name
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. |
Year | Venue | Field |
|---|---|---|
2015 | CoRR | Discrete mathematics,Mathematical proof,Syntax,Completeness (statistics),Calculus,Mathematics,Proof assistant,Contradiction |
DocType | Volume | Citations |
Journal | abs/1503.00948 | 0 |
PageRank | References | Authors |
0.34 | 10 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jean-Guillaume Dumas | 1 | 428 | 68.48 |
| Dominique Duval | 2 | 103 | 21.52 |
| Burak Ekici | 3 | 5 | 3.14 |
| Damien Pous | 4 | 240 | 31.00 |
| Jean-Claude Reynaud | 5 | 47 | 9.73 |