Sciweavers

3691 search results - page 501 / 739
» Bayesian Logic Programs
Sort
View
174
Voted
ICFP
2002
ACM
16 years 6 months ago
Type classes with more higher-order polymorphism
We propose an extension of Haskell's type class system with bstractions in the type language. Type inference for our extension relies on a novel constrained unification proce...
Matthias Neubauer, Peter Thiemann
193
Voted
SAC
2009
ACM
16 years 1 months ago
Matching ThisType to subtyping
The notion of ThisType has been proposed to promote typesafe reuse of binary methods and recently extended to mutually recursive definitions. It is well-known, however, that This...
Chieri Saito, Atsushi Igarashi
204
Voted
SECON
2007
IEEE
16 years 29 days ago
High-Level Application Development is Realistic for Wireless Sensor Networks
—Programming Wireless Sensor Network (WSN) applications is known to be a difficult task. Part of the problem is that the resource limitations of typical WSN nodes force programm...
Marcin Karpinski, Vinny Cahill
PLDI
2004
ACM
16 years 4 days ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken
ICFEM
2004
Springer
16 years 2 days ago
Memory-Model-Sensitive Data Race Analysis
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom