graph-rewriting-ski: Implementation of the SKI combinators as an interactive graph rewriting system

[ 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 sources are well documented and can used as a tutorial for implementing your own rewrite system. Start reading in Graph.hs

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

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, 0.6.8
Dependencies base (>=4 && <4.3), base-unicode-symbols (>=0.2 && <0.3), GLUT (>=2.2 && <2.3), graph-rewriting (>=0.4.4 && <0.5), graph-rewriting-gl (>=0.5 && <0.6), graph-rewriting-layout (>=0.4.1 && <0.5), IndentParser (>=0.2 && <0.3), OpenGL (>=2.4 && <2.5), parsec (>=2.1 && <2.2) [details]
License BSD-3-Clause
Copyright (c) 2010, Jan Rochel
Author Jan Rochel
Maintainer jan@rochel.info
Category Graphs, Application
Uploaded by JanRochel at 2010-07-11T18:00:43Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Executables ski
Downloads 13560 total (35 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2016-12-29 [all 6 reports]