Normalization without reducibility
From MaRDI portal
Publication:1840460
DOI10.1016/S0168-0072(00)00030-0zbMath0966.03015WikidataQ126382660 ScholiaQ126382660MaRDI QIDQ1840460
Publication date: 24 July 2001
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Related Items (9)
A completeness result for a realisability semantics for an intersection type system ⋮ A short proof that adding some permutation rules to \(\beta \) preserves SN ⋮ Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage ⋮ A short proof of the strong normalization of classical natural deduction with disjunction ⋮ A domain model characterising strong normalisation ⋮ Unnamed Item ⋮ An estimation for the lengths of reduction sequences of the $\lambda\mu\rho\theta$-calculus ⋮ Contraction-free Proofs and Finitary Games for Linear Logic ⋮ Big-step normalisation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Complete restrictions of the intersection type discipline
- Typing untyped \(\lambda\)-terms, or reducibility strikes again!
- Typing and computational properties of lambda expressions
- A new type assignment for λ-terms
- A filter lambda model and the completeness of type assignment
- Functional Characters of Solvable Terms
This page was built for publication: Normalization without reducibility
