Name:           graph-rewriting-ww
Version:        0.3.3
Copyright:      (c) 2010, Jan Rochel
License:        BSD3
License-File:   LICENSE
Author:         Jan Rochel
Maintainer:     jan@rochel.info
Homepage:       http://rochel.info/#graph-rewriting
Build-Type:     Simple
Synopsis:       Evaluator of the lambda-calculus in an interactive graph rewriting system with explicit sharing
Description:    Evaluate a given λ-term (letrecs may be used) interactively. It uses duplicators to explicitly render fully-lazy sharing according to Wadsworth's approach. The reduction rules are split into two groups, safe rules and unsafe rules, which implement the procedure for unsharing the MFE under one duplicator.
Category:       Application, Compilers/Interpreters
Cabal-Version:  >= 1.6
Data-Files:     examples/*.l

Executable ww
  Main-Is:        Main.hs
  Build-Depends:
    base >= 4 && < 4.7,
    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.6,
    OpenGL >= 2.4 && < 2.10,
    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