8838 search results - page 1476 / 1768 » Generalizing Domain Theory |
289
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
177
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
There are now a number of bidirectional programming languages, where every program can be read both as a forward transformation mapping one data structure to another and as a reve...
174
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
Dynamic binding and delimited control are useful together in many settings, including Web applications, database cursors, and mobile code. We examine this pair of language feature...
185
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
173
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...