diff --git a/dhscanner-bitcode.cabal b/dhscanner-bitcode.cabal
--- a/dhscanner-bitcode.cabal
+++ b/dhscanner-bitcode.cabal
@@ -20,7 +20,7 @@
     in mind. The commands resemble an abstract RISC-style assembley, motivated by keeping
     later-phases analyses as simple as possible.
 
-version:            0.1.0.2
+version:            0.1.0.3
 license:            GPL-3.0-only
 license-file:       LICENSE
 author:             OrenGitHub
@@ -48,7 +48,7 @@
         aeson >= 2.2.3 && < 2.3,
         base >= 4.17.2 && < 4.18,
         containers >= 0.6.7 && < 0.7,
-        dhscanner-ast >= 0.1.0.3 && < 0.2,
+        dhscanner-ast >= 0.1.0.5,
 
     hs-source-dirs:
         src
diff --git a/src/Bitcode.hs b/src/Bitcode.hs
--- a/src/Bitcode.hs
+++ b/src/Bitcode.hs
@@ -155,7 +155,8 @@
 locationVariable v = case v of
     (TmpVariableCtor tmpVariable) -> tmpVariableLocation tmpVariable
     (SrcVariableCtor srcVariable) -> Token.getVarNameLocation $ srcVariableToken srcVariable
-    (ParamVariableCtor paramVariable) -> Token.getParamNameLocation $ paramVariableToken paramVariable
+    (ParamVariableCtor _paramVariable) -> Token.getParamNameLocation $ paramVariableToken _paramVariable
+    (Arg argContent) -> argVariableMyAwesomeCallContext argContent
 
 data CallContent
    = CallContent
diff --git a/src/Callable.hs b/src/Callable.hs
--- a/src/Callable.hs
+++ b/src/Callable.hs
@@ -58,7 +58,7 @@
      {
          methodName :: Token.MethdName,
          hostingClassName :: Token.ClassName,
-         hostingClassSupers :: [ Token.SuperName ],
+         hostingClassSupers :: [ Fqn ],
          methodBody :: Cfg,
          methodLocation :: Location
      }
diff --git a/src/Cfg.hs b/src/Cfg.hs
--- a/src/Cfg.hs
+++ b/src/Cfg.hs
@@ -72,7 +72,7 @@
         edges' = filter (\e -> (to e) == node) (actualEdges (edges g))    
 
 empty :: Location -> Cfg
-empty location = atom (Node (Bitcode.Instruction location Bitcode.Nop))
+empty _location = atom (Node (Bitcode.Instruction _location Bitcode.Nop))
 
 atom :: Node -> Cfg
 atom node = Cfg { entry = node, exit = node, edges = mkEmptyCollectionOfEdges }