Verifying higher-order functions with tree automata

DOI10.1007/978-3-319-89366-2_31zbMath1504.68129MaRDI QIDQ1653017

Y. Aharonov

Publication date: 17 July 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-89366-2_31

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68N18: Functional programming and lambda calculus

68Q60: Specification and verification (program logics, model checking, etc.)

68Q42: Grammars and rewriting systems

Uses Software

• Coq