The local-search package

[Tags: gpl, library]

This library represents a first attempt at creating a generalised library for local (non-exhaustive) search in Haskell. It is based on work presented to IFL2010, a draft of which is currently available on the homepage. The library models local search space using a rose tree, with child nodes forming the neighbourhood of any solution. The tree can then be transformed by various combinators to implement different searching strategies; the result is then navigated to yield a sequence of solutions.


Versions0.0.1, 0.0.2, 0.0.3, 0.0.5, 0.0.6, 0.0.7
Change logNone available
Dependenciesbase (>=2.0 && <=5), containers (>=, random (>= [details]
CopyrightCopyright (c) 2010 Richard Senington
AuthorRichard Senington & David Duke
CategoryControl, Optimisation, Local Search
Home page
UploadedTue Sep 7 15:51:35 UTC 2010 by RichardSenington
Downloads957 total (40 in last 30 days)
0 []
StatusDocs not available [build log]
Last success reported on 2015-06-04 [all 2 reports]



Maintainers' corner

For package maintainers and hackage trustees