14 search results - page 1 / 3 » Polymorphic regular tree types and patterns |
POPL
2006
ACM
14 years 4 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...
DBPL
2005
Springer
13 years 10 months ago
2005
Springer
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML. The flexibility of these mechanisms demands novel approaches ...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
This paper presents our compilation strategy to produce efficient code for pattern matching in the CDuce compiler, taking into account static information provided by the type syst...
FPCA
1989
13 years 8 months ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
JFP
2006
13 years 4 months ago
2006
XML data are described by types involving regular expressions. This raises the question of what language feature is convenient for manipulating such data. Previously, we have give...