scientific article

zbMath0583.03007MaRDI QIDQ3707989

Michael Karr

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Boundednessfinite degreeChurch-Rossercommutativity among reduction relationsreductions of termsWell foundedness

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (6)

Strong normalization from weak normalization in typed \(\lambda\)-calculi ⋮ De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: The typed case ⋮ De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: the untyped case ⋮ Weak normalization implies strong normalization in a class of non-dependent pure type systems ⋮ Perpetual reductions in \(\lambda\)-calculus ⋮ Perpetuality and uniform normalization in orthogonal rewrite systems

This page was built for publication: