Abstract
Regular trees are potentially infinite trees such that the set of distinct subtrees is finite. This paper describes an implementation of regular trees in dependent type theory. Regular trees are semantically characterised as a coinductive type and syntactically as a nested datatype. We show how tree transducers can be used to define regular tree homomorphisms by guarded corecursion. Finally, we give examples on how transducers are used to obtain decidability of properties over regular trees. All results have been mechanized in the proof assistant Coq.
Cite
CITATION STYLE
Spadotti, R. (2015). A mechanized theory of regular trees in dependent type theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9236, pp. 405–420). Springer Verlag. https://doi.org/10.1007/978-3-319-22102-1_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
