Sciweavers

16 search results - page 2 / 4
» Common Subexpressions Are Uncommon in Lazy Functional Langua...
Sort
View
HASKELL
2009
ACM
15 years 6 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
ICFP
2002
ACM
15 years 11 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
HASKELL
2009
ACM
15 years 6 months ago
Types are calling conventions
It is common for compilers to derive the calling convention of a function from its type. Doing so is simple and modular but misses many optimisation opportunities, particularly in...
Maximilian C. Bolingbroke, Simon L. Peyton Jones
POPL
2010
ACM
15 years 9 months ago
A Verified Compiler for an Impure Functional Language
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
Adam J. Chlipala
CORR
2006
Springer
132views Education» more  CORR 2006»
14 years 11 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