Sciweavers

5056 search results - page 704 / 1012
» Network Coding Theory
Sort
View
ICFP
2007
ACM
16 years 6 months ago
Type-safe higher-order channels in ML-like languages
As a means of transmitting not only data but also code encapsulated within functions, higher-order channels provide an advanced form of task parallelism in parallel computations. ...
Sungwoo Park
ICFP
2006
ACM
16 years 6 months ago
Design patterns as higher-order datatype-generic programs
Design patterns are reusable abstractions in object-oriented software. However, using current mainstream programming languages, these elements can only be expressed extra-linguist...
Jeremy Gibbons
ICFP
2003
ACM
16 years 6 months ago
Optimistic evaluation: an adaptive evaluation strategy for non-strict programs
Lazy programs are beautiful, but they are slow because they build many thunks. Simple measurements show that most of these thunks are unnecessary: they are in fact always evaluate...
Robert Ennals, Simon L. Peyton Jones
POPL
2010
ACM
16 years 1 months ago
Ypnos: declarative, parallel structured grid programming
A fully automatic, compiler-driven approach to parallelisation can result in unpredictable time and space costs for compiled code. On the other hand, a fully manual approach to pa...
Dominic A. Orchard, Max Bolingbroke, Alan Mycroft
162
Voted
VMCAI
2009
Springer
16 years 1 months ago
Thread-Modular Shape Analysis
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 ...
Alexey Gotsman, Josh Berdine, Byron Cook, Mooly Sa...