Effective longest and infinite reduction paths in untyped λ-calculi

DOI10.1007/3-540-61064-2_44OpenAlexW55370226MaRDI QIDQ5878916

Morten Heine B. Sørensen

Publication date: 23 February 2023

Published in: Trees in Algebra and Programming — CAAP '96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61064-2_44

zbMATH Keywords

effectivenesslambda-calculusreduction strategies

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items

Strong normalization from weak normalization in typed \(\lambda\)-calculi, Semantical analysis of perpetual strategies in \(\lambda\)-calculus, Perpetual reductions in \(\lambda\)-calculus, Perpetuality and uniform normalization in orthogonal rewrite systems

Cites Work

• Combinatory logic. With two sections by William Craig.
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Bounds for cut elimination in intuitionistic propositional logic
• Church-Rosser strategies in the lambda calculus
• An equivalence between lambda- terms
• An upper bound for reduction sequences in the typed \(\lambda\)-calculus
• A direct proof of the finite developments theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item