Verifying higher-order functions with tree automata

DOI10.1007/978-3-319-89366-2_31zbMath1504.68129OpenAlexW2767047126MaRDI 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

Formal languages and automata (68Q45) Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)

Related Items (2)

Lifting numeric relational domains to algebraic data types ⋮ Pattern eliminating transformations

Uses Software

• Coq

This page was built for publication: Verifying higher-order functions with tree automata