Parameterized Abstractions for Reasoning about Algebraic Data Types

Thumbnail Image

View/Download File

Persistent link to this item

View Statistics

Journal Title

Journal ISSN

Volume Title


Parameterized Abstractions for Reasoning about Algebraic Data Types

Published Date






Reasoning about algebraic data types is an important problem for a variety of proof tasks. Recently, decision procedures have been proposed for algebraic data types that create suitable abstractions of values in the types. A class of abstractions created from catamorphism functions has been shown to be theoretically applicable to a wide variety of reasoning tasks as well as efficient in practice. However, in previous work, the decidability of catamorphism functions involving parameters in addition to the data type argument has not been studied. In this paper, we generalize certain kinds of catamorphism functions to support additional parameters. This extension, called parameterized associative-commutative catamorphisms subsumes the associative-commutative class from earlier work, widens the set of functions that are known to be decidable, and makes several practically important functions (such as forall, exists, and member) over elements of algebraic data types straightforward to express.



Associated research group: Critical Systems Research Group

Related to



Series/Report Number

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Eighth International Workshop on Constraints in Formal Verification (CFV'13)

Suggested citation

Pham, Hung T.; Whalen, Michael. (2013). Parameterized Abstractions for Reasoning about Algebraic Data Types. Retrieved from the University Digital Conservancy,

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.