Linear depth increase of lambda terms in leftmost-outermost rewrite sequences

MaRDI QIDQ5224690zbMATH OpenFDO

Authors Clemens Grabmayer

Publication date 24 July 2019

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Grammars and rewriting systems (68Q42)

Recommendations

• (Leftmost-outermost) beta reduction is invariant, indeed
• Beta reduction is invariant, indeed
• On constructor rewrite systems and the lambda calculus
• On Constructor Rewrite Systems and the Lambda-Calculus
• Logical Approaches to Computational Barriers

Cited in

(1)

• Distribution of variables in lambda-terms with restrictions on De Bruijn indices and De Bruijn levels

This page was built for publication: Linear depth increase of lambda terms in leftmost-outermost rewrite sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224690)