15 search results - page 2 / 3 » Purely functional lazy non-deterministic programming |
PEPM
2009
ACM
15 years 8 months ago
2009
ACM
Computation performed in many typical aspects involve side effects. In a purely functional setting, adding such aspects using techniques such as monadification will generally lea...
ML
2008
ACM
14 years 11 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...
116
Voted
ICFP
1998
ACM
15 years 3 months ago
1998
ACM
We present a purely functional implementation of the computational differentiation tools — the well known numeric (i.e., not symbolic) techniques which permit one to compute poin...
IWMM
1992
Springer
15 years 3 months ago
1992
Springer
A purely functional le system has been built on top of pure Scheme. It provides persistent structures and massive storage expected of le systems, without explicit side-e ects like ...
83
Voted
PADL
2007
Springer
15 years 5 months ago
2007
Springer
Abstract The Haskell String type is notoriously inefficient. We introduce a new data type, ByteString, based on lazy lists of byte arrays, combining the speed benefits of strict a...