Postponement, conservation and preservation of strong normalization for generalized reduction

DOI10.1093/LOGCOM/10.5.721zbMATH Open0969.03022OpenAlexW2091852848MaRDI QIDQ4522334FDOQ4522334

Authors: Fairouz Kamareddine 

Publication date: 3 October 2001

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/e67db16d56f7a1eb13d55c1e620197fc0ba971b3

Recommendations

• scientific article; zbMATH DE number 512779
• \(\lambda\)-calculi with explicit substitutions and composition which preserve \(\beta\)-strong normalization
• A note on preservation of strong normalisation in the \(\lambda \)-calculus
• scientific article; zbMATH DE number 1332643
• \(\lambda_{\beta'}\) -- a \(\lambda\)-calculus with a generalized \(\beta\)-reduction rule

zbMATH Keywords

preservation of strong normalizationgeneralized \(\beta\)-reductiongeneralized conservationpostponement of \(K\)-contractions

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cited In (5)

• On the longest perpetual reductions in orthogonal expression reduction systems
• De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: The typed case
• De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: the untyped case
• A short proof that adding some permutation rules to \(\beta \) preserves SN
• On strong normalization and type inference in the intersection type discipline

This page was built for publication: Postponement, conservation and preservation of strong normalization for generalized reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4522334)