Type parametric compilation of algebraic constraints

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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.
Original languageUnknown
Title of host publicationLecture Notes in Computer Science
EditorsLS Lopes, N Lau
PublisherSpringer
Pages201-212
Volume5816
ISBN (Print)978-3-642-04685-8
DOIs
Publication statusPublished - 1 Jan 2009
EventEPIA -
Duration: 1 Jan 2009 → …

Conference

ConferenceEPIA
Period1/01/09 → …

Cite this

Barahona, P. M. C. C. D. (2009). Type parametric compilation of algebraic constraints. In LS. Lopes, & N. Lau (Eds.), Lecture Notes in Computer Science (Vol. 5816, pp. 201-212). Springer. https://doi.org/10.1007/978-3-642-04686-5_17