Sciweavers

2944 search results - page 335 / 589
» On Well Quasi-orders on Languages
Sort
View
SIGMOD
2007
ACM
128views Database» more  SIGMOD 2007»
16 years 6 months ago
A SQL: 1999 code generator for the pathfinder xquery compiler
The Pathfinder XQuery compiler has been enhanced by a new code generator that can target any SQL:1999-compliant relational database system (RDBMS). This code generator marks an im...
Torsten Grust, Manuel Mayr, Jan Rittinger, Sherif ...
ICFP
2007
ACM
16 years 6 months ago
Feedback directed implicit parallelism
In this paper we present an automated way of using spare CPU resources within a shared memory multi-processor or multi-core machine. Our approach is (i) to profile the execution o...
Tim Harris, Satnam Singh
ICFP
2005
ACM
16 years 6 months ago
Type inference, principal typings, and let-polymorphism for first-class mixin modules
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
Henning Makholm, J. B. Wells
AOSD
2009
ACM
16 years 1 months ago
Dependent advice: a general approach to optimizing history-based aspects
Many aspects for runtime monitoring are history-based: they contain pieces of advice that execute conditionally, based on the observed execution history. History-based aspects are...
Eric Bodden, Feng Chen, Grigore Rosu
SENSYS
2009
ACM
16 years 1 months ago
Evaluating a BASIC approach to sensor network node programming
Sensor networks have the potential to empower domain experts from a wide range of fields. However, presently they are notoriously difficult for these domain experts to program, ...
J. Scott Miller, Peter A. Dinda, Robert P. Dick