130 search results - page 3 / 26 » The Language Theory of Bounded Context-Switching |
CSL
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
ICALP
2007
Springer
13 years 12 months ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
POPL
2005
ACM
14 years 6 months ago
2005
ACM
Traditional class and object encodings are difficult to use in practical type-preserving compilers because of the complexity of the encodings. We propose a simple typed intermedia...
PLDI
1998
ACM
13 years 10 months ago
1998
ACM
We present a type-based approach to eliminating array bound checking and list tag checking by conservatively extending Standard ML with a restricted form of dependent types. This ...
EACL
1989
ACL Anthology
13 years 7 months ago
1989
ACL Anthology
In this paper we present a logical treatment of semifree word order and bounded discontinuous constituency. We extend standard feature value logics to treat word order in a single...