3713 search results - page 469 / 743 » Constructing a Calculus of Programs |
155
click to vote
DC
2010
15 years 4 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
108
click to vote
ICFP
2003
ACM
16 years 4 months ago
2003
ACM
We propose a type system MLFthat generalizes ML with first-class polymorphism as in System F. Expressions may contain secondorder type annotations. Every typable expression admits...
107
click to vote
ICFP
2003
ACM
16 years 4 months ago
2003
ACM
We present the derivation of a space efficient parser combinator library: the constructed parsers do not keep unnecessary references to the input, produce online results and effic...
120
click to vote
ICFP
2003
ACM
16 years 4 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...
143
click to vote
ESOP
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. This paper is concerned with testing properties of polymorphic functions. The problem is that testing can only be performed on specific monomorphic instances, whereas par...