Xavier Rival, Jean Goubault-Larrecq. Experiments with Finite Tree Automata in Coq. In Richard J. Boulton, Paul B. Jackson, editors, Theorem Proving in Higher Order Logics, 14th International Conference, TPHOLs 2001, Edinburgh, Scotland, UK, September 3-6, 2001, Proceedings. Volume 2152 of Lecture Notes in Computer Science, pages 362-377, Springer, 2001. [doi]
@inproceedings{RivalG01,
title = {Experiments with Finite Tree Automata in Coq},
author = {Xavier Rival and Jean Goubault-Larrecq},
year = {2001},
url = {http://link.springer.de/link/service/series/0558/bibs/2152/21520362.htm},
researchr = {https://researchr.org/publication/RivalG01},
cites = {0},
citedby = {0},
pages = {362-377},
booktitle = {Theorem Proving in Higher Order Logics, 14th International Conference, TPHOLs 2001, Edinburgh, Scotland, UK, September 3-6, 2001, Proceedings},
editor = {Richard J. Boulton and Paul B. Jackson},
volume = {2152},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-42525-X},
}