836 search results - page 121 / 168 » Description logic programs: combining logic programs with de... |
273
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
293
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
161
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
To improve the quality of type error messages in functional programming languages, we propose four techniques which influence the behaviour of constraint-based type inference proc...
202
click to vote
HT
2004
ACM
15 years 11 months ago
2004
ACM
In this paper, we present a model-driven methodology and toolset for automatic generation of hypertext system repositories. Our code generator, called Bamboo, is based on a Contai...
161
Voted
SIAMCOMP
2008
15 years 6 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...