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 with one of the files from the examples directory as an argument. For usage of the GUI see GraphRewriting.GL.UI.


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
Dependenciesbase (>=4.3 && <4.5), base-unicode-symbols (==0.2.*), GLUT (==2.2.*), graph-rewriting (==0.7.*), graph-rewriting-gl (>=0.6.9 && <0.8), graph-rewriting-layout (==0.5.*), OpenGL (==2.4.*), parsec (==2.1.*)
LicenseBSD3
Copyright(c) 2010, Jan Rochel
AuthorJan Rochel
Maintainerjan@rochel.info
Stabilitybeta
CategoryCompilers/Interpreters, Application
Home pagehttp://rochel.info/#graph-rewriting
Executablesski-direct, ski-inet
Upload dateSat Jul 14 16:33:48 UTC 2012
Uploaded byJanRochel
Downloads499 total (43 in last 30 days)

Downloads

Maintainers' corner

For package maintainers and hackage trustees