scientific article; zbMATH DE number 1499097

MaRDI QIDQ4501151zbMATH OpenFDO

Authors Zurab Khasidashvili

Publication date 3 September 2000

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70)

Recommendations

• On the longest perpetual reductions in orthogonal expression reduction systems
• Perpetuality and uniform normalization in orthogonal rewrite systems
• scientific article; zbMATH DE number 1088031
• Effective longest and infinite reduction paths in untyped λ-calculi
• Optimal normalization in orthogonal term rewriting systems

Cited in

(11)

• Perpetuality and uniform normalization in orthogonal rewrite systems
• A Note on Shortest Developments
• Effective longest and infinite reduction paths in untyped λ-calculi
• Least upper bounds on the size of Church-Rosser diagrams in term rewriting and \(\lambda \)-calculus
• Perpetual reductions in -calculus
• On the longest perpetual reductions in orthogonal expression reduction systems
• 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
• Strong normalization from weak normalization in typed \(\lambda\)-calculi
• The geometry of orthogonal reduction spaces
• A prismoid framework for languages with resources

This page was built for publication:

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