diff --git a/CHANGELOG b/CHANGELOG
--- a/CHANGELOG
+++ b/CHANGELOG
@@ -1,8 +1,12 @@
 CHANGELOG
 
+0.6.1.1 -> 0.6.2
+  - Updated to template-haskell-2.9.0.0
+  - Added instance Applicative (HFree Monad f)
+  
 0.6.1 -> 0.6.1.1
   - Added a changelog
   
 0.6 -> 0.6.1
-  - Updated to comonad-0.4
+  - Updated to comonad-4.0
   - Added convert to Data.Functor.HCofree
diff --git a/examples/Parser.hs b/examples/Parser.hs
--- a/examples/Parser.hs
+++ b/examples/Parser.hs
@@ -5,7 +5,7 @@
   , TypeSynonymInstances
   , LambdaCase
   #-}
-module FreeNum where
+module Parser where
 
 import Data.Functor.HFree
 
diff --git a/free-functors.cabal b/free-functors.cabal
--- a/free-functors.cabal
+++ b/free-functors.cabal
@@ -1,5 +1,5 @@
 name:                free-functors
-version:             0.6.1.1
+version:             0.6.2
 synopsis:            Provides free functors that are adjoint to functors that forget class constraints. 
 description:         A free functor is a left adjoint to a forgetful functor. It used to be the case
                      that the only category that was easy to work with in Haskell was Hask itself, so
@@ -47,7 +47,7 @@
     comonad >= 4.0 && < 4.1,
     void >= 0.4 && < 0.7,
     algebraic-classes >= 0.5 && < 0.6,
-    template-haskell >= 2.8.0.0 && < 2.8.1
+    template-haskell >= 2.8.0.0 && < 2.9.1
 
 source-repository head
   type:     git
diff --git a/src/Data/Functor/HFree.hs b/src/Data/Functor/HFree.hs
--- a/src/Data/Functor/HFree.hs
+++ b/src/Data/Functor/HFree.hs
@@ -66,6 +66,10 @@
 iter :: c Identity => (forall b. f b -> b) -> HFree c f a -> a
 iter f = runIdentity . rightAdjunct (Identity . f)
 
+instance Applicative (HFree Monad f) where
+  pure = return
+  (<*>) = ap
+  
 -- | The free monad of a functor.
 instance Monad (HFree Monad f) where
   return a = HFree $ const (return a)