3713 search results - page 585 / 743 » Constructing a Calculus of Programs |
72
Voted
ICSE
2005
IEEE-ACM
15 years 10 months ago
2005
IEEE-ACM
Data structure repair is a promising technique for enabling programs to execute successfully in the presence of otherwise fatal data structure corruption errors. Previous research...
92
Voted
ICFP
2005
ACM
15 years 10 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...
74
Voted
ICFP
2004
ACM
15 years 10 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 ...
PPOPP
2010
ACM
15 years 7 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...
74
Voted
TLDI
2009
ACM
15 years 7 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...