133 search results - page 11 / 27 » Benchmarking Implementations of Lazy Functional Languages |
PPDP
2004
Springer
14 years 1 months ago
2004
Springer
We introduce the theoretical basis for tracing lazy functional logic computations in a declarative multi-paradigm language like Curry. Tracing computations is a difficult task due...
PEPM
2010
ACM
14 years 4 months ago
2010
ACM
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
HICSS
2002
IEEE
14 years 20 days ago
2002
IEEE
With the proliferation of consumer computing devices with varied display and input characteristics, it has become desirable to develop interactive systems that are usable across m...
ML
2008
ACM
13 years 7 months ago
2008
ACM
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
HASKELL
2005
ACM
14 years 1 months ago
2005
ACM
Haskell has proved itself to be a suitable implementation language for large software projects. Nevertheless, surprisingly few graphical end-user applications have been written in...