2016/04/05 by Bartek Klin, Michał Szynwelski
Computer Science · #cs.LO #cs.PL
paper · pdf · doi:10.4204/eptcs.207.3
published as EPTCS 207, 2016, pp. 57-75 · In Proceedings MSFP 2016, arXiv:1604.00384
arxiv created 2016/04/05 · arxiv updated 2016/04/06
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.