4139 search results - page 289 / 828 » Designing and Implementing Combinator Languages |
146
click to vote
CICLING
2007
Springer
15 years 11 months ago
2007
Springer
Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages. The attractiveness of this technology for natural lang...
168
click to vote
OOPSLA
2007
Springer
15 years 11 months ago
2007
Springer
We apply speculative multithreading to sequential Java programs in software to achieve speedup on existing multiprocessors. A common speculation library supports both Java bytecod...
126
click to vote
PLDI
2004
ACM
15 years 10 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
126
Voted
HASKELL
2007
ACM
15 years 9 months ago
2007
ACM
Quasiquoting allows programmers to use domain specific syntax to construct program fragments. By providing concrete syntax for complex data types, programs become easier to read, ...
155
click to vote
OOPSLA
2005
Springer
15 years 10 months ago
2005
Springer
An aspect observes the execution of a base program; when certain actions occur, the aspect runs some extra code of its own. In the AspectJ language, the observations that an aspec...