4757 search results - page 491 / 952 » Monads for Functional Programming |
166
click to vote
ML
2008
ACM
15 years 6 months ago
2008
ACM
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
172
Voted
MP
2008
15 years 6 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
195
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...
167
Voted
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...
195
Voted
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...