Name: graph-rewriting-ww
Version: 0.2
Copyright: (c) 2010, Jan Rochel
License: BSD3
License-File: LICENSE
Author: Jan Rochel
Maintainer: jan@rochel.info
Homepage: http://rochel.info/#graph-rewriting
Stability: alpha
Build-Type: Simple
Synopsis: Interactive reduction of lambda-calculus with explicit sharing
Description: Evaluate a λ-letrec term in an interactive graph reduction system. It uses duplicators to explicitly render fully-lazy sharing according to Wadsworth's approach.
Category: Application, Compilers/Interpreters
Cabal-Version: >= 1.6
Data-Files: examples/*.l
Executable ww
Main-Is: Main.hs
Build-Depends:
base >= 4.3 && < 4.6,
base-unicode-symbols >= 0.2 && < 0.3,
graph-rewriting >= 0.7 && < 0.8,
graph-rewriting-layout >= 0.5.1 && < 0.6,
graph-rewriting-gl >= 0.6.9 && < 0.8,
parsec >= 2.1 && < 2.2,
GLUT >= 2.2 && < 2.3,
OpenGL >= 2.4 && < 2.5,
IndentParser >= 0.2 && < 0.3
Extensions:
UnicodeSyntax
FlexibleInstances
FlexibleContexts
MultiParamTypeClasses
GHC-Options: -fno-warn-duplicate-exports -fwarn-unused-binds -fwarn-unused-imports -fwarn-unused-do-bind -fwarn-wrong-do-bind -fwarn-unrecognised-pragmas
Other-Modules: GL Graph Resolver Rules Term