2864 search results - page 373 / 573 » Constraint Programming in OPL |
POPL
1997
ACM
14 years 1 months ago
1997
ACM
We investigateparametric polymorphism in message-basedconcurrentprogramming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambdacal...
ICLP
1994
Springer
14 years 1 months ago
1994
Springer
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...
POPL
1993
ACM
14 years 1 months ago
1993
ACM
We study the type inference problem for a system with type classes as in the functional programminglanguage Haskell. Type classes are an extension of ML-style polymorphismwith ove...
DAC
2009
ACM
14 years 1 months ago
2009
ACM
Power grid verification in modern integrated circuits is an integral part of early system design where adjustments can be most easily incorporated. In this work, we describe an ea...
FP
1995
14 years 21 days ago
1995
We present a type reconstruction algorithm for SCIR 10], a type system for a language with syntactic control of interference. SCIR guarantees that terms of passive type do not cau...