Relative Hilbert-Post Completeness for Exceptions
MACIS, pp. 596-610, 2015.
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 ar...More
Full Text (Upload PDF)
PPT (Upload PPT)