Proofs and types
A formulae-as-type notion of control
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The revised report on the syntactic theories of sequential control and state
Theoretical Computer Science
Handbook of logic in computer science (vol. 2)
A symmetric lambda calculus for classical program extraction
Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
The Expressiveness of Simple and Second-Order Type Structures
Journal of the ACM (JACM)
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Continuations: A Mathematical Semantics for Handling FullJumps
Higher-Order and Symbolic Computation
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Some Lambda Calculi with Categorial Sums and Products
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Declarative Continuations: an Investigation of Duality in Programming Language Semantics
Category Theory and Computer Science
Control categories and duality: on the categorical semantics of the lambda-mu calculus
Mathematical Structures in Computer Science
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
| Hi-index | 5.23 |
The Dual Calculus, proposed recently by Wadler, is the outcome of two distinct lines of research in theoretical computer science: (A) Efforts to extend the Curry-Howard isomorphism, established between the simply-typed lambda calculus and intuitionistic logic, to classical logic. (B) Efforts to establish the tacit conjecture that call-by-value (CBV) reduction in lambda calculus is dual to call-by-name (CBN) reduction.This paper initially investigates relations of the Dual Calculus to other calculi, namely the simply-typed lambda calculus and the Symmetric lambda calculus. Moreover, Church-Rosser and Strong Normalization properties are proven for the calculus' CBV reduction relation. Finally, extensions of the calculus to second-order types are briefly introduced.