Constraints as Control

We 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.

Published in:
POPL 12: Proceedings Of The 39Th Annual Acm Sigplan-Sigact Symposium On Principles Of Programming Languages, 151-164
Presented at:
39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Philadelphia, PA, Jan 25-27, 2012
ACM Order Department, P O Box 64145, Baltimore, MD 21264 Usa

 Record created 2012-06-15, last modified 2018-03-17

Rate this document:

Rate this document:
(Not yet reviewed)