Higher-order matching and tree automata
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 157-176
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Linear interpolation for the higher-order matching problem1997
- Third-order matching in the polymorphic lambda calculusLecture Notes in Computer Science, 1996
- Third-order matching in the presence of type constructors1995
- Third order matching is decidableAnnals of Pure and Applied Logic, 1994
- Haskell overloading is DEXPTIME-completeInformation Processing Letters, 1994
- A Complete Proof Synthesis Method for the Cube of Type SystemsJournal of Logic and Computation, 1993
- The undecidability of pattern matching in calculi where primitive recursive functions are representableTheoretical Computer Science, 1993
- Automata on Infinite Objects1990
- The undecidability of the second-order unification problemTheoretical Computer Science, 1981