219 search results - page 24 / 44 » dagstuhl 2006 |
DAGSTUHL
2006
13 years 10 months ago
2006
We motivate and define a category of topological domains, whose objects are certain topological spaces, generalising the usual -continuous dcppos of domain theory. Our category su...
DAGSTUHL
2006
13 years 10 months ago
2006
In 1998 a survey was published on the extent to which software engineering papers validate the claims made in those papers. The survey looked at publications in 1985, 1990 and 1995...
DAGSTUHL
2006
13 years 10 months ago
2006
This paper applies a mix of aspect-oriented programming (AOP) and logic meta-programming (LMP) to tackle some concerns of/in legacy environments. We present four different problem...
DAGSTUHL
2006
13 years 10 months ago
2006
We consider the power of single level circuits in the context of graph complexity. We first prove that the single level conjecture fails for fanin-2 circuits over the basis {, , 1...
DAGSTUHL
2006
13 years 10 months ago
2006
Mundici considered the question of whether the interpolant of two propositional formulas of the form F G can always have a short circuit description, and showed that if this is t...