scientific article
From MaRDI portal
Publication:3127078
zbMath0864.68053MaRDI QIDQ3127078
Publication date: 3 April 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42)
Related Items
Higher-order interpretations and program complexity ⋮ Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding ⋮ Size-based termination of higher-order rewriting ⋮ Normal Higher-Order Termination ⋮ Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility ⋮ The Computability Path Ordering: The End of a Quest ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the longest perpetual reductions in orthogonal expression reduction systems ⋮ An arithmetic for non-size-increasing polynomial-time computation ⋮ Perpetual reductions in \(\lambda\)-calculus
