4835 search results - page 410 / 967 » Refactoring Functional Programs |
221
click to vote
ICFP
2007
ACM
16 years 7 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 ...
240
click to vote
HASKELL
2009
ACM
16 years 2 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...
337
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
In PLT Scheme, programs consist of modules with contracts. The latter describe the inputs and outputs of functions and objects via predicates. A run-time system enforces these pre...
283
Voted
POPL
2003
ACM
16 years 7 months ago
2003
ACM
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
314
click to vote
POPL
2003
ACM
16 years 7 months ago
2003
ACM
We introduce a notion of guarded recursive (g.r.) datatype constructors, generalizing the notion of recursive datatypes in functional programming languages such as ML and Haskell....