scientific article; zbMATH DE number 1499097
From MaRDI portal
Publication:4501151
zbMath0964.03528MaRDI QIDQ4501151
Publication date: 3 September 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)
Related Items (9)
Strong normalization from weak normalization in typed \(\lambda\)-calculi ⋮ A prismoid framework for languages with resources ⋮ Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus ⋮ 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 ⋮ On the longest perpetual reductions in orthogonal expression reduction systems ⋮ Perpetual reductions in \(\lambda\)-calculus ⋮ Perpetuality and uniform normalization in orthogonal rewrite systems ⋮ Effective longest and infinite reduction paths in untyped λ-calculi
This page was built for publication:
