Sciweavers

2394 search results - page 23 / 479
» Implementing Mobile Haskell
Sort
View
CONPAR
1994
15 years 6 months ago
Automatic Spark Strategies and Granularity for a Parallel Functional Language Reducer
This paper considers the issue of dynamic task control in the context of a parallel Haskell implementation on the GRIP multiprocessor. For the rst time, we report the e ect of our ...
Kevin Hammond, James S. Mattson Jr., Simon L. Peyt...
127
Voted
FUIN
2006
85views more  FUIN 2006»
15 years 2 months ago
Higher Order Deforestation
Wadler's deforestation algorithm eliminates intermediate data structures from functional programs. To be suitable for inclusion in a compiler, it must terminate on all progra...
Geoff W. Hamilton
ICFP
2010
ACM
15 years 3 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
127
Voted
WOTUG
2008
15 years 3 months ago
Representation and Implementation of CSP and VCR Traces
Abstract. Communicating Sequential Processes (CSP) was developed around a formal algebra of processes and a semantics based on traces (and failures and divergences). A trace is a r...
Neil C. C. Brown, Marc L. Smith
ICFP
2003
ACM
16 years 2 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