5090 search results - page 470 / 1018 » Constructing Strategies for Programming |
198
click to vote
ICFP
2007
ACM
16 years 6 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
198
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
Implementing first-class continuations can pose a challenge if the target machine makes no provisions for accessing and re-installing the run-time stack. In this paper, we present...
220
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
225
click to vote
HASKELL
2009
ACM
16 years 1 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
196
click to vote
ICFP
2010
ACM
15 years 8 months ago
2010
ACM
In 1995, my team and I decided to create an outreach project that would use our research on functional programming to change the K-12 computer science curriculum. We had two diffe...