498 search results - page 52 / 100 » Term Rewriting |
BIRTHDAY
2010
Springer
14 years 7 months ago
2010
Springer
To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can...
LICS
2007
IEEE
15 years 4 months ago
2007
IEEE
When enriching the λ-calculus with rewriting, union types may be needed to type all strongly normalizing terms. However, with rewriting, the elimination rule (∨ E) of union typ...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
A lot of recent research has focused on the content-based dissemination of XML data. However, due to the heterogeneous data schemas used by different data publishers even for data...
167
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, Aspe...
CSL
2005
Springer
15 years 3 months ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...