74 search results - page 7 / 15 » Constructive Failure in Functional-Logic Programming: From T... |
IPPS
2000
IEEE
13 years 12 months ago
2000
IEEE
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
AISC
2010
Springer
13 years 11 months ago
2010
Springer
We prove formally that the first order theory of algebraically closed fields enjoy quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We ...
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
COLT
1994
Springer
13 years 11 months ago
1994
Springer
Inductive Logic Programming (ILP) involves the construction of first-order definite clause theories from examples and background knowledge. Unlike both traditional Machine Learnin...
OOPSLA
2005
Springer
14 years 1 months ago
2005
Springer
Representing programs as text strings makes programming harder then it has to be. The source text of a program is far removed from its behavior. Bridging this conceptual gulf is w...