Sciweavers

24 search results - page 2 / 5
» Preserving Sharing in the Partial Evaluation of Lazy Functio...
Sort
View
HASKELL
2009
ACM
13 years 11 months ago
Lazy functional incremental parsing
Structured documents are commonly edited using a free-form editor. Even though every string is an acceptable input, it makes sense to maintain a structured representation of the e...
Jean-Philippe Bernardy
PADO
2001
Springer
13 years 9 months 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
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
13 years 9 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
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...
Olaf Chitil
POPL
2007
ACM
14 years 5 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
SOCO
2009
Springer
13 years 11 months ago
Lazy Composition of Representations in Java
Abstract. The separation of concerns has been a core idiom of software engineering for decades. In general, software can be decomposed properly only according to a single concern, ...
Rémi Douence, Xavier Lorca, Nicolas Loriant