3481 search results - page 402 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
182
click to vote
CAV
2008
Springer
15 years 8 months ago
2008
Springer
We consider an extension of integer linear arithmetic with a "star" operator takes closure under vector addition of the solution set of a linear arithmetic subformula. We...
319
click to vote
ICFP
2009
ACM
16 years 7 months ago
2009
ACM
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
282
click to vote
POPL
2003
ACM
16 years 7 months ago
2003
ACM
We present the design of a typed assembly language called TALT that supports heterogeneous tuples, disjoint sums, and a general account of addressing modes. TALT also implements t...
277
click to vote
POPL
2005
ACM
16 years 7 months ago
2005
ACM
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent...
171
click to vote
ACMSE
2006
ACM
15 years 10 months ago
2006
ACM
Programming paradigms are often skewed towards a particular domain of problems, thus one effective way to utilize them is through a multiparadigm approach to software development....