graph-rewriting-ski: Two implementations of the SKI combinators as interactive graph rewrite systems

[ application, bsd3, compilers-interpreters, program ] [ Propose Tags ]
Versions 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 && <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.1 && <0.5), OpenGL (==2.4.*), parsec (==2.1.*) [details]
License BSD-3-Clause
Copyright (c) 2010, Jan Rochel
Author Jan Rochel
Category Graphs, Application
Uploaded by JanRochel at Tue Jul 20 19:54:40 UTC 2010
Distributions NixOS:0.6.7
Executables ski-direct, ski-inet
Downloads 5447 total (46 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2016-12-29 [all 6 reports]
Hackage Matrix CI

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.


Maintainer's Corner

For package maintainers and hackage trustees