110 search results - page 22 / 22 » Restrictions on Tree Adjoining Languages |
ASPLOS
2011
ACM
12 years 8 months ago
2011
ACM
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
ct The backbone of the XML data model, namely ordered, unranked trees, is inherently recursive and it is natural to equip the associated languages with constructs that can query su...
ICALP
2010
Springer
13 years 8 months ago
2010
Springer
A data structure is presented for the Mergeable Dictionary abstract data type, which supports the following operations on a collection of disjoint sets of totally ordered data: Pr...
KBSE
2009
IEEE
13 years 11 months ago
2009
IEEE
—The widely used C preprocessor (CPP) is generally considered a source of difficulty for understanding and maintaining C/C++ programs. The main reason for this difficulty is CP...
ENTCS
2007
13 years 4 months ago
2007
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...