UNIX 'diff' algorithm in Prolog?

Article View: comp.lang.prolog

Article #661

#661

From: Paul Singleton
Date: Wed, 19 Aug 1992 17:14

11 lines
1103 bytes

Please can someone point me towards a Prolog implementation of the UNIX
'diff' algorithm for finding ("Except in rare circumstances") a smallest
sufficient set of differences between two lists.  Or any algorithm which
does a similar job.  With or without rearrangements.  If not a Prolog
implementation, then a nice abstract description amenable to declarative
implementation.
----
  __   __    Paul Singleton (Mr)           JANET: paul@uk.ac.keele.cs
 |__) (__    Computer Science Dept.        other: paul@cs.keele.ac.uk
 |  .  __).  Keele University, Newcastle,    tel: +44 (0)782 621111 x7355
             Staffs ST5 5BG, ENGLAND         fax: +44 (0)782 713082

Technical Details

Message-ID: <3842@keele.keele.ac.uk>

Path:

arc1-ca.pugleaf.net!sparky!uunet!charon.amdahl.com!pacbell.com!mips!darwin.sura.net!Sirius.dfn.de!zrz.tu-berlin.de!news.netmbx.de!Germany.EU.net!mcsun!uknet!keele!csa09

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!charon.amdahl.com!pacbell.com!mips!darwin.sura.net!Sirius.dfn.de!zrz.tu-berlin.de!news.netmbx.de!Germany.EU.net!mcsun!uknet!keele!csa09
From: csa09@seq1.keele.ac.uk (Paul Singleton)
Newsgroups: comp.lang.prolog
Subject: UNIX 'diff' algorithm in Prolog?
Keywords: string matching
Message-ID: <3842@keele.keele.ac.uk>
Date: 19 Aug 92 17:14:32 GMT
Organization: University of Keele, England
Lines: 11