4743 search results - page 201 / 949 » Introduction to Functional Programming |
133
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We show that linear probing requires 5-independent hash functions for expected constant-time performance, matching an upper bound of [Pagh et al. STOC’07]. For (1 + ε)-approxima...
149
click to vote
PEPM
2009
ACM
16 years 3 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...
171
Voted
GI
2009
Springer
15 years 11 months ago
2009
Springer
: Almost ten years ago, Ralf Hinze has written a functional pearl on how to derive backtracking functionality for the purely functional programming language Haskell. In these notes...
156
click to vote
ICFP
1999
ACM
15 years 10 months ago
1999
ACM
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...
182
Voted
PLILP
1997
Springer
15 years 10 months ago
1997
Springer
We introduce a framework for managing as a whole the space of a narrowing computation. The aim of our framework is to find a finite representation of an infinite narrowing space...