4835 search results - page 503 / 967 » Refactoring Functional Programs |
197
click to vote
ENTCS
2007
15 years 6 months ago
2007
We present two enhancements of the functional language L which is used in the eriFun system to write programs and formulate statements about them. Context dependent procedures all...
171
click to vote
MP
2010
15 years 1 months ago
2010
We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, cons...
196
click to vote
PLDI
2011
ACM
14 years 9 months ago
2011
ACM
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
168
click to vote
ESOP
2012
Springer
14 years 2 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
241
click to vote
ICFP
2012
ACM
13 years 9 months ago
2012
ACM
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...