scientific article; zbMATH DE number 1499097

zbMATH Open0964.03528MaRDI QIDQ4501151FDOQ4501151

Zurab Khasidashvili

Publication date: 3 September 2000

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (9)

• Perpetuality and uniform normalization in orthogonal rewrite systems
• Effective longest and infinite reduction paths in untyped λ-calculi
• Perpetual reductions in \(\lambda\)-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
• Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus
• A prismoid framework for languages with resources

   Recommendations

• On the longest perpetual reductions in orthogonal expression reduction systems 👍 👎
• Perpetuality and uniform normalization in orthogonal rewrite systems 👍 👎
• Title not available (Why is that?) 👍 👎
• Effective longest and infinite reduction paths in untyped λ-calculi 👍 👎
• Optimal normalization in orthogonal term rewriting systems 👍 👎

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)