Alexander Lochmann, Aart Middeldorp. Formalized Proofs of the Infinity and Normal Form Predicates in the First-Order Theory of Rewriting. In Armin Biere, David Parker 0001, editors, Tools and Algorithms for the Construction and Analysis of Systems - 26th International Conference, TACAS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings, Part II. Volume 12079 of Lecture Notes in Computer Science, pages 178-194, Springer, 2020. [doi]
@inproceedings{LochmannM20,
title = {Formalized Proofs of the Infinity and Normal Form Predicates in the First-Order Theory of Rewriting},
author = {Alexander Lochmann and Aart Middeldorp},
year = {2020},
doi = {10.1007/978-3-030-45237-7_11},
url = {https://doi.org/10.1007/978-3-030-45237-7_11},
researchr = {https://researchr.org/publication/LochmannM20},
cites = {0},
citedby = {0},
pages = {178-194},
booktitle = {Tools and Algorithms for the Construction and Analysis of Systems - 26th International Conference, TACAS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings, Part II},
editor = {Armin Biere and David Parker 0001},
volume = {12079},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-45237-7},
}