Polite Combination of Algebraic Datatypes
Name
10817_2022_9625_ReferencePDF.pdf
Size
659.69 KB
Format
Adobe PDF
Checksum (MD5)
627c5f5c0f629765fd6b6b3f9a64ea26
Author(s)
Sheng, Ying
Zohar, Yoni
Ringeissen, Christophe
Lange, Jane
Fontaine, Pascal
Barrett, Clark
Date Issued
May 5, 2022
Publisher
Springer Netherlands
Citation
Sheng, Ying, Zohar, Yoni, Ringeissen, Christophe, Lange, Jane, Fontaine, Pascal et al. 2022. "Polite Combination of Algebraic Datatypes."
Version
Author's final manuscript
Abstract
Abstract
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 how it can be combined with other arbitrary disjoint theories using polite combination. The combination method uses a new, simple, and natural notion of additivity that enables deducing strong politeness from (weak) politeness.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s10817-022-09625-3
