Relative Hilbert-Post Completeness for Exceptions

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 lan...

Full description

Saved in:
Bibliographic Details
Published inMathematical Aspects of Computer and Information Sciences pp. 596 - 610
Main Authors Dumas, Jean-Guillaume, Duval, Dominique, Ekici, Burak, Pous, Damien, Reynaud, Jean-Claude
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing 2016
SeriesLecture Notes in Computer Science
Subjects
Core Language
Exact Linear Algebra
Obvious Conversion
Pure Terms
Syntactic Completeness
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9783319328584
3319328581
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-32859-1_51