1143 search results - page 119 / 229 » Abstract Syntax and Logic Programming |
140
click to vote
ICALP
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
130
Voted
APLAS
2006
ACM
15 years 6 months ago
2006
ACM
Abstract. Static analyses calculate abstract states, and their logics validate properties of the abstract states. We place into perspective the variety of forwards, backwards, func...
109
click to vote
POPL
2000
ACM
15 years 7 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
217
Voted
ICFP
2009
ACM
16 years 3 months ago
2009
ACM
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
124
click to vote
LATA
2009
Springer
15 years 9 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...