Sciweavers

133 search results - page 4 / 27
» Benchmarking Implementations of Lazy Functional Languages
Sort
View
ICFP
2002
ACM
14 years 7 months ago
Packrat parsing: : simple, powerful, lazy, linear time, functional pearl
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
LISP
2008
96views more  LISP 2008»
13 years 7 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
POPL
2007
ACM
14 years 8 months ago
Lazy multivariate higher-order forward-mode AD
A method is presented for computing all higher-order partial derivatives of a multivariate function Rn R. This method works by evaluating the function under a nonstandard interpre...
Barak A. Pearlmutter, Jeffrey Mark Siskind
ICFP
2010
ACM
13 years 8 months ago
Lazy tree splitting
Nested data-parallelism (NDP) is a declarative style for programming irregular parallel applications. NDP languages provide language features favoring the NDP style, efficient com...
Lars Bergstrom, Mike Rainey, John H. Reppy, Adam S...
PLANX
2008
13 years 9 months ago
XML Stream Processing Using a Lazy Concurrent Language
Motivated by previous work on XML stream processing, we noticed that programmers need concurrency to save space, especially in a lazy language. User-controllable concurrency provi...
Shin-Cheng Mu, Ta-Chung Tsai, Keisuke Nakano