133 search results - page 3 / 27 » Benchmarking Implementations of Lazy Functional Languages |
PSC
1992
15 years 1 months ago
1992
Abstract. This paper describes an implementation technique for Multilisp's future construct aimed at large shared-memory multiprocessors. The technique is a variant of lazy ta...
171
Voted
Book
"This book gives a practical approach to understanding implementations of non-strict functional languages using lazy graph reduction. The book is intended to be a source of pr...
IFL
1997
Springer
15 years 1 months ago
1997
Springer
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
SAC
2004
ACM
15 years 3 months ago
2004
ACM
is an abstract graph reduction machine for the implementation of lazy functional languages. Categorical multi-combinators served as a basis for the evaluation model of µΓCMC. Th...
186
click to vote
ICFP
2009
ACM
15 years 10 months ago
2009
ACM
Functional logic programming and probabilistic programming have demonstrated the broad benefits of combining laziness (non-strict evaluation with sharing of the results) with non-...