Intuitionistic and classical natural deduction systems with the catch and the throw rules

DOI10.1016/S0304-3975(96)00170-3zbMath0904.03016OpenAlexW2010520973MaRDI QIDQ1392143

Masahiko Sato

Publication date: 23 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00170-3

zbMATH Keywords

completenessrecursiondecidabilitydenotational semanticslambda calculuscatch and throwlogic of programsclassical natural deduction systemequational proof systemfunctional laguagesintuitionistic natural deduction system

Mathematics Subject Classification ID

Logic in computer science (03B70)

Related Items (2)

Strong normalizability of the non-deterministic catch/throw calculi ⋮ Intuitionistic Letcc via Labelled Deduction

Cites Work

• Adding proof objects and inductive definition mechanisms to frege structures
• Strong normalizability of the non-deterministic catch/throw calculi
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Intuitionistic and classical natural deduction systems with the catch and the throw rules