15 search results - page 2 / 3 » Modular Compilers Based on Monad Transformers |
GI
2009
Springer
13 years 10 months ago
2009
Springer
: Almost ten years ago, Ralf Hinze has written a functional pearl on how to derive backtracking functionality for the purely functional programming language Haskell. In these notes...
ENTCS
2002
13 years 5 months ago
2002
We present a Language Prototyping System that facilitates the modular development of interpreters from independent semantic buildks. The abstract syntax is modelled as the fixpoint...
SAC
2005
ACM
13 years 10 months ago
2005
ACM
During language evolution, compiler construction is usually d along two dimensions: defining new abstract syntax tree (AST) classes, or adding new operations. In order to facilita...
PLDI
2012
ACM
11 years 7 months ago
2012
ACM
To report a compiler bug, one must often find a small test case that triggers the bug. The existing approach to automated test-case reduction, delta debugging, works by removing ...
ICFP
1997
ACM
13 years 9 months ago
1997
ACM
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...