759 search results - page 13 / 152 » Overlap-Free Regular Languages |
ICFP
2004
ACM
14 years 8 months ago
2004
ACM
We extend Haskell with regular expression patterns. Regular expression patterns provide means for matching and extracting data which goes well beyond ordinary pattern matching as ...
POPL
2006
ACM
14 years 8 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...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
This paper studies the problem of matching sequences against regular expressions in order to produce structured values.
COLING
2010
13 years 3 months ago
2010
The Varro toolkit is a system for identifying and counting a major class of regularity in treebanks and annotated natural language data in the form of treestructures: frequently r...
CSL
2001
Springer
14 years 29 days 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...