Postponement, conservation and preservation of strong normalization for generalized reduction

DOI10.1093/logcom/10.5.721zbMath0969.03022OpenAlexW2091852848MaRDI QIDQ4522334

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (5)

A short proof that adding some permutation rules to \(\beta \) preserves SN ⋮ On strong normalization and type inference in the intersection type discipline ⋮ 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 ⋮ On the longest perpetual reductions in orthogonal expression reduction systems

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