On the longest perpetual reductions in orthogonal expression reduction systems

DOI10.1016/S0304-3975(00)00372-8zbMath0989.68065MaRDI QIDQ5958775

Zurab Khasidashvili

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

calculus; rewrite systems; strong normalization; perpetual reductions

Mathematics Subject Classification ID

68Q42: Grammars and rewriting systems

Related Items

Combinatory reduction systems: Introduction and survey, Perpetuality and uniform normalization in orthogonal rewrite systems

Cites Work

• Orderings for term-rewriting systems
• On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Computing in systems described by equations
• Semantical analysis of perpetual strategies in \(\lambda\)-calculus
• Perpetual reductions in \(\lambda\)-calculus
• Combinatory reduction systems: Introduction and survey
• An equivalence between lambda- terms
• The ant-lion paradigm for strong normalization
• Strong normalization from weak normalization in typed \(\lambda\)-calculi
• Perpetuality and uniform normalization in orthogonal rewrite systems
• A direct proof of the finite developments theorem
• Postponement, conservation and preservation of strong normalization for generalized reduction
• Finite family developments
• Optimal normalization in orthogonal term rewriting systems
• Polynomial time termination and constraint satisfaction tests
• Some Properties of Conversion
• The Clausal Theory of Types
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item