## A semantic view of classical proofs -- type-theoretic, categorical, and denotational characterizations (Extended Abstract) (1996)

Venue: | IN PROCEEDINGS OF LICS '96 |

Citations: | 30 - 2 self |

### BibTeX

@INPROCEEDINGS{Ong96asemantic,

author = {C.-H. L. Ong},

title = {A semantic view of classical proofs -- type-theoretic, categorical, and denotational characterizations (Extended Abstract)},

booktitle = {IN PROCEEDINGS OF LICS '96},

year = {1996},

pages = {230--241},

publisher = {IEEE Press}

}

### Years of Citing Articles

### OpenURL

### Abstract

Classical logic is one of the best examples of a mathematical theory that is truly useful to computer science. Hardware and software engineers apply the theory routinely. Yet from a foundational standpoint, there are aspects of classical logic that are problematic. Unlike intuitionistic logic, classical logic is often held to be non-constructive, and so, is said to admit no proof semantics. To draw an analogy in the proofsas -programs paradigm, it is as if we understand well the theory of manipulation between equivalent specifications (which we do), but have comparatively little foundational insight of the process of transforming one program to another that implements the same specification. This extended abstract outlines a semantic theory of classical proofs based on a variant of Parigot's λµ-calculus [24], but presented here as a type theory. After reviewing the conceptual problems in the area and the potential benefits of such a theory, we sketch the key steps of our approach in ...