Sciweavers

133 search results - page 14 / 27
» Benchmarking Implementations of Lazy Functional Languages
Sort
View
FPCA
1995
13 years 11 months ago
Once Upon a Type
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...
David N. Turner, Philip Wadler, Christian Mossin
PEPM
2004
ACM
14 years 1 months ago
Dynamic slicing based on redex trails
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 ...
Claudio Ochoa, Josep Silva, Germán Vidal
AFP
2004
Springer
14 years 1 months ago
A Functional Shell That Operates on Typed and Compiled Applications
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, ...
Rinus Plasmeijer, Arjen van Weelden
PPOPP
2003
ACM
14 years 29 days ago
The design and implementation of a parallel array operator for the arbitrary remapping of data
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...
Steven J. Deitz, Bradford L. Chamberlain, Sung-Eun...
IPPS
2006
IEEE
14 years 1 months ago
TPCC-UVa: an open-source TPC-C implementation for parallel and distributed systems
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...
Diego R. Llanos Ferraris, Belén Palop