1999 search results - page 75 / 400 » Dependently Typed Grammars |
146
click to vote
FOSSACS
2004
Springer
15 years 11 months ago
2004
Springer
Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down system...
155
click to vote
CSL
2004
Springer
15 years 11 months ago
2004
Springer
Subtyping rules can be fairly complex for union types, due to interactions with other types, such as function types. Furthermore, these interactions turn out to depend on the calc...
134
click to vote
DCC
2007
IEEE
16 years 5 months ago
2007
IEEE
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
157
click to vote
FOIS
2010
15 years 7 months ago
2010
In a series of publications, we have employed ontological theories and principles used to evaluate and improve the quality of conceptual modeling grammars and models. In this artic...
159
click to vote
ACL
1998
15 years 7 months ago
1998
In orderto realize their full potential, multimodalsystems need to support not just input from multiple modes, but also synchronized integration of modes. Johnston et al (1997) mo...