1096 search results - page 69 / 220 » Type inference for atomicity |
HOTNETS
2010
13 years 4 months ago
2010
Today's networks discriminate towards or against traffic for a wide range of reasons, and in response end users and their applications increasingly attempt to evade monitorin...
PODS
2005
ACM
14 years 9 months ago
2005
ACM
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
LOPSTR
2004
Springer
14 years 2 months ago
2004
Springer
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...
TLCA
2005
Springer
14 years 2 months ago
2005
Springer
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the firs...
CADE
1998
Springer
14 years 1 months ago
1998
Springer
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...