1445 search results - page 139 / 289 » Uniformly Hard Languages |
173
click to vote
HASKELL
2009
ACM
15 years 10 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
113
click to vote
ECOOP
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. In this paper we present Jam, an extension of the Java language supporting mixins, that is, parametric heir classes. A mixin declaration in Jam is similar to a Java heir ...
150
click to vote
ISMB
1998
15 years 5 months ago
1998
Existing query interfaces for biological databases are either based on fixed forms or textual query languages. Users of a fixed form-based query interface are limited to performin...
151
click to vote
ICDT
2012
ACM
13 years 6 months ago
2012
ACM
The problems of query containment, equivalence, and minimization are recognized as very important in the context of query processing, specifically of query optimization. In their...
154
click to vote
SAT
2009
Springer
15 years 10 months ago
2009
Springer
Cryptography ensures the confidentiality and authenticity of information but often relies on unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain ...