133 search results - page 14 / 27 » Benchmarking Implementations of Lazy Functional Languages |
77
Voted
FPCA
1995
15 years 1 months ago
1995
A number of useful optimisations are enabled if we can determine when a value is accessed at most once. We extend the Hindley-Milner type system with uses, yielding a typeinferenc...
PEPM
2004
ACM
15 years 3 months ago
2004
ACM
Tracing computations is a widely used methodology for program debugging. Lazy languages, in particular, pose new demands on tracing techniques since following the actual trace of ...
AFP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Esther is the interactive shell of Famke, a prototype implementation of a strongly typed operating system written in the functional programming language Clean. As usual, ...
82
Voted
PPOPP
2003
ACM
15 years 2 months ago
2003
ACM
Gather and scatter are data redistribution functions of longstanding importance to high performance computing. In this paper, we present a highly-general array operator with power...
50
Voted
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper presents TPCC-UVa, an open-source implementation of the TPC-C benchmark intended to be used in parallel and distributed systems. TPCC-UVa is written entirely in C langu...