A confluent λ-calculus with a catch/throw mechanism

DOI10.1017/S0956796899003512zbMATH Open0954.68039MaRDI QIDQ4948005FDOQ4948005

T. Crolard

Publication date: 5 February 2001

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

Recommendations

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

zbMATH Keywords

catch\(\lambda\)-calculusthrow

Mathematics Subject Classification ID

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

Cited In (8)

• Intuitionistic Letcc via Labelled Deduction
• Title not available (Why is that?)
• Title not available (Why is that?)
• A proof-theoretic foundation of abortive continuations
• An intuitionistic λ-calculus with exceptions
• Title not available (Why is that?)
• Strong normalizability of the non-deterministic catch/throw calculi
• Title not available (Why is that?)

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)