Name
Abstract | ||
|---|---|---|
A theory is complete if it does not contain a contradiction, while all of its proper extensions do. In this paper, first we introduce a relative notion of syntactic completeness; then we prove that adding exceptions to a programming language can be done in such a way that the completeness of the language is not made worse. These proofs are formalized in a logical system which is close to the usual syntax for exceptions, and they have been checked with the proof assistant Coq. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-32859-1_51 | MACIS |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 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 |