graph-rewriting-ww 0.1 → 0.2

raw patch · 6 files changed

+13/−4 lines, 6 filesdep ~base

Dependency ranges changed: base

Files

• examples/2times2.l +2/−1
• examples/asperti_guerrini_p14.l +1/−0
• examples/qp.l +3/−0
• examples/qq.l +3/−0
• examples/trivial_dup.l +1/−0
• graph-rewriting-ww.cabal +3/−3

@@ -1,1 +1,2 @@-(\x. \y. x(x y)) (\x. \y. x(x y))+let two = λx. λy. x (x y)+in two two

@@ -0,0 +1,1 @@+(λx. x (λi. i)) λy. (λd. d d) (y z)

@@ -0,0 +1,3 @@+(λx.(λy.((λf.((λh.(h(λp.(h(λq.p)))))+              (λl.(((f(λn.(l n))) x) y))))+         (λg.(λu.(λv.((g u) (g v))))))))

@@ -0,0 +1,3 @@+(λx.(λy.((λf.((λh.(h(λp.(h(λq.q)))))+              (λl.(((f(λn.(l n))) x) y))))+         (λg.(λu.(λv.((g u) (g v))))))))

@@ -0,0 +1,1 @@+(λd. d d)((λi. i) x)

@@ -1,5 +1,5 @@ Name:           graph-rewriting-ww-Version:        0.1+Version:        0.2 Copyright:      (c) 2010, Jan Rochel License:        BSD3 License-File:   LICENSE@@ -9,7 +9,7 @@ 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 explicitely render sharing (and unsharing) according to Wadsworth's approach.+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@@ -17,7 +17,7 @@ Executable ww   Main-Is:        Main.hs   Build-Depends:-    base >= 4 && < 4.5,+    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,