Dependency Tree Automata

DOI10.1007/978-3-642-00596-1_8zbMath1234.03025OpenAlexW1718895413MaRDI QIDQ3617723

Colin Stirling

Publication date: 31 March 2009

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00596-1_8

zbMATH Keywords

tree automatatyped lambda calculusbinding terms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Combinatory logic and lambda calculus (03B40)

Related Items (1)

Automata, Logic and Games for the $$\lambda $$ -Calculus

Uses Software

• Automath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Game-Theoretic Approach to Deciding Higher-Order Matching
• Automata and Logics for Words and Trees over an Infinite Alphabet
• Adding Nesting Structure to Words
• Completeness, invariance and λ-definability
• Decidability of fourth-order matching
• Computer Science Logic
• Languages of Nested Trees

This page was built for publication: Dependency Tree Automata