diff --git a/examples/case.l b/examples/case.l
deleted file mode 100644
--- a/examples/case.l
+++ /dev/null
@@ -1,6 +0,0 @@
-λx.case x of
-	Test -> 1
-	B y  -> y y
-	Cons x xs -> x xs
-	Bla       -> λy.y y
-(Cons 5 Nil)
diff --git a/examples/case/sum.l b/examples/case/sum.l
new file mode 100644
--- /dev/null
+++ b/examples/case/sum.l
@@ -0,0 +1,5 @@
+let
+	sum list = case list of
+		Nil -> 0
+		Cons z zs -> (\x.λy -> + x y) z (sum zs)
+in sum (Cons 1 (Cons 2 Nil))
diff --git a/examples/morazan-fig1.l b/examples/morazan-fig1.l
new file mode 100644
--- /dev/null
+++ b/examples/morazan-fig1.l
@@ -0,0 +1,6 @@
+let R = λx y.
+	let
+		f = R x
+		g = R y
+	in f g
+in R
diff --git a/examples/morazan-fig4.l b/examples/morazan-fig4.l
new file mode 100644
--- /dev/null
+++ b/examples/morazan-fig4.l
@@ -0,0 +1,7 @@
+let f x =
+	let
+		g = i
+		h = x
+		i = h
+	in g h
+in f
diff --git a/examples/morazan-fig6.l b/examples/morazan-fig6.l
new file mode 100644
--- /dev/null
+++ b/examples/morazan-fig6.l
@@ -0,0 +1,7 @@
+let f x y z =
+	let g a b =
+		let h c d =
+			let i e = h g in i
+		in h
+	in g
+in f
diff --git a/examples/morazan-fig8.l b/examples/morazan-fig8.l
new file mode 100644
--- /dev/null
+++ b/examples/morazan-fig8.l
@@ -0,0 +1,7 @@
+let f x y z =
+	let
+		g = x i
+		h = y f
+		i = z f g
+	in g h
+in f
diff --git a/examples/sum.l b/examples/sum.l
deleted file mode 100644
--- a/examples/sum.l
+++ /dev/null
@@ -1,5 +0,0 @@
-let
-	sum list = case list of
-		Nil -> 0
-		Cons z zs -> (\x.λy -> + x y) z (sum zs)
-in sum (Cons 1 (Cons 2 Nil))
diff --git a/examples/test.l b/examples/test.l
deleted file mode 100644
--- a/examples/test.l
+++ /dev/null
@@ -1,10 +0,0 @@
-λ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))
diff --git a/examples/test2.l b/examples/test2.l
deleted file mode 100644
--- a/examples/test2.l
+++ /dev/null
@@ -1,1 +0,0 @@
-λx. λy. let Z = λz. n1 x (n2 z) in Z (n3 y) Z
diff --git a/graph-rewriting-lambdascope.cabal b/graph-rewriting-lambdascope.cabal
--- a/graph-rewriting-lambdascope.cabal
+++ b/graph-rewriting-lambdascope.cabal
@@ -1,5 +1,5 @@
 Name:           graph-rewriting-lambdascope
-Version:        0.5.5
+Version:        0.5.6
 Copyright:      (c) 2010, Jan Rochel
 License:        BSD3
 License-File:   LICENSE
@@ -12,17 +12,17 @@
 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
+Data-Files:     examples/*.l examples/case/*.l
 
 Executable lambdascope
   Main-Is:        Main.hs
   Build-Depends:
-    base >= 4 && < 4.7,
+    base >= 4 && < 4.8,
     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,
+    graph-rewriting-strategies >= 0.2.2 && < 0.3,
     parsec >= 2.1 && < 2.2,
     GLUT >= 2.2 && < 2.6,
     OpenGL >= 2.4 && < 2.10,