5090 search results - page 554 / 1018 » Constructing Strategies for Programming |
154
click to vote
ICFP
2003
ACM
16 years 6 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...
166
click to vote
ICFP
2003
ACM
16 years 6 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...
190
click to vote
ESOP
2010
Springer
16 years 4 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...
175
click to vote
AOSD
2009
ACM
16 years 1 months ago
2009
ACM
ive semantics for aspect-oriented abstractions can be defined by language designers using extensible aspect compiler frameworks. However, application developers are prevented fro...
185
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
This paper considers the length-lex domain for set-variables in constraint programming which includes not only membership but also cardinality and lexicographic information. The p...