Sciweavers

2944 search results - page 182 / 589
» On Well Quasi-orders on Languages
Sort
View
CP
2009
Springer
16 years 7 months ago
Constraint-Based Graph Matching
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. ...
Christine Solnon, Vianney le Clément, Yves ...
ICFP
2001
ACM
16 years 6 months ago
A New Notation for Arrows
The categorical notion of monad, used by Moggi to structure denotational descriptions, has proved to be a powerful tool for structuring combinator libraries. Moreover, the monadic...
Ross Paterson
ICDT
2010
ACM
259views Database» more  ICDT 2010»
16 years 3 months ago
Forward-XPath and extended register automata on data-trees
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
Diego Figueira
ACSC
2009
IEEE
16 years 1 months ago
Evaluating the dynamic behaviour of Python applications
The Python programming language is typical among dynamic languages in that programs written in it are not susceptible to static analysis. This makes efficient static program compi...
Alex Holkner, James Harland
SAC
2009
ACM
16 years 1 months ago
Celling SHIM: compiling deterministic concurrency to a heterogeneous multicore
Parallel architectures are the way of the future, but are notoriously difficult to program. In addition to the low-level constructs they often present (e.g., locks, DMA, and non-...
Nalini Vasudevan, Stephen A. Edwards