1313 search results - page 222 / 263 » Prioritized Reasoning in Logic Programming |
243
Voted
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
We address how to write programs for distributed computing systems in which the network topology can change dynamically. Examples of such systems, which we call ensembles, include ...
143
Voted
ICFP
2008
ACM
16 years 3 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
111
Voted
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
Writing loops with tail-recursive function calls is the equivalent of writing them with goto's. Given that loop packages for Lisp-family languages have been around for over 2...
121
Voted
VMCAI
2009
Springer
15 years 10 months ago
2009
Springer
We present the first shape analysis for multithreaded programs that avoids the explicit enumeration of execution-interleavings. Our approach is to automatically infer a resource ...
127
Voted
ICLP
2005
Springer
15 years 9 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...