scientific article; zbMATH DE number 996558

zbMATH Open0864.68053MaRDI QIDQ3127078FDOQ3127078

Jaco van de Pol

Publication date: 3 April 1997

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

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42)

Cited In (11)

• Title not available (Why is that?)
• Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding
• The Computability Path Ordering: The End of a Quest
• Higher-order interpretations and program complexity
• Size-based termination of higher-order rewriting
• Perpetual reductions in \(\lambda\)-calculus
• Normal Higher-Order Termination
• On the longest perpetual reductions in orthogonal expression reduction systems
• Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
• Title not available (Why is that?)
• An arithmetic for non-size-increasing polynomial-time computation

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 Q3127078)