A formulae-as-type notion of control
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The discoveries of continuations
Lisp and Symbolic Computation - Special issue on continuations—part I
Reasoning about programs in continuation-passing style
Lisp and Symbolic Computation - Special issue on continuations—part I
Proceedings of the workshop on Advances in linear logic
A symmetric lambda calculus for classical program extraction
Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
A Curry-Howard foundation for functional computation with control
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Continuation models are universal for lambda-mu-calculus
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Control categories and duality: on the categorical semantics of the lambda-mu calculus
Mathematical Structures in Computer Science
Minimal classical logic and control operators
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Characterizing strong normalization in a language with control operators
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Categorical proof theory of classical propositional calculus
Theoretical Computer Science - Logic, language, information and computation
On the Computational Representation of Classical Logical Connectives
Electronic Notes in Theoretical Computer Science (ENTCS)
Focusing and higher-order abstract syntax
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An approach to call-by-name delimited continuations
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Arithmetical Proofs of Strong Normalization Results for Symmetric λ-calculi
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Computation with classical sequents
Mathematical Structures in Computer Science
Focusing Strategies in the Sequent Calculus of Synthetic Connectives
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Sequent calculi and abstract machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Intuitionistic Letcc via Labelled Deduction
Electronic Notes in Theoretical Computer Science (ENTCS)
Dual Calculus with Inductive and Coinductive Types
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Theoretical Computer Science
Continuation semantics for the Lambek--Grishin calculus
Information and Computation
Continuation semantics for symmetric categorial grammar
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
A substructural type system for delimited continuations
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Call-by-name and call-by-value in normal modal logic
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Call-by-value is dual to call-by-name, extended
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Focalisation and classical realisability
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Lolliproc: to concurrency from classical linear logic via curry-howard and control
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
The language X: circuits, computations and classical logic
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Strong normalization of the dual classical sequent calculus
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Galois embedding from polymorphic types into existential types
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Call-by-value is dual to call-by-name: reloaded
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Call-by-value is dual to call-by-name: reloaded
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Distributed control flow with classical modal logic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Subject reduction vs intersection / union types in λµµ
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Arithmetical Proofs of Strong Normalization Results for Symmetric λ-calculi
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Rewriting Computation and Proof
Copatterns: programming infinite structures by observations
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Completeness and Soundness Results for X with Intersection and Union Types
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
| Hi-index | 0.00 |
The rules of classical logic may be formulated in pairs corresponding to De Morgan duals: rules about & are dual to rules about V. A line of work, including that of Filinski (1989), Griffin (1990), Parigot (1992), Danos, Joinet, and Schellinx (1995), Selinger (1998,2001), and Curien and Herbelin (2000), has led to the startling conclusion that call-by-value is the de Morgan dual of call-by-name.This paper presents a dual calculus that corresponds to the classical sequent calculus of Gentzen (1935) in the same way that the lambda calculus of Church (1932,1940) corresponds to the intuitionistic natural deduction of Gentzen (1935). The paper includes crisp formulations of call-by-value and call-by-name that are obviously dual; no similar formulations appear in the literature. The paper gives a CPS translation and its inverse, and shows that the translation is both sound and complete, strengthening a result in Curien and Herbelin (2000).