Zena Ariola, Hugo Herbelin  Home/Search
Context
Related
| coq.inria.fr/~herbelin/...icalp2003.ps 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: coq.inria.fr/~herbelin/....publis (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We give an analysis of various classical axioms and characterize a notion of minimal classical logic that enforces Peirce's law without enforcing Ex Falso Quodlibet. We show that a \natural" implementation of this logic is Parigot's classical natural deduction. (Update)
Active bibliography (related documents): More All
0.5: Typed Exceptions and Continuations Cannot Macro-Express Each.. - Riecke, Thielecke (1999) (Correct)
0.2: Categorical Structure of Continuation Passing Style - Thielecke (1997) (Correct)
0.2: Return Types for Functional Continuations - Gunter, Rémy, Riecke (1998) (Correct)
Similar documents based on text: More All
0.4: Correctness of Monadic State: An Imperative Call-by-Need Calculus - Ariola, Sabry (1998) (Correct)
0.4: Cyclic Lambda Calculi - Ariola, Blom (1997) (Correct)
0.4: Bisimilarity in Term Graph Rewriting - Ariola, Klop, Plump (1998) (Correct)
BibTeX entry: (Update)
@misc{ ariola-minimal,
author = "Zena Ariola and Hugo Herbelin",
title = "Minimal Classical Logic and Control Operators",
url = "citeseer.ist.psu.edu/ariola03minimal.html" }
Citations (may not include all citations):146 Investigations into logical deduction (context) - Gentzen - 1969
138 A revised report on the syntactic theories of sequential con.. - Felleisen, Hieb - 1992
67 Representing monads - Filinski - 1994
66 Abstracting control - Danvy, Filinski - 1990
58 a Proof-Theoretical Study (context) - Prawitz - 1965
51 the expressive power of programming languages - Felleisen - 1990
40 A Curry-Howard foundation for functional computation with co.. - Luke, Stewart - 1997
18 Lambda-mu-calculus: An algorithmic interpretation of classic.. (context) - Parigot - 1992
15 A functional abstraction of typed contexts - Danvy, Filinski - 1989
14 Extracting constructive content from classical logic via con.. - Barbanera, Berardi - 1993
11 A library of high-level control operators - Queinnec - 1993
11 The formulae-as-types notion of control (context) - Grin - 1990
8 ein Reduzierter Intuitionistischer Formalismus (context) - Johansson, ul - 1936
7 Typing rst-class continuations in ML (context) - Duba, Harper et al. - 1991
5 A lambda-calculus structure isomorphic to Gentzen-style sequ.. (context) - Herbelin - 1994
4 Sound and complete axiomatization of call-by-value control o.. (context) - Hofmann - 1995
2 A computational interpretation of the lambda-mu calculus - Bierman - 1998
1 con uent lambda calculu with catchthrow mechanism (context) - con, calculus et al. - 1999
1 Classical logic: Continuation semantics and abstract machine.. - Streicher, Reus - 1998
1 The theory of practice of rst-class prompt (context) - Felleisen - 1988
1 the relation between the lambda-mu calculus and the syntacti.. (context) - de Groote - 1994
1 Con uence en -calcul (context) - Py - 1998
Documents on the same site (http://coq.inria.fr/~herbelin/./publis.html): More
A-translation and Looping Combinators in Pure Type Systems - Coquand, Herbelin (1994) (Correct)
Unknown - (Correct)
The Duality of Computation - Curien, Herbelin (2000) (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