A deconstruction of non-deterministic classical cut elimination

Authors:
J. Laird
Affiliations:
COGS, University of Sussex, UK
Venue:
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Year:
2001

Citing 7
Cited 3

Proofs and types

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
Games and full completeness for multiplicative linear logic

Journal of Symbolic Logic
A semantics of evidence for classical arithmetic

Journal of Symbolic Logic
A symmetric lambda calculus for classical program extraction

Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction

LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Parameter-passing mechanisms and nondeterminism

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing

Sequentiality vs. concurrency in games and logic

Mathematical Structures in Computer Science
Strong normalisation in the π-calculus

Information and Computation
Strong Normalization in the π-calculus with Intersection and Union Types

Fundamenta Informaticae - Intersection Types and Related Systems ITRS

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper shows how a symmetric and nondeterministic cut elimination procedure for a classical sequent calculus can be faithfully simulated using a non-deterministic choice operator to combine difierent 'double-negation' translations of each cut. The resulting interpretation of classical proofs in a λ-calculus with non-deterministic choice leads to a simple proof of termination for cut elimination.