3440 search results - page 203 / 688 » Logics For Context-Free Languages |
206
click to vote
AML
2010
15 years 7 months ago
2010
Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'. We ext...
176
click to vote
AML
2006
15 years 7 months ago
2006
Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...
221
click to vote
RCC
2002
15 years 6 months ago
2002
In recent years Arvind's Group at MIT has shown the usefulness of term rewriting theory for the specification of processor architectures. In their approach processors specifi...
179
click to vote
CORR
2004
Springer
15 years 7 months ago
2004
Springer
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
256
click to vote
TOCL
2012
13 years 9 months ago
2012
racting these leads us to introduce the notion of a path object category. This is a relatively simple axiomatic framework, which is nonetheless sufficiently strong to allow the con...