Hello Simon,
Thursday, October 11, 2007, 1:42:31 PM, you wrote:
For various applications (including identifying common
sub-expressions, and version tracking in GHC), I'd like a Haskell
library that supports simple fingerprint operations.
lots of hash-related links was collected at
Simon Peyton Jones writes:
We are all familiar with the idea of an MD5 checksum, which provides a
reliable fingerprint for a file, usually 128 bits or so...
For various applications (including identifying common sub-expressions, and
version tracking in GHC), I'd like a Haskell library
Neil Mitchell wrote:
Hi Simon,
We are all familiar with the idea of an MD5 checksum, which provides a reliable
fingerprint for a file, usually 128 bits or so. If the file changes, the
fingerprint is (almost) certain to do so too. There are lots of techniques: CRC, shar?,
MD5, etc.
I
Dear Haskellers
Here's a challenge.
We are all familiar with the idea of an MD5 checksum, which provides a reliable
fingerprint for a file, usually 128 bits or so. If the file changes, the
fingerprint is (almost) certain to do so too. There are lots of techniques:
CRC, shar?, MD5, etc.
For
Hi Simon,
We are all familiar with the idea of an MD5 checksum, which provides a
reliable fingerprint for a file, usually 128 bits or so. If the file
changes, the fingerprint is (almost) certain to do so too. There are lots of
techniques: CRC, shar?, MD5, etc.
I believe the basic
If compositionality is important, at least Rabin's fingerprints are
worth considering: http://citeseer.ist.psu.edu/broder93some.html
They have the neat property that the fingerprint of a concatenation of
strings can be cheaply computed from the fingerprints of the
constituents. I think this
gives no comparison with other fingerprinting schemes.
Simon
| -Original Message-
| From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of Lauri Alanko
| Sent: 11 October 2007 11:27
| To: haskell
| Subject: Re: [Haskell] Fingerprints and hashing
|
| If compositionality is important
On Thu, 2007-10-11 at 12:28 +0100, Simon Peyton-Jones wrote:
Interesting! The associativity property is the kind of thing I was after.
Except that I don't really care if FP(as ++ bs) = FP(as) `plusFP` FP(bs). I
only care that the latter is robust in the sense of having low probabilty of
| To: haskell
| Subject: Re: [Haskell] Fingerprints and hashing
|
| If compositionality is important, at least Rabin's fingerprints are
| worth considering: http://citeseer.ist.psu.edu/broder93some.html
|
| They have the neat property that the fingerprint of a concatenation of
| strings can
Message-
| From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of Lauri Alanko
| Sent: 11 October 2007 11:27
| To: haskell
| Subject: Re: [Haskell] Fingerprints and hashing
|
| If compositionality is important, at least Rabin's fingerprints are
| worth considering: http
10 matches
Mail list logo
