A direct proof of the finite developments theorem

DOI10.2307/2274219zbMath0601.03001OpenAlexW2022062784MaRDI QIDQ3735687

Roel de Vrijer

Publication date: 1985

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274219

zbMATH Keywords

lambda calculusWeak Combinatory Logic

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (7)

Strong normalization from weak normalization in typed \(\lambda\)-calculi ⋮ On strong normalization and type inference in the intersection type discipline ⋮ Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus ⋮ On the longest perpetual reductions in orthogonal expression reduction systems ⋮ Perpetual reductions in \(\lambda\)-calculus ⋮ Descendants and origins in term rewriting. ⋮ Effective longest and infinite reduction paths in untyped λ-calculi

This page was built for publication: A direct proof of the finite developments theorem