1204 search results - page 124 / 241 » Termination of Polynomial Programs |
92
Voted
ESOP
2010
Springer
15 years 4 months ago
2010
Springer
Parsing is an important problem in computer science and yet surprisingly little attention has been devoted to its formal verification. In this paper, we present TRX: a parser inter...
97
Voted
CAV
2008
Springer
15 years 2 months ago
2008
Springer
We propose a type system for lock-freedom in the -calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it...
90
Voted
ICFP
2010
ACM
15 years 1 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...
104
Voted
ENTCS
2008
15 years 25 days ago
2008
Graph transformation units are an approach-independent concept for programming by applying rules and imported transformation units to graphs, starting in an initial and ending in ...
151
Voted
ENTCS
2002
15 years 13 days ago
2002
The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work has illustrated the usefulness of these calculi for practical notions like the im...