This paper focuses on the problem of propagating constraints involving arbitrary algebraic expressions. We formally describe previous approaches to this problem and propose a new model which does not decompose the expression thus avoiding introducing auxiliary data structures. We show how this compilation model fits naturally in a popular programming language supporting type parametricity, yielding significant speedups with respect to previous models.
|Title of host publication||Lecture Notes in Computer Science|
|Editors||LS Lopes, N Lau|
|Publication status||Published - 1 Jan 2009|
|Event||EPIA - |
Duration: 1 Jan 2009 → …
|Period||1/01/09 → …|