34 search results - page 2 / 7 » icfp 2010 |
ICFP
2010
ACM
13 years 6 months ago
2010
ACM
Matsuda et al. [2007, ICFP] and Voigtl
ICFP
2010
ACM
13 years 6 months ago
2010
ACM
We present a technique for higher-order representation of substructural logics such as linear or modal logic. We show that such logics can be encoded in the (ordinary) Logical Fra...
ICFP
2010
ACM
13 years 6 months ago
2010
ACM
The leading implementations of graph reduction all target conventional processors designed for low-level imperative execution. In this paper, we present a processor specially desi...
ICFP
2010
ACM
13 years 6 months ago
2010
ACM
Existing macro systems force programmers to make a choice between clarity of specification and robustness. If they choose clarity, they must forgo validating significant parts of ...
ICFP
2010
ACM
13 years 6 months ago
2010
ACM
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is simil...