The graph-rewriting-ski package

[Tags: bsd3, program]

This package serves as an example for how to use the graph-rewriting, graph-rewriting-layout, and graph-rewriting-gl packages to create a graph rewriting system with an interactive, graphical front-end. The SKI combinator calculus is implemented once as an interaction net with combinators that accumulate their arguments, and once in a more direct manner. The sources (of the interaction net implementation) are well documented and serve as a tutorial for implementing your own rewrite system. Start reading in INet/Graph.hs. To run the program run either the ski-inet or the ski-direct command with one of the files in the examples directory as an argument.

Properties

Versions0.4.3, 0.4.4, 0.4.5, 0.4.7, 0.5, 0.5.1, 0.5.2, 0.5.4, 0.5.6, 0.5.7, 0.6.1, 0.6.2, 0.6.3, 0.6.4
Change logNone available
Dependenciesbase (>=4 && <4.3), base-unicode-symbols (==0.2.*), GLUT (==2.2.*), graph-rewriting (>=0.4.4 && <0.5), graph-rewriting-gl (==0.6.*), graph-rewriting-layout (>=0.4.2 && <0.5), OpenGL (==2.4.*), parsec (==2.1.*) [details]
LicenseBSD3
Copyright(c) 2010, Jan Rochel
AuthorJan Rochel
Maintainerjan@rochel.info
Stabilitybeta
CategoryGraphs, Application
Executablesski-direct, ski-inet
UploadedWed Jul 21 07:35:56 UTC 2010 by JanRochel
DistributionsNixOS:0.6.4
Downloads1826 total (96 in last 30 days)
Votes
0 []
StatusDocs not available [build log]
All reported builds failed as of 2015-05-29 [all 1 reports]

Downloads

Maintainers' corner

For package maintainers and hackage trustees