Sign in

On Upper Bounds on the Church-Rosser Theorem

By Ken-Etsu Fujita at
LogoGunma University
The Church-Rosser theorem in the type-free lambda-calculus is well investigated both for beta-equality and beta-reduction. We provide a new proof of the theorem for beta-equality with no use of parallel reductions, but simply with Takahashi's translation (Gross-Knuth strategy). Based on this, upper bounds for reduction sequences on the theorem are... Show more
January 3, 2017
=
0
Loading PDF…
Loading full text...
Similar articles
Loading recommendations...
=
0
x1
On Upper Bounds on the Church-Rosser Theorem
Click on play to start listening