C.-H. L. Ong  Home/Search
Context
Related
| comlab.ox.ac.uk/pub/D...classical.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: comlab.ox.ac.uk/ou...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Active bibliography (related documents): More All
0.8: A Curry-Howard foundation for functional computation with control - Ong, Stewart (1997) (Correct)
0.3: A Constructive Restriction of the lambda µ-calculus - Crolard (1999) (Correct)
0.3: A Notion of Classical Pure Type System - Barthe, Hatcliff, Sørensen (1997) (Correct)
Similar documents based on text: More All
0.5: A Universal Innocent Game Model For The Böhm Tree Lambda Theory - Ker, Nickau, Ong (Correct)
0.4: A Deconstruction of Non-deterministic Classical Cut Elimination - Laird (Correct)
0.2: The Anatomy of Innocence - Danos, Harmer (2001) (Correct)
BibTeX entry: (Update)
@incollection{ ong96semantic,
author = "C.-H. Luke Ong",
title = "A Semantic View of Classical Proofs: Type-Theoretic, Categorical, and Denotational Characterizations (Preliminary Extended Abstract)",
booktitle = "Proceedings 11th Annual {IEEE} Symp.\ on Logic in Computer Science, {LICS}'96, New Brunswick, {NJ}, {USA}, 27--30 July 1996",
publisher = "IEEE Computer Society Press",
address = "Los Alamitos, CA",
pages = "230--241",
year = "1996",
url = "citeseer.ist.psu.edu/ong96semantic.html" }
Citations (may not include all citations):268 Proofs and Types (context) - Girard, Lafont et al. - 1989
175 Games and full completeness for multiplicative linear logic - Abramsky, Jagadeesan - 1994
134 calculus: an algorithmic interpretation of classical natural.. (context) - Parigot - 1992
110 A formulae-as-types notion of control - Griffin - 1990
75 A syntactic theory of sequential control (context) - Felleisen, Friedman et al. - 1987
72 A new constructive logic: classical logic (context) - Girard - 1991
68 On full abstraction for PCF (context) - Hyland, Ong - 1994
57 A new deconstructive logic: linear logic - Danos, Joinet et al. - 1995
41 An evaluation semantics for classical proofs (context) - Murthy - 1991
38 Structural cut elimination - Pfenning - 1995
37 dialogue games and PCF (context) - Hyland, Ong - 1995
35 Cambridge University Press (context) - Crole, Types - 1993
24 Program extraction from classical proofs (context) - Berger, Schwichtenberg - 1995
22 the unity of logic (context) - Girard - 1995
21 A semantics of evidence for classical arithmetic (context) - Coquand - 1995
18 calculus structure isomorphic to sequent calculus structure (context) - Herbelin - 1995
16 A CPS-translation of the ¯-calculus (context) - de Groote - 1994
15 Sound and complete axiomatisations of call-by-value control .. - Hofmann - 1994
14 Extracting constructive content from classical logic via con.. - Barbanera, Berardi - 1993
10 Mathematical significance of consistency proofs (context) - Kreisel - 1958
9 Logical Structure of Catch and Throw Mechanism - Nakano - 1995
7 Stockholm Studies in Philosophy (context) - Prawitz, Almqvist - 1965
7 Computational content of classical logic - Coquand - 1996
5 A reduction rule for the peirce formula (context) - Hirokawa, Komori et al. - 1996
5 Fibred categories and the foundations of na ive category the.. (context) - Benabou - 1985
5 storage operators and second order -calculus (context) - Krivine - 1994
Documents on the same site (http://www.comlab.ox.ac.uk/oucl/users/luke.ong/publications.html): More
A Curry-Howard foundation for functional computation with control - Ong, Stewart (1997) (Correct)
Non-Determinism in a Functional Setting (Extended Abstract) - Ong (1993) (Correct)
Correspondence between Operational and Denotational Semantics - Ong (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC