Towards Static Analysis of Functional Programs Using Tree Automata Completion

DOI10.1007/978-3-319-12904-4_8zbMath1356.68131arXiv1410.2901OpenAlexW2107085277MaRDI QIDQ2945135

Thomas Genet

Publication date: 9 September 2015

Published in: Rewriting Logic and Its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.2901

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Related Items (3)

Unnamed Item ⋮ Termination criteria for tree automata completion ⋮ Pattern eliminating transformations

This page was built for publication: Towards Static Analysis of Functional Programs Using Tree Automata Completion