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 with rules that consume all the arguments at once. 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 with one of the files from the examples directory as an argument. For usage of the GUI see GraphRewriting.GL.UI.


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, 0.6.5
Change logNone available
Dependenciesbase (>=4.3 && <4.9), base-unicode-symbols (==0.2.*), GLUT (>=2.4 && <2.10), graph-rewriting (>=0.7.6 && <0.8), graph-rewriting-gl (>=0.7.6 && <0.8), graph-rewriting-layout (>=0.5.4 && <0.6), OpenGL (==3.*), parsec (==3.1.*) [details]
Copyright(c) 2010, Jan Rochel
AuthorJan Rochel
CategoryCompilers/Interpreters, Application
Home page
Executablesski-direct, ski-inet
UploadedFri Feb 5 22:54:03 UTC 2016 by JanRochel
Downloads2461 total (31 in last 30 days)
0 []
StatusDocs not available [build log]
Last success reported on 2016-02-12 [all 1 reports]


Maintainers' corner

For package maintainers and hackage trustees