Proving Confluence for Untyped Lambda Calculus II
Discussion of the basic idea of the Tait--Martin-Loef proof of confluence for untyped lambda calculus. Let me know any requests for what to discuss in Chapter 8!
On this page
confluence
Explore " confluence " with insightful episodes like "Proving Confluence for Untyped Lambda Calculus II", "Proving Confluence for Untyped Lambda Calculus I" and "Confluence, and its use for conversion checking" from podcasts like ""Iowa Type Theory Commute", "Iowa Type Theory Commute" and "Iowa Type Theory Commute"" and more!
Episodes (3)
Proving Confluence for Untyped Lambda Calculus I
Start of discussion on how to prove confluence for untyped lambda calculus. Also some discussion about the research community interested in confluence.
Confluence, and its use for conversion checking
The basic property of confluence of a nondeterministic reduction semantics: if from starting term t you can reach t1 and also t2 (by two finite reduction sequences), then there is some t3 to which t1 and t2 both reduce in a finite number of steps. The use of confluence for ensuring completeness of the conversion-checking algorithm that tests conversion of t1 and t2 by normalizing both terms and checking for alpha-equivalence (or maybe alpha,eta-equivalence).