118 search results - page 21 / 24 » Constraint Functional Logic Programming over Finite Domains |
168
click to vote
POPL
2003
ACM
15 years 9 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
105
click to vote
PEPM
2011
ACM
14 years 8 days ago
2011
ACM
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
CPAIOR
2009
Springer
15 years 4 months ago
2009
Springer
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
172
click to vote
POPL
2006
ACM
15 years 9 months ago
2006
ACM
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
PLDI
2010
ACM
15 years 6 months ago
2010
ACM
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...