graph-rewriting-lambdascope 0.5.4 → 0.5.5

raw patch · 4 files changed

+18/−7 lines, 4 filesdep ~GLUTdep ~OpenGLdep ~base

Dependency ranges changed: GLUT, OpenGL, base

Files

• Rules.hs +1/−1
• examples/test.l +10/−0
• examples/test2.l +1/−0
• graph-rewriting-lambdascope.cabal +6/−6

@@ -192,7 +192,7 @@ 			byWire i matchingport -- Attach the alternative directly to the input of the case node 			mconcat [byNode $ Eraser {inp = alts !! i} | i ← filter (/= fromJust (elemIndex n names)) [0..nn-1]] --- | Not the readback semantics as defined in the paper. Just a non semantics preserving erasure of all+-- | Not the readback semantics as defined in the paper. Just a non-semantics-preserving erasure of all -- delimiters to make the graph more readable readback ∷ (View [Port] n, View NodeLS n) ⇒ Rule n readback = do

@@ -0,0 +1,10 @@+λx. (λy. (λz. (? x) (? z)) (? y))++let+	f(z1,z2,z3) x -> g(h(z1 x, z2), z3)+	g(z1,z2) y -> z1(z2 y)+	h(z1,z2) z -> z1(z2 z)+in f(n1,n2,n3)+++λx. (λy. (λz. (n1 x) (n2 z)) (n3 y))

@@ -0,0 +1,1 @@+λx. λy. let Z = λz. n1 x (n2 z) in Z (n3 y) Z

@@ -1,5 +1,5 @@ Name:           graph-rewriting-lambdascope-Version:        0.5.4+Version:        0.5.5 Copyright:      (c) 2010, Jan Rochel License:        BSD3 License-File:   LICENSE@@ -8,8 +8,8 @@ Homepage:       http://rochel.info/#graph-rewriting Stability:      alpha Build-Type:     Simple-Synopsis:       Implementation of Lambdascope as an interactive graph-rewriting system-Description:    Lambdascope is an optimal implementation of the λβ-calculus described in the paper "Lambdascope - Another optimal implementation of the lambda-calculus" by Vincent van Oostrom, Kees-Jan van de Looij, and Marijn Zwitserlood. Call "lambdascope" with one of the files from the "examples" directory as an argument. For usage of the GUI see "GraphRewriting.GL.UI". Use the "--lmo" flag for leftmost outermost evalution and "--bench" for non-graphical evaluation to weak head normal form.+Synopsis:       Lambdascope, an optimal evaluator of the lambda calculus, as an interactive graph-rewriting system+Description:    Lambdascope is an optimal evaluator of the λβ-calculus described in the paper "Lambdascope - Another optimal implementation of the lambda-calculus" by Vincent van Oostrom, Kees-Jan van de Looij, and Marijn Zwitserlood. Call "lambdascope" with one of the files from the "examples" directory as an argument. For usage of the GUI see "GraphRewriting.GL.UI". Use the "--lmo" flag for leftmost outermost evalution and "--bench" for non-graphical evaluation to weak head normal form. Category:       Compilers/Interpreters, Application Cabal-Version:  >= 1.6 Data-Files:     examples/*.l@@ -17,15 +17,15 @@ Executable lambdascope   Main-Is:        Main.hs   Build-Depends:-    base >= 4 && < 4.6,+    base >= 4 && < 4.7,     base-unicode-symbols >= 0.2 && < 0.3,     graph-rewriting >= 0.7.1 && < 0.8,     graph-rewriting-layout >= 0.5.1 && < 0.6,     graph-rewriting-gl >= 0.7.1 && < 0.8,     graph-rewriting-strategies >= 0.2 && < 0.3,     parsec >= 2.1 && < 2.2,-    GLUT >= 2.2 && < 2.5,-    OpenGL >= 2.4 && < 2.9,+    GLUT >= 2.2 && < 2.6,+    OpenGL >= 2.4 && < 2.10,     IndentParser >= 0.2 && < 0.3   Extensions:     UnicodeSyntax