Church-Rosser strategies in the lambda calculus

DOI10.1016/0304-3975(79)90004-5zbMath0404.03015OpenAlexW2107640351MaRDI QIDQ1256442

Jan Willem Klop, Jan A. Bergstra

Publication date: 1979

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/12750

zbMATH Keywords

Lambda CalculusChurch-Rosser StrategiesReduction Strategies

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (4)

One-step recurrent terms in \(\lambda\)-\(\beta\)-calculus ⋮ Perpetual reductions in \(\lambda\)-calculus ⋮ The combinator S ⋮ Effective longest and infinite reduction paths in untyped λ-calculi

Cites Work

• Tree-Manipulating Systems and Church-Rosser Theorems

This page was built for publication: Church-Rosser strategies in the lambda calculus