Strong normalizability of the non-deterministic catch/throw calculi

DOI10.1016/S0304-3975(00)00352-2zbMath0984.68029OpenAlexW2091355415MaRDI QIDQ5958297

Yukiyoshi Kameyama, Masahiko Sato

Publication date: 3 March 2002

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00352-2

zbMATH Keywords

type systemcatch and throwclassical logicstrong normalizability

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (1)

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

Uses Software

• LISP

Cites Work

• A constructive logic behind the catch and throw mechanism
• Intuitionistic and classical natural deduction systems with the catch and the throw rules
• Proofs of strong normalisation for second order classical natural deduction
• A confluent λ-calculus with a catch/throw mechanism
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strong normalizability of the non-deterministic catch/throw calculi