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. |
ArXived at: https://dx.doi.org/10.4204/EPTCS.207.3 | bibtex | |
Comments and questions to: eptcs@eptcs.org |
For website issues: webmaster@eptcs.org |