Strong normalization of the second-order symmetric \(\lambda \mu\)-calculus
From MaRDI portal
Publication:1881230
DOI10.1016/j.ic.2004.04.002zbMath1051.03016MaRDI QIDQ1881230
Publication date: 4 October 2004
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2004.04.002
Related Items
Cites Work
- The value of a classical integer in \(\lambda \mu\)-calculus
- Confluency and strong normalizability of call-by-value \(\lambda \mu\)-calculus
- A strong normalization result for classical logic
- A normalization-procedure for the first order classical natural deduction with full logical symbols
- A symmetric lambda calculus for classical program extraction
- Classical logic, continuation semantics and abstract machines
- A new deconstructive logic: linear logic
- Proofs of strong normalisation for second order classical natural deduction
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item