Handbook of logic in computer science (vol. 2)
Linear Interpolation for the Higher-Order Matching Problem
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Higher-Order Matching and Tree Automata
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Decidability of fourth-order matching
Mathematical Structures in Computer Science
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Higher-order beta matching with solutions in long beta-eta normal form
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Higher-Order Matching, Games and Automata
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
The finitely generated types of the λ-calculus
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
A game-theoretic approach to deciding higher-order matching
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Automata and logics for words and trees over an infinite alphabet
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Higher-order matching and games
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Adding nesting structure to words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Introduction to decidability of higher-order matching
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
On nominal regular languages with binders
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
A characterisation of languages on infinite alphabets with nominal regular expressions
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Proof systems for retracts in simply typed lambda calculus
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are defined, nondeterministic and alternating. We show that the nondeterministic automata have a decidable nonemptiness problem and leave as an open question whether this is true for the alternating version. The families of trees that both kinds recognise are closed under intersection and union. To illustrate the utility of the automata, we apply them to terms of simply typed lambda calculus and provide an automata-theoretic characterisation of solutions to the higher-order matching problem.