Disjunctive normal forms and local exceptions

Authors:
Emmanuel Beffara;Vincent Danos
Affiliations:
Universitat Paris 7, Equipe PPS, Paris Cedex, France;Universitat Paris 7, Equipe PPS, Paris Cedex, France
Venue:
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Year:
2003

Citing 5
Cited 1

A formulae-as-type notion of control

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Curry-Howard foundation for functional computation with control

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The functional approach to programming

The functional approach to programming
Strong normalizability of the non-deterministic catch/throw calculi

Theoretical Computer Science - Special issue on theories of types and proofs
Dependent choice, 'quote' and the clock

Theoretical Computer Science

Focalisation and classical realisability

CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

All classical ?-terms typable with disjunctive normal forms are shown to share a common computational behavior: they implement a local exception handling mechanism whose exact workings depend on the tautology. Equivalent and more efficient control combinators are described through a specialized sequent calculus and shown to be correct.