3591 search results - page 55 / 719 » Typing linear constraints |
APPROX
2010
Springer
14 years 10 days ago
2010
Springer
We study constraint satisfaction problems on the domain {-1, 1}, where the given constraints are homogeneous linear threshold predicates. That is, predicates of the form sgn(w1x1 +...
ESOP
2009
Springer
14 years 5 months ago
2009
Springer
We present a type theory for analyzing concurrent multiparty interactions as found in service-oriented computing. Our theory introduces a novel and flexible type structure, able t...
DBPL
2007
Springer
14 years 2 months ago
2007
Springer
Inclusion between XML types is important but expensive, and is much more expensive when unordered types are considered. We prove here that inclusion for XML types with interleavin...
ESOP
2009
Springer
14 years 2 months ago
2009
Springer
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
APAL
2000
13 years 10 months ago
2000
It is shown how to restrict recursion on notation in all finite types so as to characterize the polynomial time computable functions. The restrictions are obtained by using a rami...