1242 search results - page 76 / 249 » The Theory of Grammar Constraints |
270
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
164
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
170
click to vote
CATS
2007
15 years 7 months ago
2007
In order to represent, compute and reason with advanced data types one must go beyond the traditional treatment of data types as being inductive types and, instead, consider them ...
167
click to vote
ACL
2006
15 years 7 months ago
2006
We present an elegant and extensible model that is capable of providing semantic interpretations for an unusually wide range of textual tables in documents. Unlike the few existin...
158
click to vote
COLING
1992
15 years 7 months ago
1992
This paper presents a direct implementation of Government-Binding theory in a parser for German, which faithfully models the modular structure of the theory. The modular design yi...