903 search results - page 168 / 181 » Non-well-founded trees in categories |
PODS
2006
ACM
16 years 1 months ago
2006
ACM
Given a document D in the form of an unordered labeled tree, we study the expressibility on D of various fragments of XPath, the core navigational language on XML documents. We gi...
118
Voted
ICFP
2005
ACM
16 years 1 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
111
click to vote
ICFP
2005
ACM
16 years 1 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...
104
click to vote
ICFP
2003
ACM
16 years 1 months ago
2003
ACM
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
162
click to vote
MOBIHOC
2007
ACM
16 years 1 months ago
2007
ACM
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...