8766 search results - page 694 / 1754 » Functional logic programming |
159
click to vote
ICFP
1999
ACM
15 years 10 months ago
1999
ACM
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...
193
click to vote
PEPM
1994
ACM
15 years 10 months ago
1994
ACM
One of the most novel features in the functional programming language Haskell is the system of type classes used to support a combination of overloading and polymorphism. Current ...
199
click to vote
AIPS
2006
15 years 8 months ago
2006
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
158
click to vote
NIPS
2000
15 years 7 months ago
2000
We propose a method of approximate dynamic programming for Markov decision processes (MDPs) using algebraic decision diagrams (ADDs). We produce near-optimal value functions and p...
281
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...