graph-rewriting-ski: Two evalutors of the SKI combinator calculus as interactive graph rewrite systems

[ application, bsd3, compilers-interpreters, program ] [ Propose Tags ]

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.


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS] 0.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, 0.6.6, 0.6.7
Dependencies base (>=4.3 && <4.10), base-unicode-symbols (>=0.2 && <0.3), GLUT (>=2.4 && <2.8), graph-rewriting (>=0.7.6), graph-rewriting-gl (>=0.7.6), graph-rewriting-layout (>=0.5.4), OpenGL (>=3.0 && <3.1), parsec (>=3.1.0 && <3.2) [details]
License BSD-3-Clause
Copyright (c) 2010, Jan Rochel
Author Jan Rochel
Category Compilers/Interpreters, Application
Home page
Uploaded by JanRochel at 2017-05-23T14:53:53Z
Reverse Dependencies 1 direct, 0 indirect [details]
Executables ski-direct, ski-inet
Downloads 13528 total (23 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
Last success reported on 2017-05-23 [all 3 reports]