432 search results - page 31 / 87 » On Notions of Regularity for Data Languages |
SAC
2004
ACM
14 years 1 months ago
2004
ACM
This paper describes wildcards, a new language construct designed to increase the flexibility of object-oriented type systems with parameterized classes. Based on the notion of v...
MCMASTER
1993
13 years 11 months ago
1993
With the recent advances in massively parallel programmable processor networks, methods for the infusion of massive MIMD parallelism into programs have become increasingly relevant...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
We introduce the problem of grammar mining, where patterns are context-free grammars, as a generalization of a large number of common pattern mining tasks, such as tree, sequence ...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We describe SAFL, a call-by-value first-order functional language which is syntactically restricted so that storage may be statically allocated to fixed locations. Evalua...
EUROCOLT
1997
Springer
13 years 11 months ago
1997
Springer
The approach of ordinal mind change complexity, introduced by Freivalds and Smith, uses (notations for) constructive ordinals to bound the number of mind changes made by a learnin...