diff --git a/Graph.hs b/Graph.hs
--- a/Graph.hs
+++ b/Graph.hs
@@ -1,7 +1,6 @@
 {-# LANGUAGE UnicodeSyntax, FlexibleInstances, MultiParamTypeClasses #-}
 module Graph where
 
-import Prelude.Unicode
 import Data.View
 import GraphRewriting.Graph.Types
 
diff --git a/Resolver.hs b/Resolver.hs
--- a/Resolver.hs
+++ b/Resolver.hs
@@ -7,7 +7,7 @@
 import Graph
 import GraphRewriting.Graph
 import GraphRewriting.Graph.Write
-import Control.Monad (liftM, zipWithM)
+import Control.Monad (liftM, zipWithM, void)
 
 
 type Compiler = Rewrite NodeWW
@@ -26,13 +26,13 @@
 	A func arg → do
 		f ← newEdge
 		x ← newEdge
-		newNode Applicator {inp = p, func = f, arg = x}
+		void $ newNode Applicator {inp = p, func = f, arg = x}
 		compile env f func
 		compile env x arg
 	Λ x e → do
 		b ← newEdge
 		(v, n) ← bindName x
-		newNode Abstractor {name = x, inp = p, body = b, var = v}
+		void $ newNode Abstractor {name = x, inp = p, body = b, var = v}
 		compile (n : env) b e
 	V var → case env of
 		[  ] → newNode Primitive {inp = p, name = var} >> return ()
@@ -42,7 +42,7 @@
 	L binds e → do
 		(es, names) ← liftM unzip $ mapM bindName (map fst binds)
 		let env' = names ⧺ env
-		zipWithM (compile env') es (Prelude.map snd binds)
+		void $ zipWithM (compile env') es (Prelude.map snd binds)
 		compile env' p e
 
 bindName ∷ String → Compiler (Edge, Name)
diff --git a/graph-rewriting-ww.cabal b/graph-rewriting-ww.cabal
--- a/graph-rewriting-ww.cabal
+++ b/graph-rewriting-ww.cabal
@@ -1,5 +1,5 @@
 Name:           graph-rewriting-ww
-Version:        0.2
+Version:        0.3
 Copyright:      (c) 2010, Jan Rochel
 License:        BSD3
 License-File:   LICENSE