1423 search results - page 155 / 285 » Languages of Nested Trees |
129
click to vote
CC
2002
Springer
15 years 3 months ago
2002
Springer
Abstract. This paper describes the C Intermediate Language: a highlevel representation along with a set of tools that permit easy analysis and source-to-source transformation of C ...
130
Voted
PPOPP
2009
ACM
16 years 4 months ago
2009
ACM
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
128
Voted
ICLP
2005
Springer
15 years 9 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
129
click to vote
ICALP
1990
Springer
15 years 7 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
108
click to vote
ECOOP
2006
Springer
15 years 7 months ago
2006
Springer
Object-oriented programs often require large heaps to run properly or meet performance goals. They use high-overhead collections, bulky data models, and large caches. Discovering t...