Sciweavers

133 search results - page 9 / 27
» Benchmarking Implementations of Lazy Functional Languages
Sort
View
PADL
2007
Springer
14 years 1 months ago
Rewriting Haskell Strings
Abstract The Haskell String type is notoriously inefficient. We introduce a new data type, ByteString, based on lazy lists of byte arrays, combining the speed benefits of strict a...
Duncan Coutts, Don Stewart, Roman Leshchinskiy
GI
2009
Springer
14 years 9 days ago
Constraint Functional Multicore Programming
: In this paper we present the concurrent constraint functional programming CCFL and an abstract machine for the evaluation of CCFL programs in a multicore environment. The source ...
Petra Hofstedt, Florian Lorenzen
ENTCS
2007
112views more  ENTCS 2007»
13 years 7 months ago
Structure and Properties of Traces for Functional Programs
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
Olaf Chitil, Yong Luo
SAS
1994
Springer
105views Formal Methods» more  SAS 1994»
13 years 11 months ago
Efficient Strictness Analysis of Haskell
Strictness analysis has been a living field of investigation since Mycroft's original work in 1980, and is getting increasingly significant with the still wider use of lazy fu...
Kristian Damm Jensen, Peter Hjæresen, Mads R...
CORR
2006
Springer
132views Education» more  CORR 2006»
13 years 7 months ago
Packrat Parsing: Simple, Powerful, Lazy, Linear Time
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford