98 search results - page 11 / 20 » Constraints as polymorphic connectors |
70
Voted
ICFP
2003
ACM
15 years 10 months ago
2003
ACM
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
159
click to vote
SBIA
2010
Springer
14 years 8 months ago
2010
Springer
Most of modern constraint modeling languages combine rich constraint languages with mathematical notations to tackle combinatorial optimization problems. Our purpose is to introduc...
PLDI
2005
ACM
15 years 4 months ago
2005
ACM
Concepts are an essential language feature for generic programming in the large. Concepts allow for succinct expression of constraints on type parameters of generic algorithms, en...
DKE
2010
14 years 10 months ago
2010
Workflow analysis is indispensable to capture modeling errors in workflow designs. While several workflow analysis approaches have been defined previously, these approaches do not...
PPDP
2005
Springer
15 years 4 months ago
2005
Springer
fects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type and eff...