scientific article; zbMATH DE number 996558

MaRDI QIDQ3127078zbMATH OpenFDO

Authors Jaco van de Pol

Publication date 3 April 1997

Mathematics Subject Classification ID

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

Cited in

(15)

• Perpetual reductions in -calculus
• An arithmetic for non-size-increasing polynomial-time computation
• Higher-order interpretations and program complexity
• Normal higher-order termination
• The Computability Path Ordering: The End of a Quest
• Size-based termination of higher-order rewriting
• Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding
• Polymorphic higher-order termination
• scientific article; zbMATH DE number 7566074 (Why is no real title available?)
• On the longest perpetual reductions in orthogonal expression reduction systems
• Wanda -- a higher-order termination tool (system description)
• A characterization of basic feasible functionals through higher-order rewriting and tuple interpretations
• The computability path order for beta-eta-normal higher-order rewriting
• Higher-order constrained dependency pairs for (universal) computability
• Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility

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)