Chris Eidhof wrote:
> Also, there is a paper about doing a type-safe diff in Agda,
> http://portal.acm.org/citation.cfm?id=1596614.1596624
That is locke dbehind some ridiculous paywall.
It seems the same paper is available here:
http://people.cs.uu.nl/andres/GDiff.html
Erik
--
--
On Wed, Dec 9, 2009 at 13:41, Chris Eidhof wrote:
> Also, there is a paper about doing a type-safe diff in Agda,
> http://portal.acm.org/citation.cfm?id=1596614.1596624
>
Surprisingly, the paper also discusses a comparable implementation in
Haskell.
I heard rumors that the library will be ported
Also, there is a paper about doing a type-safe diff in Agda,
http://portal.acm.org/citation.cfm?id=1596614.1596624
I heard rumors that the library will be ported to Haskell.
-chris
On 8 dec 2009, at 15:20, Bayley, Alistair wrote:
From: haskell-cafe-boun...@haskell.org
[mailto:haskell-cafe-bo
> From: haskell-cafe-boun...@haskell.org
> [mailto:haskell-cafe-boun...@haskell.org] On Behalf Of Ketil Malde
>
> Don Stewart writes:
>
>
> > http://hackage.haskell.org/package/Diff
>
> Wherein we can read:
>
> | This is an implementation of the O(ND) diff algorithm
> [...]. It is O(mn)
Don Stewart wrote:
> This looks like the paper, http://www.xmailserver.org/diff2.pdf
>
> Page 2, "The algorithm can be refined to use linear space", N and M
> appear to be the length of the sequences, D is the size of the minimum
> edit script.
T'would be lovely to have that in the docs for the
ketil:
> Don Stewart writes:
>
> >> Are there pure haskell implementations of diff and diff3 algorithms?
>
> > http://hackage.haskell.org/package/Diff
>
> Wherein we can read:
>
> | This is an implementation of the O(ND) diff algorithm [...]. It is O(mn)
> | in space.
>
> At first I thou
Don Stewart writes:
>> Are there pure haskell implementations of diff and diff3 algorithms?
> http://hackage.haskell.org/package/Diff
Wherein we can read:
| This is an implementation of the O(ND) diff algorithm [...]. It is O(mn)
| in space.
At first I thought 'N' and 'M' would be the le
asviraspossible:
> Are there pure haskell implementations of diff and diff3 algorithms. Like:
>
> > data Diff a = Deleted [a] | Common [a] | Added [a]
> >
> > diff :: Eq a => [a] -> [a] -> [Diff a]
> >
> > diff3 :: Eq a => [a] -> [a] -> [a] -> [a]
>
There's at least one on Hackage:
http://h
