Koeksal, Ali SinanKuncak, ViktorSuter, Philippe2012-06-152012-06-152012-06-15201210.1145/2103656.2103675https://infoscience.epfl.ch/handle/20.500.14299/81911WOS:000304130100014We present an extension of Scala that supports constraint programming over bounded and unbounded domains. The resulting language, Kaplan, provides the benefits of constraint programming while preserving the existing features of Scala. Kaplan integrates constraint and imperative programming by using constraints as an advanced control structure; the developers use the monadic 'for' construct to iterate over the solutions of constraints or branch on the existence of a solution. The constructs we introduce have simple semantics that can be understood as explicit enumeration of values, but are implemented more efficiently using symbolic reasoning.Constraint ProgrammingSatisfiability Modulo TheoriesExecutable SpecificationsScalaEmbedded Domain-Specific LanguagesNon-determinismAlloytext::conference output::conference proceedings::conference paper