A simple calculus of exception handling

DOI10.1007/BFB0014054MaRDI QIDQ3024836zbMATH OpenFDO

Authors Philippe de Groote

Publication date 4 July 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0014054

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• An intuitionistic λ-calculus with exceptions
• A confluence result for a typed -calculus of exception handling with fixed-point
• A confluent λ-calculus with a catch/throw mechanism
• The _-calculus
• A System F with Call-by-Name Exceptions

Cited in

(28)

• Unchecked exceptions can be strictly more powerful than call/cc
• On the strong normalisation of intuitionistic natural deduction with permutation-conversions
• Confluency and strong normalizability of call-by-value -calculus
• On the concurrent computational content of intermediate logics
• Strong normalization of classical natural deduction with disjunctions
• On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem
• Domain-free -calculus
• Exceptional syntax
• Proving syntactic properties of exceptions in an ordered logical framework
• A third-order representation of the -calculus
• Classical proofs as parallel programs
• A type system for call-by-name exceptions
• A System F with Call-by-Name Exceptions
• Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control
• Validating Brouwer's continuity principle for numbers using named exceptions
• An intuitionistic λ-calculus with exceptions
• Exceptions, continuations and macro-expressiveness
• Exceptions in the rewriting calculus
• A confluence result for a typed -calculus of exception handling with fixed-point
• Backjumping is Exception Handling
• scientific article; zbMATH DE number 7393562 (Why is no real title available?)
• Programming and Proving with Classical Types
• Disjunctive normal forms and local exceptions
• Strong normalizability of the non-deterministic catch/throw calculi
• What stands between grounding rules and logical rules is the excluded middle
• The functional machine calculus. III: Control
• The DNF exception problem
• Strong normalization proofs by CPS-translations

This page was built for publication: A simple calculus of exception handling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3024836)