98 search results - page 9 / 20 » Constraints as polymorphic connectors |
118
Voted
ICFP
2008
ACM
16 years 19 days ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
100
Voted
CP
2010
Springer
14 years 11 months ago
2010
Springer
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
80
Voted
GI
2009
Springer
15 years 5 months ago
2009
Springer
: In this paper we present the concurrent constraint functional programming CCFL and an abstract machine for the evaluation of CCFL programs in a multicore environment. The source ...
133
Voted
POPL
1998
ACM
15 years 4 months ago
1998
ACM
constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate o...
114
click to vote
TCS
2010
14 years 11 months ago
2010
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of...