Sciweavers

133 search results - page 6 / 27
» Benchmarking Implementations of Lazy Functional Languages
Sort
View
IPPS
2002
IEEE
14 years 18 days ago
Implementing the NAS Benchmark MG in SAC
SAC is a purely functional array processing language designed with numerical applications in mind. It supports generic, high-level program specifications in the style of APL. How...
Clemens Grelck
ICFP
2003
ACM
14 years 7 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
PLILP
1994
Springer
13 years 11 months ago
Combining Lazy Narrowing with Disequality Constraints
Abstract. We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the lan...
Puri Arenas-Sánchez, Ana Gil-Luezas, Franci...
PADO
2001
Springer
14 years 3 days ago
Implementing Circularity Using Partial Evaluation
Complex data dependencies can often be expressed concisely by defining a variable in terms of part of its own value. Such a circular reference can be naturally expressed in a lazy...
Julia L. Lawall
PPDP
2000
Springer
13 years 11 months ago
A model for comparing the space usage of lazy evaluators
Identifying the source of space faults in functional programs is hard. The problem is compoundedas space usage can vary enormously from one implementation to another. We use a ter...
Adam Bakewell, Colin Runciman