Sciweavers

7092 search results - page 649 / 1419
» Parallelizing constraint programs
Sort
View
168
Voted
JFP
2000
163views more  JFP 2000»
15 years 6 months ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini
PLDI
2005
ACM
15 years 12 months ago
Programming ad-hoc networks of mobile and resource-constrained devices
Ad-hoc networks of mobile devices such as smart phones and PDAs represent a new and exciting distributed system architecture. Building distributed applications on such an architec...
Yang Ni, Ulrich Kremer, Adrian Stere, Liviu Iftode
IJCAI
2001
15 years 7 months ago
Executing Reactive, Model-based Programs through Graph-based Temporal Planning
In the future, webs of unmanned air and space vehicles will act together to robustly perform elaborate missions in uncertain environments. We coordinate these systems by introduci...
Phil Kim, Brian C. Williams, Mark Abramson
AAAI
2008
15 years 7 months ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor
ICFP
2010
ACM
15 years 7 months ago
Instance chains: type class programming without overlapping instances
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...
J. Garrett Morris, Mark P. Jones