662 search results - page 65 / 133 » Trees, Automata and XML |
165
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
151
Voted
IS
2010
15 years 4 months ago
2010
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
131
click to vote
SETN
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we propose an automatic mechanism for annotating XML documents. This mechanism relies on a simple data model whose main features are: (1) a modeling of XML documents ...
180
click to vote
CDVE
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. XML documents are increasingly being used to mark up various kinds of data from web content to scientific data. Often these documents need to be collaboratively created a...
171
click to vote
WOLLIC
2009
Springer
16 years 21 days ago
2009
Springer
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...