A confluent λ-calculus with a catch/throw mechanism

DOI10.1017/S0956796899003512MaRDI QIDQ4948005zbMATH OpenFDO

Authors T. Crolard

Publication date 5 February 2001

Published in Journal of Functional Programming (Search for Journal in Brave)

zbMATH Keywords

catch\(\lambda\)-calculusthrow

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)

Recommendations

• Publication:4490747
• Strong normalizability of the non-deterministic catch/throw calculi
• Publication:4934350
• The \(\lambda \mu^{\mathbf{T}}\)-calculus

Cited in

(9)

• scientific article; zbMATH DE number 1390083 (Why is no real title available?)
• Intuitionistic Letcc via Labelled Deduction
• scientific article; zbMATH DE number 2185662 (Why is no real title available?)
• scientific article; zbMATH DE number 1479632 (Why is no real title available?)
• Bisimulations for delimited-control operators
• A proof-theoretic foundation of abortive continuations
• An intuitionistic λ-calculus with exceptions
• The \(\lambda \mu^{\mathbf{T}}\)-calculus
• Strong normalizability of the non-deterministic catch/throw calculi

This page was built for publication: A confluent λ-calculus with a catch/throw mechanism

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