It supports integer arithmetic, set algebra (intersection, union, difference, subset/superset), universal quantification, extensional constraints (table, regular/DFA, cost-regular), and a graph constraint library for paths, spanning trees, circuits, and connectivity — all composable and optimizable.
I built it because I wanted to express constraint problems in Clojure without leaving the language or losing composability.