5090 search results - page 766 / 1018 » Constructing Strategies for Programming |
190
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
152
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
We extend Haskell with regular expression patterns. Regular expression patterns provide means for matching and extracting data which goes well beyond ordinary pattern matching as ...
157
click to vote
PPOPP
2010
ACM
16 years 3 months ago
2010
ACM
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
168
click to vote
TLDI
2009
ACM
16 years 3 months ago
2009
ACM
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
164
click to vote
TLDI
2009
ACM
16 years 3 months ago
2009
ACM
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...