“Politeness for the Theory of Algebraic Datatypes” by Ying Sheng, Yoni Zohar, Christophe Ringeissen, Jane Lange, Pascal Fontaine, and Clark Barrett. In Proceedings of the 10^th International Joint Conference on Automated Reasoning (IJCAR '20), (Nicolas Peltier and Viorica Sofronie-Stokkermans, eds.), July 2020, pp. 238-255. Best Paper Award.
Algebraic datatypes, and among them lists and trees, have attracted a lot of interest in automated reasoning and Satisfiability Modulo Theories (SMT). Since its latest stable version, the SMT-LIB standard defines a theory of algebraic datatypes, which is currently supported by several mainstream SMT solvers. In this paper, we study this particular theory of datatypes and prove that it is strongly polite, showing also how it can be combined with other arbitrary disjoint theories using polite combination. Our results cover both inductive and finite datatypes, as well as their union. The combination method uses a new, simple, and natural notion of additivity, that enables deducing strong politeness from (weak) politeness.
BibTeX entry:
@inproceedings{SZR+20,
author = {Ying Sheng and Yoni Zohar and Christophe Ringeissen and Jane
Lange and Pascal Fontaine and Clark Barrett},
editor = {Nicolas Peltier and Viorica Sofronie-Stokkermans},
title = {Politeness for the Theory of Algebraic Datatypes},
booktitle = {Proceedings of the {\it 10^{th}} International Joint
Conference on Automated Reasoning (IJCAR '20)},
series = {Lecture Notes in Computer Science},
volume = {12166},
pages = {238--255},
publisher = {Springer International Publishing},
month = jul,
year = {2020},
isbn = {978-3-030-51074-9},
note = {{\em Best Paper Award}},
url = {http://theory.stanford.edu/~barrett/pubs/SZR+20.pdf}
}
(This webpage was created with bibtex2web.)