348 search results - page 23 / 70 » Using Case-Based Reasoning to Write Constraint Programs |
119
click to vote
ICLP
2003
Springer
15 years 6 months ago
2003
Springer
Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in...
HASKELL
2007
ACM
15 years 5 months ago
2007
ACM
Quasiquoting allows programmers to use domain specific syntax to construct program fragments. By providing concrete syntax for complex data types, programs become easier to read, ...
132
click to vote
SIGSOFT
2010
ACM
14 years 11 months ago
2010
ACM
The definition of a data structure may permit many different concrete representations of the same logical content. A (client) program that accepts such a data structure as input i...
133
click to vote
ICFP
2005
ACM
16 years 1 months ago
2005
ACM
A limited form of dependent types, called Generalized Algebraic Data Types (GADTs), has recently been added to the list of Haskell extensions supported by the Glasgow Haskell Comp...
206
click to vote
ICLP
2009
Springer
16 years 1 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...