1445 search results - page 27 / 289 » Uniformly Hard Languages |
108
click to vote
DAGSTUHL
1998
15 years 1 months ago
1998
Deductive database technology represents an important step towards the goal of developing highly-declarative database programming languages. In order to make deductive databases a ...
104
click to vote
ICDT
2012
ACM
13 years 2 months ago
2012
ACM
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
CC
2006
Springer
14 years 12 months ago
2006
Springer
Variants of Kannan's Theorem are given where the circuits of the original theorem are replaced by arbitrary recursively presentable classes of languages that use advice string...
175
click to vote
POPL
2005
ACM
16 years 3 days ago
2005
ACM
As probabilistic computations play an increasing role in solving various problems, researchers have designed probabilistic languages that treat probability distributions as primit...
101
click to vote
FOSSACS
2003
Springer
15 years 5 months ago
2003
Springer
We develop a system of type assignment with intersection types, union types, indexed types, and universal and existential dependent types that is sound in a call-by-value functiona...