SMT Solving for Functional Programming over Infinite Structures

Bartek Klin
(University of Warsaw)
Michał Szynwelski
(University of Warsaw)

We develop a simple functional programming language aimed at manipulating infinite, but first-order definable structures, such as the countably infinite clique graph or the set of all intervals with rational endpoints. Internally, such sets are represented by logical formulas that define them, and an external satisfiability modulo theories (SMT) solver is regularly run by the interpreter to check their basic properties.

The language is implemented as a Haskell module.

In Robert Atkey and Neelakantan Krishnaswami: Proceedings 6th Workshop on Mathematically Structured Functional Programming (MSFP 2016), Eindhoven, Netherlands, 8th April 2016, Electronic Proceedings in Theoretical Computer Science 207, pp. 57–75.
Published: 1st April 2016.

ArXived at: http://dx.doi.org/10.4204/EPTCS.207.3 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org