{-# OPTIONS_GHC -w #-}
{-# OPTIONS -fglasgow-exts -cpp #-}
{-# LANGUAGE Trustworthy #-}
{-# LANGUAGE ViewPatterns #-}
{-# LANGUAGE OverloadedStrings #-}
module Language.Why3.Parser
  ( parse
  , ParseM
  , theories
  , expr
  , pType
  ) where

import           Language.Why3.AST
import           Language.Why3.Lexer

import qualified Data.ByteString.Lazy as BS
import qualified Data.Text.Lazy as Lazy
import           Data.Text ( Text )
import qualified Data.Text as Text
import           Control.Monad(liftM,ap)
import qualified Control.Applicative as A
import qualified Data.Array as Happy_Data_Array
import qualified GHC.Exts as Happy_GHC_Exts
import Control.Applicative(Applicative(..))

-- parser produced by Happy Version 1.19.4

newtype HappyAbsSyn t38 = HappyAbsSyn HappyAny
#if __GLASGOW_HASKELL__ >= 607
type HappyAny = Happy_GHC_Exts.Any
#else
type HappyAny = forall a . a
#endif
happyIn7 :: ([Theory]) -> (HappyAbsSyn t38)
happyIn7 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn7 #-}
happyOut7 :: (HappyAbsSyn t38) -> ([Theory])
happyOut7 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut7 #-}
happyIn8 :: ([Theory]) -> (HappyAbsSyn t38)
happyIn8 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn8 #-}
happyOut8 :: (HappyAbsSyn t38) -> ([Theory])
happyOut8 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut8 #-}
happyIn9 :: (Theory) -> (HappyAbsSyn t38)
happyIn9 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn9 #-}
happyOut9 :: (HappyAbsSyn t38) -> (Theory)
happyOut9 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut9 #-}
happyIn10 :: ([Decl]) -> (HappyAbsSyn t38)
happyIn10 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn10 #-}
happyOut10 :: (HappyAbsSyn t38) -> ([Decl])
happyOut10 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut10 #-}
happyIn11 :: (Decl) -> (HappyAbsSyn t38)
happyIn11 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn11 #-}
happyOut11 :: (HappyAbsSyn t38) -> (Decl)
happyOut11 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut11 #-}
happyIn12 :: (Maybe ImpExp) -> (HappyAbsSyn t38)
happyIn12 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn12 #-}
happyOut12 :: (HappyAbsSyn t38) -> (Maybe ImpExp)
happyOut12 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut12 #-}
happyIn13 :: (Maybe Name) -> (HappyAbsSyn t38)
happyIn13 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn13 #-}
happyOut13 :: (HappyAbsSyn t38) -> (Maybe Name)
happyOut13 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut13 #-}
happyIn14 :: (TypeDef) -> (HappyAbsSyn t38)
happyIn14 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn14 #-}
happyOut14 :: (HappyAbsSyn t38) -> (TypeDef)
happyOut14 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut14 #-}
happyIn15 :: (()) -> (HappyAbsSyn t38)
happyIn15 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn15 #-}
happyOut15 :: (HappyAbsSyn t38) -> (())
happyOut15 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut15 #-}
happyIn16 :: ([TyCaseAlt]) -> (HappyAbsSyn t38)
happyIn16 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn16 #-}
happyOut16 :: (HappyAbsSyn t38) -> ([TyCaseAlt])
happyOut16 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut16 #-}
happyIn17 :: (TyCaseAlt) -> (HappyAbsSyn t38)
happyIn17 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn17 #-}
happyOut17 :: (HappyAbsSyn t38) -> (TyCaseAlt)
happyOut17 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut17 #-}
happyIn18 :: ([(Name,Type)]) -> (HappyAbsSyn t38)
happyIn18 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn18 #-}
happyOut18 :: (HappyAbsSyn t38) -> ([(Name,Type)])
happyOut18 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut18 #-}
happyIn19 :: ((Name,Type)) -> (HappyAbsSyn t38)
happyIn19 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn19 #-}
happyOut19 :: (HappyAbsSyn t38) -> ((Name,Type))
happyOut19 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut19 #-}
happyIn20 :: (Type) -> (HappyAbsSyn t38)
happyIn20 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn20 #-}
happyOut20 :: (HappyAbsSyn t38) -> (Type)
happyOut20 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut20 #-}
happyIn21 :: (Type) -> (HappyAbsSyn t38)
happyIn21 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn21 #-}
happyOut21 :: (HappyAbsSyn t38) -> (Type)
happyOut21 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut21 #-}
happyIn22 :: ([Type]) -> (HappyAbsSyn t38)
happyIn22 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn22 #-}
happyOut22 :: (HappyAbsSyn t38) -> ([Type])
happyOut22 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut22 #-}
happyIn23 :: ([Type]) -> (HappyAbsSyn t38)
happyIn23 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn23 #-}
happyOut23 :: (HappyAbsSyn t38) -> ([Type])
happyOut23 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut23 #-}
happyIn24 :: ([(Name, [Text])]) -> (HappyAbsSyn t38)
happyIn24 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn24 #-}
happyOut24 :: (HappyAbsSyn t38) -> ([(Name, [Text])])
happyOut24 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut24 #-}
happyIn25 :: ([(Maybe Name, Type)]) -> (HappyAbsSyn t38)
happyIn25 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn25 #-}
happyOut25 :: (HappyAbsSyn t38) -> ([(Maybe Name, Type)])
happyOut25 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut25 #-}
happyIn26 :: ([ (Maybe Name, Type) ]) -> (HappyAbsSyn t38)
happyIn26 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn26 #-}
happyOut26 :: (HappyAbsSyn t38) -> ([ (Maybe Name, Type) ])
happyOut26 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut26 #-}
happyIn27 :: (Maybe Text) -> (HappyAbsSyn t38)
happyIn27 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn27 #-}
happyOut27 :: (HappyAbsSyn t38) -> (Maybe Text)
happyOut27 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut27 #-}
happyIn28 :: ([ Text ]) -> (HappyAbsSyn t38)
happyIn28 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn28 #-}
happyOut28 :: (HappyAbsSyn t38) -> ([ Text ])
happyOut28 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut28 #-}
happyIn29 :: ([ Text ]) -> (HappyAbsSyn t38)
happyIn29 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn29 #-}
happyOut29 :: (HappyAbsSyn t38) -> ([ Text ])
happyOut29 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut29 #-}
happyIn30 :: (Name) -> (HappyAbsSyn t38)
happyIn30 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn30 #-}
happyOut30 :: (HappyAbsSyn t38) -> (Name)
happyOut30 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut30 #-}
happyIn31 :: (Name) -> (HappyAbsSyn t38)
happyIn31 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn31 #-}
happyOut31 :: (HappyAbsSyn t38) -> (Name)
happyOut31 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut31 #-}
happyIn32 :: ([Name]) -> (HappyAbsSyn t38)
happyIn32 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn32 #-}
happyOut32 :: (HappyAbsSyn t38) -> ([Name])
happyOut32 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut32 #-}
happyIn33 :: (Name) -> (HappyAbsSyn t38)
happyIn33 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn33 #-}
happyOut33 :: (HappyAbsSyn t38) -> (Name)
happyOut33 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut33 #-}
happyIn34 :: (Name) -> (HappyAbsSyn t38)
happyIn34 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn34 #-}
happyOut34 :: (HappyAbsSyn t38) -> (Name)
happyOut34 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut34 #-}
happyIn35 :: (Name) -> (HappyAbsSyn t38)
happyIn35 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn35 #-}
happyOut35 :: (HappyAbsSyn t38) -> (Name)
happyOut35 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut35 #-}
happyIn36 :: (Name) -> (HappyAbsSyn t38)
happyIn36 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn36 #-}
happyOut36 :: (HappyAbsSyn t38) -> (Name)
happyOut36 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut36 #-}
happyIn37 :: (Name) -> (HappyAbsSyn t38)
happyIn37 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn37 #-}
happyOut37 :: (HappyAbsSyn t38) -> (Name)
happyOut37 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut37 #-}
happyIn38 :: t38 -> (HappyAbsSyn t38)
happyIn38 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn38 #-}
happyOut38 :: (HappyAbsSyn t38) -> t38
happyOut38 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut38 #-}
happyIn39 :: (Expr) -> (HappyAbsSyn t38)
happyIn39 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn39 #-}
happyOut39 :: (HappyAbsSyn t38) -> (Expr)
happyOut39 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut39 #-}
happyIn40 :: (Quant) -> (HappyAbsSyn t38)
happyIn40 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn40 #-}
happyOut40 :: (HappyAbsSyn t38) -> (Quant)
happyOut40 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut40 #-}
happyIn41 :: ([(Name,Type)]) -> (HappyAbsSyn t38)
happyIn41 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn41 #-}
happyOut41 :: (HappyAbsSyn t38) -> ([(Name,Type)])
happyOut41 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut41 #-}
happyIn42 :: ([[(Name,Type)]]) -> (HappyAbsSyn t38)
happyIn42 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn42 #-}
happyOut42 :: (HappyAbsSyn t38) -> ([[(Name,Type)]])
happyOut42 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut42 #-}
happyIn43 :: ([[Expr]]) -> (HappyAbsSyn t38)
happyIn43 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn43 #-}
happyOut43 :: (HappyAbsSyn t38) -> ([[Expr]])
happyOut43 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut43 #-}
happyIn44 :: ([[Expr]]) -> (HappyAbsSyn t38)
happyIn44 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn44 #-}
happyOut44 :: (HappyAbsSyn t38) -> ([[Expr]])
happyOut44 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut44 #-}
happyIn45 :: ([Expr]) -> (HappyAbsSyn t38)
happyIn45 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn45 #-}
happyOut45 :: (HappyAbsSyn t38) -> ([Expr])
happyOut45 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut45 #-}
happyIn46 :: (Expr) -> (HappyAbsSyn t38)
happyIn46 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn46 #-}
happyOut46 :: (HappyAbsSyn t38) -> (Expr)
happyOut46 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut46 #-}
happyIn47 :: ([(Name,Expr)]) -> (HappyAbsSyn t38)
happyIn47 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn47 #-}
happyOut47 :: (HappyAbsSyn t38) -> ([(Name,Expr)])
happyOut47 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut47 #-}
happyIn48 :: ((Name, Expr)) -> (HappyAbsSyn t38)
happyIn48 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn48 #-}
happyOut48 :: (HappyAbsSyn t38) -> ((Name, Expr))
happyOut48 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut48 #-}
happyIn49 :: ([Expr]) -> (HappyAbsSyn t38)
happyIn49 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn49 #-}
happyOut49 :: (HappyAbsSyn t38) -> ([Expr])
happyOut49 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut49 #-}
happyIn50 :: (Pattern) -> (HappyAbsSyn t38)
happyIn50 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn50 #-}
happyOut50 :: (HappyAbsSyn t38) -> (Pattern)
happyOut50 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut50 #-}
happyIn51 :: (Pattern) -> (HappyAbsSyn t38)
happyIn51 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn51 #-}
happyOut51 :: (HappyAbsSyn t38) -> (Pattern)
happyOut51 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut51 #-}
happyIn52 :: ([Pattern]) -> (HappyAbsSyn t38)
happyIn52 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn52 #-}
happyOut52 :: (HappyAbsSyn t38) -> ([Pattern])
happyOut52 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut52 #-}
happyIn53 :: ([Expr]) -> (HappyAbsSyn t38)
happyIn53 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn53 #-}
happyOut53 :: (HappyAbsSyn t38) -> ([Expr])
happyOut53 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut53 #-}
happyIn54 :: ([(Pattern, Expr)]) -> (HappyAbsSyn t38)
happyIn54 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn54 #-}
happyOut54 :: (HappyAbsSyn t38) -> ([(Pattern, Expr)])
happyOut54 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut54 #-}
happyIn55 :: ((Pattern,Expr)) -> (HappyAbsSyn t38)
happyIn55 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyIn55 #-}
happyOut55 :: (HappyAbsSyn t38) -> ((Pattern,Expr))
happyOut55 x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOut55 #-}
happyInTok :: (Token) -> (HappyAbsSyn t38)
happyInTok x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyInTok #-}
happyOutTok :: (HappyAbsSyn t38) -> (Token)
happyOutTok x = Happy_GHC_Exts.unsafeCoerce# x
{-# INLINE happyOutTok #-}


happyActOffsets :: HappyAddr
happyActOffsets = HappyA# "\x00\x00\xa4\x02\x38\x01\x01\x00\x00\x00\xa4\x02\x00\x00\x00\x00\x01\x00\x97\x00\x0a\x00\xb7\x02\xa5\x02\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x97\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x01\x00\x01\x00\x6e\x00\x6f\x02\x00\x00\x38\x01\x22\x01\x97\x02\x67\x02\x8e\x02\x4f\x02\x00\x00\x00\x00\x00\x00\x00\x00\x44\x00\x40\x00\x00\x00\x00\x00\x38\x01\x00\x00\x00\x00\x6e\x00\x6e\x02\x00\x00\x6e\x00\x00\x00\x3a\x01\x3b\x00\x79\x00\x66\x01\x66\x02\x18\x01\x4c\x01\x00\x00\xf7\x00\x00\x00\x00\x00\x3a\x01\x01\x00\x00\x00\x05\x00\x00\x00\x04\x00\x01\x00\x01\x00\x01\x00\x01\x00\x01\x00\xce\x00\x38\x01\x01\x00\x01\x00\x01\x00\x01\x00\x01\x00\x01\x00\x65\x02\x97\x00\x00\x00\x00\x00\x65\x02\xe2\x00\xe2\x00\x4f\x01\x4f\x01\x3a\x01\x3a\x01\x00\x00\x00\x00\x4a\x01\x4a\x01\x55\x00\xc9\x00\x00\x00\x53\x02\x01\x00\x5f\x02\x00\x00\x38\x01\xaa\x00\x00\x00\x00\x00\xce\x00\xce\x00\x01\x00\x01\x00\x01\x00\x40\x02\x42\x02\x01\x00\x00\x00\x00\x00\x6e\x00\x00\x00\x00\x00\x38\x01\x00\x00\x38\x01\xc1\x02\x00\x00\x00\x00\xec\x02\xcb\x02\x47\x02\x47\x02\x47\x02\xe8\x02\xe8\x02\x47\x02\x00\x00\x00\x00\x00\x00\x36\x00\x00\x00\x6e\x00\x00\x00\x3a\x01\x57\x00\x3a\x01\x2e\x02\x36\x01\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x3a\x01\xdb\x00\x24\x02\x01\x00\x3a\x01\x01\x00\x00\x00\x01\x00\xcb\x00\x00\x00\x01\x00\x16\x02\x5c\x00\x00\x00\x01\x00\x00\x00\x12\x02\x20\x02\x20\x02\x02\x02\x00\x00\x00\x00\x00\x00\x71\x01\x00\x00\x00\x00\xfa\x01\x01\x00\x00\x00\xdf\x01\x00\x00\x00\x00\x00\x02\x00\x00\xe2\x01\x01\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x3a\x01\x6e\x00\x00\x00\x01\x00\x3a\x01\x00\x00\xdc\x01\x3a\x01\x3a\x01\x00\x00\xc8\x02\x3a\x01\x3a\x01\x38\x01\x14\x00\x00\x00\x03\x01\x00\x00\xde\x01\x3a\x01\x00\x00\x00\x00\x00\x00\xd5\x00\x01\x00\x38\x01\xd6\x01\x8f\x00\xd7\x01\x00\x00\x00\x00\xce\x01\x00\x00\xc7\x01\x01\x00\xb3\x01\x3a\x01\x29\x01\x38\x01\x01\x00\x3a\x01\x20\x00\x00\x00\xa5\x01\x93\x01\x00\x00\x00\x00\x00\x00\x00\x00\xbc\x01\x38\x01\x00\x00\xb7\x01\x3a\x01\xa0\x01\x00\x00\x00\x00\x00\x00\x00\x00\xba\x00\x00\x00"#

happyGotoOffsets :: HappyAddr
happyGotoOffsets = HappyA# "\xf0\x00\xa3\x01\x8e\x01\xb1\x02\xa2\x01\x9f\x01\x00\x00\x00\x00\xa9\x02\x88\x00\x00\x00\x85\x01\x00\x00\x00\x00\x00\x00\xa1\x02\x00\x00\x00\x00\x00\x00\x00\x00\xbe\x02\x00\x00\x00\x00\x00\x00\x00\x00\x99\x02\x6a\x01\x00\x00\x00\x00\x00\x00\x00\x00\x91\x02\x89\x02\x00\x01\xa3\x00\x00\x00\x00\x00\x6e\x01\x7f\x01\x78\x01\x00\x00\x74\x01\x00\x00\x7d\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x3f\x00\x00\x00\x00\x00\x1c\x00\x00\x00\x00\x00\xa0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x81\x02\x00\x00\x62\x01\x00\x00\x2d\x01\x79\x02\x71\x02\x69\x02\x61\x02\x59\x02\x46\x01\x8b\x01\x51\x02\x49\x02\x41\x02\x39\x02\x31\x02\x29\x02\x00\x00\xb8\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x8f\x01\xda\x00\x00\x00\x89\x01\x00\x00\x00\x00\x00\x00\x66\x00\xcc\x00\x21\x02\x19\x02\x11\x02\x35\x01\x00\x00\x09\x02\x00\x00\x00\x00\x32\x00\x00\x00\x00\x00\x87\x01\x00\x00\x5c\x01\xcd\x00\x00\x00\x00\x00\x28\x01\x60\x01\x23\x01\x1f\x01\x17\x01\xee\x00\x91\x00\x8a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf9\x01\x00\x00\xf1\x01\x00\x00\x9c\x01\x00\x00\x00\x00\xe9\x01\x00\x00\x00\x00\x00\x00\xe1\x01\xaa\x01\x00\x00\xb9\x00\x86\x00\x00\x00\x9d\x01\x8a\x01\x5f\x01\x94\x00\x00\x00\x00\x00\x00\x00\xd9\x01\x00\x00\x8e\x00\x00\x00\x75\x00\x00\x00\x64\x00\x00\x00\xd1\x01\x00\x00\x00\x00\x00\x00\xc9\x01\x45\x00\x00\x00\x4d\x00\x00\x00\xc1\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x01\x26\x01\x00\x00\x26\x01\x00\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x50\x01\xb9\x01\xeb\x00\x00\x00\x1e\x00\x09\x00\xf5\x00\x00\x00\x06\x00\x00\x00\x02\x01\xb1\x01\x00\x00\x00\x00\x00\x00\x72\x00\xa9\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x07\x00\x00\x00\xef\xff\x0f\x00\x6d\x00\x00\x00\x38\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xae\x00\x00\x00"#

happyDefActions :: HappyAddr
happyDefActions = HappyA# "\xfa\xff\x00\x00\x00\x00\x00\x00\x00\x00\xfb\xff\xb4\xff\xb5\xff\x00\x00\x8c\xff\x00\x00\x00\x00\xb1\xff\x90\xff\x8f\xff\x00\x00\xbd\xff\xbb\xff\xbc\xff\xba\xff\x00\x00\xb6\xff\xb7\xff\xb8\xff\xb9\xff\x00\x00\x00\x00\x8e\xff\x8d\xff\x9b\xff\x9a\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd8\xff\xd6\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf7\xff\xbe\xff\xd7\xff\xc1\xff\x00\x00\x00\x00\xd4\xff\xd2\xff\xd9\xff\xd6\xff\x7d\xff\x7c\xff\x00\x00\x80\xff\x00\x00\x7e\xff\x78\xff\x00\x00\x00\x00\x9d\xff\xb4\xff\x00\x00\x00\x00\x85\xff\x00\x00\x8c\xff\x8b\xff\x9e\xff\x00\x00\xc0\xff\x00\x00\x98\xff\x96\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x82\xff\xb0\xff\xaf\xff\xf9\xff\x81\xff\xa2\xff\xa3\xff\xa0\xff\xa1\xff\xa4\xff\xa5\xff\x9f\xff\xa9\xff\xae\xff\xad\xff\xac\xff\xab\xff\xaa\xff\x00\x00\x00\x00\x00\x00\xbf\xff\x00\x00\x00\x00\x88\xff\x87\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe0\xff\x00\x00\x00\x00\x7c\xff\x7a\xff\x7f\xff\xd1\xff\xd3\xff\x00\x00\xd5\xff\x00\x00\x00\x00\xf6\xff\xf8\xff\x00\x00\xe7\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd0\xff\xcf\xff\x79\xff\x00\x00\x7b\xff\x00\x00\xe1\xff\x77\xff\x00\x00\x83\xff\x00\x00\x00\x00\x84\xff\x8a\xff\x00\x00\x99\xff\x97\xff\x92\xff\x00\x00\x94\xff\x00\x00\x9c\xff\x00\x00\x95\xff\x00\x00\x00\x00\x86\xff\x00\x00\x00\x00\x00\x00\x76\xff\x00\x00\xc5\xff\x00\x00\xc7\xff\xc7\xff\x00\x00\xc5\xff\xc5\xff\xc5\xff\x00\x00\xe9\xff\xe8\xff\x00\x00\x00\x00\xb3\xff\xe6\xff\xb2\xff\xcc\xff\xc6\xff\xcc\xff\x00\x00\x00\x00\xc2\xff\xc8\xff\xc3\xff\x00\x00\xce\xff\xa6\xff\x00\x00\xa7\xff\x00\x00\xa8\xff\x89\xff\x93\xff\x91\xff\x74\xff\x75\xff\xeb\xff\xed\xff\xee\xff\x00\x00\x00\x00\xc4\xff\xf4\xff\xf5\xff\x00\x00\xec\xff\xe5\xff\xca\xff\xcb\xff\x00\x00\x00\x00\x00\x00\xf0\xff\xe0\xff\x00\x00\xc5\xff\xea\xff\x00\x00\xe4\xff\x00\x00\x00\x00\xf2\xff\xf3\xff\x00\x00\x00\x00\x00\x00\xef\xff\x00\x00\xdc\xff\x00\x00\xe2\xff\xdf\xff\xc5\xff\xcd\xff\xcc\xff\x00\x00\x00\x00\xe3\xff\x00\x00\xf1\xff\x00\x00\xc9\xff\xdb\xff\xda\xff\xde\xff\xdd\xff"#

happyCheck :: HappyAddr
happyCheck = HappyA# "\xff\xff\x12\x00\x01\x00\x02\x00\x03\x00\x04\x00\x05\x00\x06\x00\x07\x00\x04\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x09\x00\x0a\x00\x10\x00\x0e\x00\x12\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x04\x00\x0a\x00\x06\x00\x17\x00\x15\x00\x16\x00\x19\x00\x15\x00\x1a\x00\x18\x00\x18\x00\x19\x00\x10\x00\x07\x00\x08\x00\x1d\x00\x1e\x00\x1a\x00\x16\x00\x0d\x00\x0e\x00\x19\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x13\x00\x18\x00\x1a\x00\x1a\x00\x36\x00\x37\x00\x1b\x00\x1a\x00\x3a\x00\x32\x00\x33\x00\x34\x00\x35\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0c\x00\x18\x00\x3c\x00\x1a\x00\x2c\x00\x2d\x00\x18\x00\x15\x00\x1a\x00\x0e\x00\x18\x00\x19\x00\x18\x00\x11\x00\x17\x00\x1d\x00\x1e\x00\x11\x00\x11\x00\x17\x00\x2b\x00\x2c\x00\x1b\x00\x17\x00\x2f\x00\x30\x00\x2c\x00\x0a\x00\x0b\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x18\x00\x2b\x00\x1a\x00\x32\x00\x33\x00\x34\x00\x35\x00\x15\x00\x18\x00\x19\x00\x18\x00\x19\x00\x3b\x00\x04\x00\x05\x00\x1d\x00\x1e\x00\x12\x00\x1b\x00\x2b\x00\x2c\x00\x0d\x00\x0e\x00\x20\x00\x30\x00\x10\x00\x0d\x00\x0e\x00\x1b\x00\x14\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x12\x00\x1b\x00\x32\x00\x33\x00\x34\x00\x35\x00\x1b\x00\x15\x00\x29\x00\x39\x00\x18\x00\x19\x00\x04\x00\x06\x00\x06\x00\x1d\x00\x1e\x00\x01\x00\x02\x00\x14\x00\x04\x00\x05\x00\x06\x00\x07\x00\x10\x00\x09\x00\x12\x00\x18\x00\x1b\x00\x1c\x00\x16\x00\x1e\x00\x10\x00\x17\x00\x12\x00\x1b\x00\x32\x00\x33\x00\x34\x00\x35\x00\x27\x00\x1c\x00\x38\x00\x2a\x00\x1f\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x18\x00\x0f\x00\x1a\x00\x18\x00\x0e\x00\x1a\x00\x04\x00\x15\x00\x06\x00\x13\x00\x18\x00\x19\x00\x2d\x00\x2e\x00\x1c\x00\x1d\x00\x1e\x00\x1b\x00\x10\x00\x2b\x00\x2c\x00\x14\x00\x2b\x00\x2c\x00\x16\x00\x04\x00\x04\x00\x0a\x00\x06\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x04\x00\x0f\x00\x06\x00\x32\x00\x33\x00\x34\x00\x35\x00\x15\x00\x18\x00\x19\x00\x18\x00\x19\x00\x10\x00\x11\x00\x1b\x00\x1d\x00\x1e\x00\x0f\x00\x16\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x00\x00\x01\x00\x18\x00\x19\x00\x28\x00\x29\x00\x1b\x00\x15\x00\x0d\x00\x0e\x00\x18\x00\x19\x00\x22\x00\x32\x00\x33\x00\x34\x00\x35\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x17\x00\x1b\x00\x04\x00\x11\x00\x06\x00\x15\x00\x16\x00\x15\x00\x0b\x00\x0c\x00\x18\x00\x19\x00\x0d\x00\x0e\x00\x10\x00\x1d\x00\x1e\x00\x34\x00\x35\x00\x15\x00\x16\x00\x18\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1b\x00\x20\x00\x21\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x04\x00\x27\x00\x06\x00\x32\x00\x33\x00\x34\x00\x35\x00\x15\x00\x2e\x00\x18\x00\x18\x00\x19\x00\x10\x00\x11\x00\x0e\x00\x1d\x00\x1e\x00\x18\x00\x16\x00\x13\x00\x11\x00\x18\x00\x04\x00\x08\x00\x06\x00\x17\x00\x17\x00\x1b\x00\x19\x00\x2b\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x10\x00\x13\x00\x32\x00\x33\x00\x34\x00\x35\x00\x16\x00\x15\x00\x1a\x00\x24\x00\x18\x00\x19\x00\x0a\x00\x0b\x00\x0c\x00\x1d\x00\x1e\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0d\x00\x0e\x00\x13\x00\x10\x00\x1b\x00\x18\x00\x19\x00\x15\x00\x05\x00\x1a\x00\x18\x00\x19\x00\x0d\x00\x0e\x00\x1b\x00\x32\x00\x33\x00\x34\x00\x35\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x15\x00\x16\x00\x05\x00\x1b\x00\x07\x00\x08\x00\x18\x00\x15\x00\x0e\x00\x0f\x00\x18\x00\x19\x00\x03\x00\x32\x00\x33\x00\x34\x00\x35\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1b\x00\x20\x00\x21\x00\x0d\x00\x0e\x00\x1a\x00\x10\x00\x18\x00\x27\x00\x28\x00\x29\x00\x0d\x00\x0e\x00\x0d\x00\x0e\x00\x0d\x00\x0e\x00\x1b\x00\x0d\x00\x0e\x00\x18\x00\x19\x00\x15\x00\x16\x00\x02\x00\x1b\x00\x01\x00\x1b\x00\x02\x00\x1b\x00\x22\x00\x23\x00\x1b\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1b\x00\x20\x00\x21\x00\x11\x00\x15\x00\x16\x00\x25\x00\x26\x00\x27\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x04\x00\x20\x00\x21\x00\x19\x00\x15\x00\x16\x00\x05\x00\x26\x00\x27\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x15\x00\x20\x00\x21\x00\x04\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x05\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x04\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x05\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x15\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x17\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x19\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x03\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x2c\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x19\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x19\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x03\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x19\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x1d\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x17\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x15\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x04\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x11\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x1b\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x04\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x18\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x0e\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x15\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x15\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x3c\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x05\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x04\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x3c\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x3c\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x0e\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x04\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x1f\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\xff\xff\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x27\x00\x20\x00\x21\x00\x1b\x00\x1c\x00\xff\xff\x1e\x00\xff\xff\x27\x00\x1b\x00\x1c\x00\xff\xff\x1e\x00\x15\x00\x16\x00\x27\x00\xff\xff\x20\x00\x21\x00\x22\x00\xff\xff\x27\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x2a\x00\x04\x00\x05\x00\x23\x00\x24\x00\x04\x00\x05\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"#

happyTable :: HappyAddr
happyTable = HappyA# "\x00\x00\x03\x01\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x2f\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\xf4\x00\xf5\x00\x1a\x00\x6d\x00\x1b\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\x11\x00\x02\x01\x13\x00\x6e\x00\xf8\x00\xbf\x00\x70\x00\x51\x00\xf6\x00\xe5\x00\x52\x00\x53\x00\xe0\x00\xe6\x00\xe7\x00\x54\x00\x55\x00\xf6\x00\x28\x00\xe8\x00\x24\x00\xe2\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\xfc\x00\x35\x00\xdc\x00\x7b\x00\x21\x00\x22\x00\x25\x00\xfd\x00\x23\x00\x56\x00\x57\x00\x58\x00\x59\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\x00\x01\x35\x00\xff\xff\x36\x00\x7c\x00\x7d\x00\x35\x00\x51\x00\x7b\x00\x7e\x00\x52\x00\x53\x00\xf3\x00\x80\x00\x78\x00\x54\x00\x55\x00\x82\x00\xd2\x00\x81\x00\xaa\x00\x38\x00\x34\x00\x83\x00\xab\x00\xac\x00\x90\x00\x4d\x00\x4e\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\x35\x00\x79\x00\x36\x00\x56\x00\x57\x00\x58\x00\x59\x00\x51\x00\x52\x00\x53\x00\x52\x00\x53\x00\xae\x00\x2f\x00\x2d\x00\x54\x00\x55\x00\xd6\x00\xca\x00\xaa\x00\x38\x00\x01\x01\x24\x00\xcb\x00\xd1\x00\x3a\x00\xfe\x00\x24\x00\x98\x00\x3b\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\xd8\x00\x25\x00\x56\x00\x57\x00\x58\x00\x59\x00\x25\x00\x51\x00\x9a\x00\xaa\x00\x52\x00\x53\x00\x11\x00\xd9\x00\x13\x00\x54\x00\x55\x00\x0e\x00\x0f\x00\xc3\x00\x11\x00\x12\x00\x13\x00\x14\x00\x27\x00\x15\x00\xea\x00\xae\x00\x06\x00\x07\x00\x28\x00\x44\x00\x1a\x00\xaf\x00\x1b\x00\x95\x00\x56\x00\x57\x00\x58\x00\x59\x00\x59\x00\xbb\x00\x77\x00\x5a\x00\xbc\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\x35\x00\x9c\x00\x36\x00\x35\x00\xdd\x00\x36\x00\x11\x00\x51\x00\x13\x00\xde\x00\x52\x00\x53\x00\x1c\x00\x1d\x00\x9d\x00\x54\x00\x55\x00\x34\x00\xe0\x00\x79\x00\x38\x00\xc5\x00\x37\x00\x38\x00\x28\x00\x84\x00\x11\x00\x4d\x00\x13\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\x11\x00\xce\x00\x13\x00\x56\x00\x57\x00\x58\x00\x59\x00\x51\x00\x52\x00\x53\x00\x52\x00\x53\x00\x27\x00\x32\x00\x98\x00\x54\x00\x55\x00\xa6\x00\x28\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\x2a\x00\x05\x00\x48\x00\x49\x00\x99\x00\x42\x00\xa7\x00\x51\x00\xeb\x00\x24\x00\x52\x00\x53\x00\x9e\x00\x56\x00\x57\x00\x58\x00\x59\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\xb2\x00\x25\x00\x11\x00\x72\x00\x13\x00\xf7\x00\xbf\x00\x51\x00\xf1\x00\xf2\x00\x52\x00\x53\x00\xe2\x00\x24\x00\xe0\x00\x54\x00\x55\x00\x58\x00\x59\x00\xe1\x00\x28\x00\xf3\x00\x06\x00\x07\x00\x08\x00\x09\x00\x25\x00\x3b\x00\x0b\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\x11\x00\x0c\x00\x13\x00\x56\x00\x57\x00\x58\x00\x59\x00\x51\x00\x3c\x00\xb3\x00\x52\x00\x53\x00\x27\x00\x32\x00\xdd\x00\x54\x00\x55\x00\xb4\x00\x28\x00\xde\x00\x82\x00\xb5\x00\x11\x00\x93\x00\x13\x00\xb9\x00\x83\x00\x34\x00\xef\x00\x75\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\x27\x00\xa9\x00\x56\x00\x57\x00\x58\x00\x59\x00\x28\x00\x51\x00\x74\x00\x6b\x00\x52\x00\x53\x00\x4d\x00\x4e\x00\x4f\x00\x54\x00\x55\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\xed\x00\x24\x00\x73\x00\x30\x00\x65\x00\x52\x00\x53\x00\x51\x00\xb6\x00\x74\x00\x52\x00\x53\x00\x8e\x00\x24\x00\x25\x00\x56\x00\x57\x00\x58\x00\x59\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\xbe\x00\xbf\x00\x12\x00\x25\x00\x14\x00\xbe\x00\x6e\x00\x51\x00\x32\x00\x33\x00\x52\x00\x53\x00\x83\x00\x56\x00\x57\x00\x58\x00\x59\x00\x3f\x00\x07\x00\x08\x00\x09\x00\x34\x00\x40\x00\x0b\x00\x2f\x00\x24\x00\x2b\x00\x30\x00\x2d\x00\x0c\x00\x41\x00\x42\x00\x8f\x00\x24\x00\x9d\x00\x24\x00\x64\x00\x24\x00\x25\x00\x23\x00\x24\x00\x48\x00\x49\x00\xc0\x00\xbf\x00\x5c\x00\x25\x00\x05\x00\x25\x00\x28\x00\x25\x00\x4a\x00\x4b\x00\x25\x00\x06\x00\x07\x00\x08\x00\x09\x00\xfa\x00\x9f\x00\x0b\x00\x00\x01\xc1\x00\xbf\x00\xa0\x00\xa1\x00\x0c\x00\x06\x00\x07\x00\x08\x00\x09\x00\x2f\x00\x9f\x00\x0b\x00\xfb\x00\xc7\x00\xbf\x00\x2d\x00\xce\x00\x0c\x00\x06\x00\x07\x00\x08\x00\x09\x00\xf0\x00\xfd\x00\x0b\x00\x2f\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\xf0\x00\x0b\x00\x2d\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\xec\x00\x0b\x00\x2f\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\xd0\x00\x0b\x00\x2d\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\xd3\x00\x0b\x00\xeb\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\xd4\x00\x0b\x00\xa5\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\xdb\x00\x0b\x00\xd6\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\xc8\x00\x0b\x00\xd8\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\xcc\x00\x0b\x00\xdb\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\xcf\x00\x0b\x00\xbb\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\xa3\x00\x0b\x00\xc3\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\xa7\x00\x0b\x00\xc5\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x91\x00\x0b\x00\xc7\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x95\x00\x0b\x00\xcc\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x96\x00\x0b\x00\xa5\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x97\x00\x0b\x00\x76\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x5e\x00\x0b\x00\x2f\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x5f\x00\x0b\x00\x93\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x60\x00\x0b\x00\x95\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x61\x00\x0b\x00\x2f\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x62\x00\x0b\x00\xa3\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x63\x00\x0b\x00\x48\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x66\x00\x0b\x00\x76\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x67\x00\x0b\x00\x7b\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x68\x00\x0b\x00\xff\xff\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x69\x00\x0b\x00\x2d\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x6a\x00\x0b\x00\x2f\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x70\x00\x0b\x00\xff\xff\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x3d\x00\x0b\x00\xff\xff\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x3e\x00\x0b\x00\x48\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x43\x00\x0b\x00\x2f\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x46\x00\x0b\x00\x2a\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x5b\x00\x0b\x00\x00\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0c\x00\x0a\x00\x0b\x00\x06\x00\x07\x00\x00\x00\x44\x00\x00\x00\x0c\x00\x06\x00\x07\x00\x00\x00\x44\x00\xe4\x00\xe5\x00\x5d\x00\x00\x00\x86\x00\x87\x00\x88\x00\x00\x00\x45\x00\x89\x00\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\xb1\x00\xb2\x00\xb8\x00\xb9\x00\xb1\x00\xb2\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#

happyReduceArr = Happy_Data_Array.array (4, 139) [
	(4 , happyReduce_4),
	(5 , happyReduce_5),
	(6 , happyReduce_6),
	(7 , happyReduce_7),
	(8 , happyReduce_8),
	(9 , happyReduce_9),
	(10 , happyReduce_10),
	(11 , happyReduce_11),
	(12 , happyReduce_12),
	(13 , happyReduce_13),
	(14 , happyReduce_14),
	(15 , happyReduce_15),
	(16 , happyReduce_16),
	(17 , happyReduce_17),
	(18 , happyReduce_18),
	(19 , happyReduce_19),
	(20 , happyReduce_20),
	(21 , happyReduce_21),
	(22 , happyReduce_22),
	(23 , happyReduce_23),
	(24 , happyReduce_24),
	(25 , happyReduce_25),
	(26 , happyReduce_26),
	(27 , happyReduce_27),
	(28 , happyReduce_28),
	(29 , happyReduce_29),
	(30 , happyReduce_30),
	(31 , happyReduce_31),
	(32 , happyReduce_32),
	(33 , happyReduce_33),
	(34 , happyReduce_34),
	(35 , happyReduce_35),
	(36 , happyReduce_36),
	(37 , happyReduce_37),
	(38 , happyReduce_38),
	(39 , happyReduce_39),
	(40 , happyReduce_40),
	(41 , happyReduce_41),
	(42 , happyReduce_42),
	(43 , happyReduce_43),
	(44 , happyReduce_44),
	(45 , happyReduce_45),
	(46 , happyReduce_46),
	(47 , happyReduce_47),
	(48 , happyReduce_48),
	(49 , happyReduce_49),
	(50 , happyReduce_50),
	(51 , happyReduce_51),
	(52 , happyReduce_52),
	(53 , happyReduce_53),
	(54 , happyReduce_54),
	(55 , happyReduce_55),
	(56 , happyReduce_56),
	(57 , happyReduce_57),
	(58 , happyReduce_58),
	(59 , happyReduce_59),
	(60 , happyReduce_60),
	(61 , happyReduce_61),
	(62 , happyReduce_62),
	(63 , happyReduce_63),
	(64 , happyReduce_64),
	(65 , happyReduce_65),
	(66 , happyReduce_66),
	(67 , happyReduce_67),
	(68 , happyReduce_68),
	(69 , happyReduce_69),
	(70 , happyReduce_70),
	(71 , happyReduce_71),
	(72 , happyReduce_72),
	(73 , happyReduce_73),
	(74 , happyReduce_74),
	(75 , happyReduce_75),
	(76 , happyReduce_76),
	(77 , happyReduce_77),
	(78 , happyReduce_78),
	(79 , happyReduce_79),
	(80 , happyReduce_80),
	(81 , happyReduce_81),
	(82 , happyReduce_82),
	(83 , happyReduce_83),
	(84 , happyReduce_84),
	(85 , happyReduce_85),
	(86 , happyReduce_86),
	(87 , happyReduce_87),
	(88 , happyReduce_88),
	(89 , happyReduce_89),
	(90 , happyReduce_90),
	(91 , happyReduce_91),
	(92 , happyReduce_92),
	(93 , happyReduce_93),
	(94 , happyReduce_94),
	(95 , happyReduce_95),
	(96 , happyReduce_96),
	(97 , happyReduce_97),
	(98 , happyReduce_98),
	(99 , happyReduce_99),
	(100 , happyReduce_100),
	(101 , happyReduce_101),
	(102 , happyReduce_102),
	(103 , happyReduce_103),
	(104 , happyReduce_104),
	(105 , happyReduce_105),
	(106 , happyReduce_106),
	(107 , happyReduce_107),
	(108 , happyReduce_108),
	(109 , happyReduce_109),
	(110 , happyReduce_110),
	(111 , happyReduce_111),
	(112 , happyReduce_112),
	(113 , happyReduce_113),
	(114 , happyReduce_114),
	(115 , happyReduce_115),
	(116 , happyReduce_116),
	(117 , happyReduce_117),
	(118 , happyReduce_118),
	(119 , happyReduce_119),
	(120 , happyReduce_120),
	(121 , happyReduce_121),
	(122 , happyReduce_122),
	(123 , happyReduce_123),
	(124 , happyReduce_124),
	(125 , happyReduce_125),
	(126 , happyReduce_126),
	(127 , happyReduce_127),
	(128 , happyReduce_128),
	(129 , happyReduce_129),
	(130 , happyReduce_130),
	(131 , happyReduce_131),
	(132 , happyReduce_132),
	(133 , happyReduce_133),
	(134 , happyReduce_134),
	(135 , happyReduce_135),
	(136 , happyReduce_136),
	(137 , happyReduce_137),
	(138 , happyReduce_138),
	(139 , happyReduce_139)
	]

happy_n_terms = 61 :: Int
happy_n_nonterms = 49 :: Int

happyReduce_4 = happySpecReduce_1  0# happyReduction_4
happyReduction_4 happy_x_1
	 =  case happyOut8 happy_x_1 of { happy_var_1 -> 
	happyIn7
		 (reverse happy_var_1
	)}

happyReduce_5 = happySpecReduce_0  1# happyReduction_5
happyReduction_5  =  happyIn8
		 ([]
	)

happyReduce_6 = happySpecReduce_2  1# happyReduction_6
happyReduction_6 happy_x_2
	happy_x_1
	 =  case happyOut8 happy_x_1 of { happy_var_1 -> 
	case happyOut9 happy_x_2 of { happy_var_2 -> 
	happyIn8
		 (happy_var_2 : happy_var_1
	)}}

happyReduce_7 = happyReduce 4# 2# happyReduction_7
happyReduction_7 (happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut33 happy_x_2 of { happy_var_2 -> 
	case happyOut10 happy_x_3 of { happy_var_3 -> 
	happyIn9
		 (Theory happy_var_2 (reverse happy_var_3)
	) `HappyStk` happyRest}}

happyReduce_8 = happySpecReduce_0  3# happyReduction_8
happyReduction_8  =  happyIn10
		 ([]
	)

happyReduce_9 = happySpecReduce_2  3# happyReduction_9
happyReduction_9 happy_x_2
	happy_x_1
	 =  case happyOut10 happy_x_1 of { happy_var_1 -> 
	case happyOut11 happy_x_2 of { happy_var_2 -> 
	happyIn10
		 (happy_var_2 : happy_var_1
	)}}

happyReduce_10 = happyReduce 4# 4# happyReduction_10
happyReduction_10 (happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut12 happy_x_2 of { happy_var_2 -> 
	case happyOut38 happy_x_3 of { happy_var_3 -> 
	case happyOut13 happy_x_4 of { happy_var_4 -> 
	happyIn11
		 (Use happy_var_2 happy_var_3 happy_var_4
	) `HappyStk` happyRest}}}

happyReduce_11 = happyReduce 4# 4# happyReduction_11
happyReduction_11 (happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut31 happy_x_2 of { happy_var_2 -> 
	case happyOut28 happy_x_3 of { happy_var_3 -> 
	case happyOut25 happy_x_4 of { happy_var_4 -> 
	happyIn11
		 (Predicate happy_var_2 happy_var_3 (map snd happy_var_4)
	) `HappyStk` happyRest}}}

happyReduce_12 = happyReduce 6# 4# happyReduction_12
happyReduction_12 (happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut31 happy_x_2 of { happy_var_2 -> 
	case happyOut28 happy_x_3 of { happy_var_3 -> 
	case happyOut25 happy_x_4 of { happy_var_4 -> 
	case happyOut39 happy_x_6 of { happy_var_6 -> 
	happyIn11
		 (PredicateDef happy_var_2 happy_var_3 happy_var_4 happy_var_6
	) `HappyStk` happyRest}}}}

happyReduce_13 = happyReduce 6# 4# happyReduction_13
happyReduction_13 (happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut31 happy_x_2 of { happy_var_2 -> 
	case happyOut28 happy_x_3 of { happy_var_3 -> 
	case happyOut25 happy_x_4 of { happy_var_4 -> 
	case happyOut20 happy_x_6 of { happy_var_6 -> 
	happyIn11
		 (Function happy_var_2 happy_var_3 (map snd happy_var_4) happy_var_6
	) `HappyStk` happyRest}}}}

happyReduce_14 = happyReduce 8# 4# happyReduction_14
happyReduction_14 (happy_x_8 `HappyStk`
	happy_x_7 `HappyStk`
	happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut31 happy_x_2 of { happy_var_2 -> 
	case happyOut28 happy_x_3 of { happy_var_3 -> 
	case happyOut25 happy_x_4 of { happy_var_4 -> 
	case happyOut20 happy_x_6 of { happy_var_6 -> 
	case happyOut39 happy_x_8 of { happy_var_8 -> 
	happyIn11
		 (FunctionDef happy_var_2 happy_var_3 happy_var_4 happy_var_6 happy_var_8
	) `HappyStk` happyRest}}}}}

happyReduce_15 = happyReduce 5# 4# happyReduction_15
happyReduction_15 (happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut31 happy_x_2 of { happy_var_2 -> 
	case happyOut28 happy_x_3 of { happy_var_3 -> 
	case happyOut20 happy_x_5 of { happy_var_5 -> 
	happyIn11
		 (Function happy_var_2 happy_var_3 [] happy_var_5
	) `HappyStk` happyRest}}}

happyReduce_16 = happyReduce 7# 4# happyReduction_16
happyReduction_16 (happy_x_7 `HappyStk`
	happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut31 happy_x_2 of { happy_var_2 -> 
	case happyOut28 happy_x_3 of { happy_var_3 -> 
	case happyOut20 happy_x_5 of { happy_var_5 -> 
	case happyOut39 happy_x_7 of { happy_var_7 -> 
	happyIn11
		 (FunctionDef happy_var_2 happy_var_3 [] happy_var_5 happy_var_7
	) `HappyStk` happyRest}}}}

happyReduce_17 = happyReduce 4# 4# happyReduction_17
happyReduction_17 (happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut30 happy_x_2 of { happy_var_2 -> 
	case happyOut39 happy_x_4 of { happy_var_4 -> 
	happyIn11
		 (Axiom happy_var_2 happy_var_4
	) `HappyStk` happyRest}}

happyReduce_18 = happyReduce 4# 4# happyReduction_18
happyReduction_18 (happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut30 happy_x_2 of { happy_var_2 -> 
	case happyOut39 happy_x_4 of { happy_var_4 -> 
	happyIn11
		 (Lemma happy_var_2 happy_var_4
	) `HappyStk` happyRest}}

happyReduce_19 = happyReduce 4# 4# happyReduction_19
happyReduction_19 (happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut30 happy_x_2 of { happy_var_2 -> 
	case happyOut39 happy_x_4 of { happy_var_4 -> 
	happyIn11
		 (Goal happy_var_2 happy_var_4
	) `HappyStk` happyRest}}

happyReduce_20 = happyReduce 4# 4# happyReduction_20
happyReduction_20 (happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut31 happy_x_2 of { happy_var_2 -> 
	case happyOut28 happy_x_3 of { happy_var_3 -> 
	case happyOut24 happy_x_4 of { happy_var_4 -> 
	happyIn11
		 (Type happy_var_2 happy_var_3 happy_var_4
	) `HappyStk` happyRest}}}

happyReduce_21 = happyReduce 6# 4# happyReduction_21
happyReduction_21 (happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut31 happy_x_2 of { happy_var_2 -> 
	case happyOut28 happy_x_3 of { happy_var_3 -> 
	case happyOut24 happy_x_4 of { happy_var_4 -> 
	case happyOut14 happy_x_6 of { happy_var_6 -> 
	happyIn11
		 (TypeDef happy_var_2 happy_var_3 happy_var_4 happy_var_6
	) `HappyStk` happyRest}}}}

happyReduce_22 = happySpecReduce_1  5# happyReduction_22
happyReduction_22 happy_x_1
	 =  happyIn12
		 (Just Import
	)

happyReduce_23 = happySpecReduce_1  5# happyReduction_23
happyReduction_23 happy_x_1
	 =  happyIn12
		 (Just Export
	)

happyReduce_24 = happySpecReduce_0  5# happyReduction_24
happyReduction_24  =  happyIn12
		 (Nothing
	)

happyReduce_25 = happySpecReduce_0  6# happyReduction_25
happyReduction_25  =  happyIn13
		 (Nothing
	)

happyReduce_26 = happySpecReduce_2  6# happyReduction_26
happyReduction_26 happy_x_2
	happy_x_1
	 =  case happyOut33 happy_x_2 of { happy_var_2 -> 
	happyIn13
		 (Just happy_var_2
	)}

happyReduce_27 = happySpecReduce_1  7# happyReduction_27
happyReduction_27 happy_x_1
	 =  case happyOut20 happy_x_1 of { happy_var_1 -> 
	happyIn14
		 (Ty happy_var_1
	)}

happyReduce_28 = happySpecReduce_3  7# happyReduction_28
happyReduction_28 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut18 happy_x_2 of { happy_var_2 -> 
	happyIn14
		 (TyRecord $ reverse happy_var_2
	)}

happyReduce_29 = happySpecReduce_2  7# happyReduction_29
happyReduction_29 happy_x_2
	happy_x_1
	 =  case happyOut16 happy_x_2 of { happy_var_2 -> 
	happyIn14
		 (TyCase (reverse happy_var_2)
	)}

happyReduce_30 = happySpecReduce_1  8# happyReduction_30
happyReduction_30 happy_x_1
	 =  happyIn15
		 (()
	)

happyReduce_31 = happySpecReduce_0  8# happyReduction_31
happyReduction_31  =  happyIn15
		 (()
	)

happyReduce_32 = happySpecReduce_1  9# happyReduction_32
happyReduction_32 happy_x_1
	 =  case happyOut17 happy_x_1 of { happy_var_1 -> 
	happyIn16
		 ([happy_var_1]
	)}

happyReduce_33 = happySpecReduce_3  9# happyReduction_33
happyReduction_33 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut16 happy_x_1 of { happy_var_1 -> 
	case happyOut17 happy_x_3 of { happy_var_3 -> 
	happyIn16
		 (happy_var_3 : happy_var_1
	)}}

happyReduce_34 = happySpecReduce_3  10# happyReduction_34
happyReduction_34 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut33 happy_x_1 of { happy_var_1 -> 
	case happyOut28 happy_x_2 of { happy_var_2 -> 
	case happyOut25 happy_x_3 of { happy_var_3 -> 
	happyIn17
		 (TyCaseAlt happy_var_1 happy_var_2 happy_var_3
	)}}}

happyReduce_35 = happySpecReduce_1  11# happyReduction_35
happyReduction_35 happy_x_1
	 =  case happyOut19 happy_x_1 of { happy_var_1 -> 
	happyIn18
		 ([happy_var_1]
	)}

happyReduce_36 = happySpecReduce_3  11# happyReduction_36
happyReduction_36 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut18 happy_x_1 of { happy_var_1 -> 
	case happyOut19 happy_x_3 of { happy_var_3 -> 
	happyIn18
		 (happy_var_3 : happy_var_1
	)}}

happyReduce_37 = happySpecReduce_3  12# happyReduction_37
happyReduction_37 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut31 happy_x_1 of { happy_var_1 -> 
	case happyOut20 happy_x_3 of { happy_var_3 -> 
	happyIn19
		 ((happy_var_1, happy_var_3)
	)}}

happyReduce_38 = happySpecReduce_2  13# happyReduction_38
happyReduction_38 happy_x_2
	happy_x_1
	 =  case happyOut34 happy_x_1 of { happy_var_1 -> 
	case happyOut22 happy_x_2 of { happy_var_2 -> 
	happyIn20
		 (TyCon happy_var_1 (reverse happy_var_2)
	)}}

happyReduce_39 = happySpecReduce_1  13# happyReduction_39
happyReduction_39 happy_x_1
	 =  case happyOut21 happy_x_1 of { happy_var_1 -> 
	happyIn20
		 (happy_var_1
	)}

happyReduce_40 = happySpecReduce_2  14# happyReduction_40
happyReduction_40 happy_x_2
	happy_x_1
	 =  case happyOut31 happy_x_2 of { happy_var_2 -> 
	happyIn21
		 (TyVar happy_var_2
	)}

happyReduce_41 = happySpecReduce_1  14# happyReduction_41
happyReduction_41 happy_x_1
	 =  case happyOut34 happy_x_1 of { happy_var_1 -> 
	happyIn21
		 (TyCon happy_var_1 []
	)}

happyReduce_42 = happySpecReduce_3  14# happyReduction_42
happyReduction_42 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut20 happy_x_2 of { happy_var_2 -> 
	happyIn21
		 (happy_var_2
	)}

happyReduce_43 = happySpecReduce_2  14# happyReduction_43
happyReduction_43 happy_x_2
	happy_x_1
	 =  happyIn21
		 (Tuple []
	)

happyReduce_44 = happySpecReduce_3  14# happyReduction_44
happyReduction_44 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut23 happy_x_2 of { happy_var_2 -> 
	happyIn21
		 (Tuple (reverse happy_var_2)
	)}

happyReduce_45 = happySpecReduce_1  15# happyReduction_45
happyReduction_45 happy_x_1
	 =  case happyOut21 happy_x_1 of { happy_var_1 -> 
	happyIn22
		 ([happy_var_1]
	)}

happyReduce_46 = happySpecReduce_2  15# happyReduction_46
happyReduction_46 happy_x_2
	happy_x_1
	 =  case happyOut22 happy_x_1 of { happy_var_1 -> 
	case happyOut21 happy_x_2 of { happy_var_2 -> 
	happyIn22
		 (happy_var_2 : happy_var_1
	)}}

happyReduce_47 = happySpecReduce_3  16# happyReduction_47
happyReduction_47 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut20 happy_x_1 of { happy_var_1 -> 
	case happyOut20 happy_x_3 of { happy_var_3 -> 
	happyIn23
		 ([happy_var_3, happy_var_1]
	)}}

happyReduce_48 = happySpecReduce_3  16# happyReduction_48
happyReduction_48 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut23 happy_x_1 of { happy_var_1 -> 
	case happyOut20 happy_x_3 of { happy_var_3 -> 
	happyIn23
		 (happy_var_3 : happy_var_1
	)}}

happyReduce_49 = happySpecReduce_0  17# happyReduction_49
happyReduction_49  =  happyIn24
		 ([]
	)

happyReduce_50 = happyReduce 4# 17# happyReduction_50
happyReduction_50 (happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut24 happy_x_1 of { happy_var_1 -> 
	case happyOut31 happy_x_3 of { happy_var_3 -> 
	case happyOut28 happy_x_4 of { happy_var_4 -> 
	happyIn24
		 ((happy_var_3,happy_var_4) : happy_var_1
	) `HappyStk` happyRest}}}

happyReduce_51 = happySpecReduce_0  18# happyReduction_51
happyReduction_51  =  happyIn25
		 ([]
	)

happyReduce_52 = happySpecReduce_2  18# happyReduction_52
happyReduction_52 happy_x_2
	happy_x_1
	 =  case happyOut25 happy_x_1 of { happy_var_1 -> 
	case happyOut26 happy_x_2 of { happy_var_2 -> 
	happyIn25
		 (happy_var_1 ++ happy_var_2
	)}}

happyReduce_53 = happySpecReduce_1  19# happyReduction_53
happyReduction_53 happy_x_1
	 =  case happyOut21 happy_x_1 of { happy_var_1 -> 
	happyIn26
		 ([ (Nothing, happy_var_1) ]
	)}

happyReduce_54 = happyMonadReduce 5# 19# happyReduction_54
happyReduction_54 (happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest) tk
	 = happyThen (case happyOut20 happy_x_2 of { happy_var_2 -> 
	case happyOut20 happy_x_4 of { happy_var_4 -> 
	( mkTypeParam happy_var_2 >>= \xs -> return
                                                  [ (Just x, happy_var_4) | x <- xs ])}}
	) (\r -> happyReturn (happyIn26 r))

happyReduce_55 = happySpecReduce_1  20# happyReduction_55
happyReduction_55 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Token { tokenType = StrLit (Lazy.toStrict -> happy_var_1) }) -> 
	happyIn27
		 (Just happy_var_1
	)}

happyReduce_56 = happySpecReduce_0  20# happyReduction_56
happyReduction_56  =  happyIn27
		 (Nothing
	)

happyReduce_57 = happySpecReduce_1  21# happyReduction_57
happyReduction_57 happy_x_1
	 =  case happyOut29 happy_x_1 of { happy_var_1 -> 
	happyIn28
		 (reverse happy_var_1
	)}

happyReduce_58 = happySpecReduce_0  22# happyReduction_58
happyReduction_58  =  happyIn29
		 ([]
	)

happyReduce_59 = happySpecReduce_2  22# happyReduction_59
happyReduction_59 happy_x_2
	happy_x_1
	 =  case happyOut29 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_2 of { (Token { tokenType = StrLit (Lazy.toStrict -> happy_var_2) }) -> 
	happyIn29
		 (happy_var_2 : happy_var_1
	)}}

happyReduce_60 = happySpecReduce_2  23# happyReduction_60
happyReduction_60 happy_x_2
	happy_x_1
	 =  case happyOutTok happy_x_1 of { (Token { tokenType = Ident Unqual Lower, tokenText = Lazy.toStrict -> happy_var_1 }) -> 
	happyIn30
		 (happy_var_1
	)}

happyReduce_61 = happySpecReduce_2  23# happyReduction_61
happyReduction_61 happy_x_2
	happy_x_1
	 =  case happyOutTok happy_x_1 of { (Token { tokenType = Ident Unqual Upper, tokenText = Lazy.toStrict -> happy_var_1 }) -> 
	happyIn30
		 (happy_var_1
	)}

happyReduce_62 = happySpecReduce_1  24# happyReduction_62
happyReduction_62 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Token { tokenType = Ident Unqual Lower, tokenText = Lazy.toStrict -> happy_var_1 }) -> 
	happyIn31
		 (happy_var_1
	)}

happyReduce_63 = happySpecReduce_1  25# happyReduction_63
happyReduction_63 happy_x_1
	 =  case happyOut31 happy_x_1 of { happy_var_1 -> 
	happyIn32
		 ([happy_var_1]
	)}

happyReduce_64 = happySpecReduce_2  25# happyReduction_64
happyReduction_64 happy_x_2
	happy_x_1
	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
	case happyOut31 happy_x_2 of { happy_var_2 -> 
	happyIn32
		 (happy_var_2 : happy_var_1
	)}}

happyReduce_65 = happySpecReduce_1  26# happyReduction_65
happyReduction_65 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Token { tokenType = Ident Unqual Upper, tokenText = Lazy.toStrict -> happy_var_1 }) -> 
	happyIn33
		 (happy_var_1
	)}

happyReduce_66 = happySpecReduce_1  27# happyReduction_66
happyReduction_66 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Token { tokenType = Ident Unqual Lower, tokenText = Lazy.toStrict -> happy_var_1 }) -> 
	happyIn34
		 (happy_var_1
	)}

happyReduce_67 = happySpecReduce_1  27# happyReduction_67
happyReduction_67 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Token { tokenType = Ident Qual   Lower, tokenText = Lazy.toStrict -> happy_var_1 }) -> 
	happyIn34
		 (happy_var_1
	)}

happyReduce_68 = happySpecReduce_1  28# happyReduction_68
happyReduction_68 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Token { tokenType = Ident Unqual Upper, tokenText = Lazy.toStrict -> happy_var_1 }) -> 
	happyIn35
		 (happy_var_1
	)}

happyReduce_69 = happySpecReduce_1  28# happyReduction_69
happyReduction_69 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Token { tokenType = Ident Qual   Upper, tokenText = Lazy.toStrict -> happy_var_1 }) -> 
	happyIn35
		 (happy_var_1
	)}

happyReduce_70 = happySpecReduce_1  29# happyReduction_70
happyReduction_70 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Token { tokenType = Op (OtherOp 1), tokenText = Lazy.toStrict -> happy_var_1 }) -> 
	happyIn36
		 (happy_var_1
	)}

happyReduce_71 = happySpecReduce_1  29# happyReduction_71
happyReduction_71 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Token { tokenType = Op (OtherOp 2), tokenText = Lazy.toStrict -> happy_var_1 }) -> 
	happyIn36
		 (happy_var_1
	)}

happyReduce_72 = happySpecReduce_1  29# happyReduction_72
happyReduction_72 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Token { tokenType = Op (OtherOp 3), tokenText = Lazy.toStrict -> happy_var_1 }) -> 
	happyIn36
		 (happy_var_1
	)}

happyReduce_73 = happySpecReduce_1  29# happyReduction_73
happyReduction_73 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Token { tokenType = Op (OtherOp 4), tokenText = Lazy.toStrict -> happy_var_1 }) -> 
	happyIn36
		 (happy_var_1
	)}

happyReduce_74 = happySpecReduce_1  30# happyReduction_74
happyReduction_74 happy_x_1
	 =  case happyOut35 happy_x_1 of { happy_var_1 -> 
	happyIn37
		 (happy_var_1
	)}

happyReduce_75 = happySpecReduce_1  30# happyReduction_75
happyReduction_75 happy_x_1
	 =  case happyOut34 happy_x_1 of { happy_var_1 -> 
	happyIn37
		 (happy_var_1
	)}

happyReduce_76 = happySpecReduce_1  31# happyReduction_76
happyReduction_76 happy_x_1
	 =  case happyOut35 happy_x_1 of { happy_var_1 -> 
	happyIn38
		 (happy_var_1
	)}

happyReduce_77 = happySpecReduce_1  31# happyReduction_77
happyReduction_77 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Token { tokenType = TIdent,             tokenText = Lazy.toStrict -> happy_var_1 }) -> 
	happyIn38
		 (happy_var_1
	)}

happyReduce_78 = happySpecReduce_1  32# happyReduction_78
happyReduction_78 happy_x_1
	 =  case happyOut46 happy_x_1 of { happy_var_1 -> 
	happyIn39
		 (happy_var_1
	)}

happyReduce_79 = happySpecReduce_2  32# happyReduction_79
happyReduction_79 happy_x_2
	happy_x_1
	 =  case happyOut37 happy_x_1 of { happy_var_1 -> 
	case happyOut49 happy_x_2 of { happy_var_2 -> 
	happyIn39
		 (App happy_var_1 (reverse happy_var_2)
	)}}

happyReduce_80 = happySpecReduce_2  32# happyReduction_80
happyReduction_80 happy_x_2
	happy_x_1
	 =  case happyOut36 happy_x_1 of { happy_var_1 -> 
	case happyOut39 happy_x_2 of { happy_var_2 -> 
	happyIn39
		 (App happy_var_1 [happy_var_2]
	)}}

happyReduce_81 = happySpecReduce_3  32# happyReduction_81
happyReduction_81 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut39 happy_x_1 of { happy_var_1 -> 
	case happyOut39 happy_x_3 of { happy_var_3 -> 
	happyIn39
		 (App "=" [happy_var_1, happy_var_3]
	)}}

happyReduce_82 = happySpecReduce_3  32# happyReduction_82
happyReduction_82 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut39 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_2 of { (Token { tokenType = Op (OtherOp 1), tokenText = Lazy.toStrict -> happy_var_2 }) -> 
	case happyOut39 happy_x_3 of { happy_var_3 -> 
	happyIn39
		 (App happy_var_2 [happy_var_1, happy_var_3]
	)}}}

happyReduce_83 = happySpecReduce_3  32# happyReduction_83
happyReduction_83 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut39 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_2 of { (Token { tokenType = Op (OtherOp 2), tokenText = Lazy.toStrict -> happy_var_2 }) -> 
	case happyOut39 happy_x_3 of { happy_var_3 -> 
	happyIn39
		 (App happy_var_2 [happy_var_1, happy_var_3]
	)}}}

happyReduce_84 = happySpecReduce_3  32# happyReduction_84
happyReduction_84 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut39 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_2 of { (Token { tokenType = Op (OtherOp 3), tokenText = Lazy.toStrict -> happy_var_2 }) -> 
	case happyOut39 happy_x_3 of { happy_var_3 -> 
	happyIn39
		 (App happy_var_2 [happy_var_1, happy_var_3]
	)}}}

happyReduce_85 = happySpecReduce_3  32# happyReduction_85
happyReduction_85 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut39 happy_x_1 of { happy_var_1 -> 
	case happyOutTok happy_x_2 of { (Token { tokenType = Op (OtherOp 4), tokenText = Lazy.toStrict -> happy_var_2 }) -> 
	case happyOut39 happy_x_3 of { happy_var_3 -> 
	happyIn39
		 (App happy_var_2 [happy_var_1, happy_var_3]
	)}}}

happyReduce_86 = happySpecReduce_3  32# happyReduction_86
happyReduction_86 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut39 happy_x_1 of { happy_var_1 -> 
	case happyOut34 happy_x_3 of { happy_var_3 -> 
	happyIn39
		 (Field happy_var_3 happy_var_1
	)}}

happyReduce_87 = happyReduce 6# 32# happyReduction_87
happyReduction_87 (happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut39 happy_x_2 of { happy_var_2 -> 
	case happyOut39 happy_x_4 of { happy_var_4 -> 
	case happyOut39 happy_x_6 of { happy_var_6 -> 
	happyIn39
		 (If happy_var_2 happy_var_4 happy_var_6
	) `HappyStk` happyRest}}}

happyReduce_88 = happyReduce 6# 32# happyReduction_88
happyReduction_88 (happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut53 happy_x_2 of { happy_var_2 -> 
	case happyOut54 happy_x_5 of { happy_var_5 -> 
	happyIn39
		 (Match (reverse happy_var_2) (reverse happy_var_5)
	) `HappyStk` happyRest}}

happyReduce_89 = happyReduce 6# 32# happyReduction_89
happyReduction_89 (happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut50 happy_x_2 of { happy_var_2 -> 
	case happyOut39 happy_x_4 of { happy_var_4 -> 
	case happyOut39 happy_x_6 of { happy_var_6 -> 
	happyIn39
		 (Let happy_var_2 happy_var_4 happy_var_6
	) `HappyStk` happyRest}}}

happyReduce_90 = happySpecReduce_3  32# happyReduction_90
happyReduction_90 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut39 happy_x_1 of { happy_var_1 -> 
	case happyOut39 happy_x_3 of { happy_var_3 -> 
	happyIn39
		 (Conn Implies happy_var_1 happy_var_3
	)}}

happyReduce_91 = happySpecReduce_3  32# happyReduction_91
happyReduction_91 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut39 happy_x_1 of { happy_var_1 -> 
	case happyOut39 happy_x_3 of { happy_var_3 -> 
	happyIn39
		 (Conn Iff happy_var_1 happy_var_3
	)}}

happyReduce_92 = happySpecReduce_3  32# happyReduction_92
happyReduction_92 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut39 happy_x_1 of { happy_var_1 -> 
	case happyOut39 happy_x_3 of { happy_var_3 -> 
	happyIn39
		 (Conn And happy_var_1 happy_var_3
	)}}

happyReduce_93 = happySpecReduce_3  32# happyReduction_93
happyReduction_93 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut39 happy_x_1 of { happy_var_1 -> 
	case happyOut39 happy_x_3 of { happy_var_3 -> 
	happyIn39
		 (Conn AsymAnd happy_var_1 happy_var_3
	)}}

happyReduce_94 = happySpecReduce_3  32# happyReduction_94
happyReduction_94 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut39 happy_x_1 of { happy_var_1 -> 
	case happyOut39 happy_x_3 of { happy_var_3 -> 
	happyIn39
		 (Conn Or happy_var_1 happy_var_3
	)}}

happyReduce_95 = happySpecReduce_3  32# happyReduction_95
happyReduction_95 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut39 happy_x_1 of { happy_var_1 -> 
	case happyOut39 happy_x_3 of { happy_var_3 -> 
	happyIn39
		 (Conn AsymOr happy_var_1 happy_var_3
	)}}

happyReduce_96 = happySpecReduce_3  32# happyReduction_96
happyReduction_96 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut39 happy_x_1 of { happy_var_1 -> 
	case happyOut20 happy_x_3 of { happy_var_3 -> 
	happyIn39
		 (Cast happy_var_1 happy_var_3
	)}}

happyReduce_97 = happySpecReduce_2  32# happyReduction_97
happyReduction_97 happy_x_2
	happy_x_1
	 =  case happyOutTok happy_x_1 of { (Token { tokenType = StrLit (Lazy.toStrict -> happy_var_1) }) -> 
	case happyOut39 happy_x_2 of { happy_var_2 -> 
	happyIn39
		 (Labeled happy_var_1 happy_var_2
	)}}

happyReduce_98 = happySpecReduce_2  32# happyReduction_98
happyReduction_98 happy_x_2
	happy_x_1
	 =  case happyOut39 happy_x_2 of { happy_var_2 -> 
	happyIn39
		 (Not happy_var_2
	)}

happyReduce_99 = happyReduce 5# 32# happyReduction_99
happyReduction_99 (happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut40 happy_x_1 of { happy_var_1 -> 
	case happyOut42 happy_x_2 of { happy_var_2 -> 
	case happyOut43 happy_x_3 of { happy_var_3 -> 
	case happyOut39 happy_x_5 of { happy_var_5 -> 
	happyIn39
		 (Quant happy_var_1 (concat (reverse happy_var_2)) happy_var_3 happy_var_5
	) `HappyStk` happyRest}}}}

happyReduce_100 = happySpecReduce_1  33# happyReduction_100
happyReduction_100 happy_x_1
	 =  happyIn40
		 (Forall
	)

happyReduce_101 = happySpecReduce_1  33# happyReduction_101
happyReduction_101 happy_x_1
	 =  happyIn40
		 (Exists
	)

happyReduce_102 = happySpecReduce_3  34# happyReduction_102
happyReduction_102 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut32 happy_x_1 of { happy_var_1 -> 
	case happyOut20 happy_x_3 of { happy_var_3 -> 
	happyIn41
		 ([ (x,happy_var_3) | x <- reverse happy_var_1 ]
	)}}

happyReduce_103 = happySpecReduce_1  35# happyReduction_103
happyReduction_103 happy_x_1
	 =  case happyOut41 happy_x_1 of { happy_var_1 -> 
	happyIn42
		 ([happy_var_1]
	)}

happyReduce_104 = happySpecReduce_3  35# happyReduction_104
happyReduction_104 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut42 happy_x_1 of { happy_var_1 -> 
	case happyOut41 happy_x_3 of { happy_var_3 -> 
	happyIn42
		 (happy_var_3 : happy_var_1
	)}}

happyReduce_105 = happySpecReduce_0  36# happyReduction_105
happyReduction_105  =  happyIn43
		 ([]
	)

happyReduce_106 = happySpecReduce_3  36# happyReduction_106
happyReduction_106 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut44 happy_x_2 of { happy_var_2 -> 
	happyIn43
		 (reverse happy_var_2
	)}

happyReduce_107 = happySpecReduce_1  37# happyReduction_107
happyReduction_107 happy_x_1
	 =  case happyOut45 happy_x_1 of { happy_var_1 -> 
	happyIn44
		 ([reverse happy_var_1]
	)}

happyReduce_108 = happySpecReduce_3  37# happyReduction_108
happyReduction_108 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut44 happy_x_1 of { happy_var_1 -> 
	case happyOut45 happy_x_3 of { happy_var_3 -> 
	happyIn44
		 (reverse happy_var_3 : happy_var_1
	)}}

happyReduce_109 = happySpecReduce_1  38# happyReduction_109
happyReduction_109 happy_x_1
	 =  case happyOut39 happy_x_1 of { happy_var_1 -> 
	happyIn45
		 ([happy_var_1]
	)}

happyReduce_110 = happySpecReduce_3  38# happyReduction_110
happyReduction_110 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut45 happy_x_1 of { happy_var_1 -> 
	case happyOut39 happy_x_3 of { happy_var_3 -> 
	happyIn45
		 (happy_var_3 : happy_var_1
	)}}

happyReduce_111 = happySpecReduce_1  39# happyReduction_111
happyReduction_111 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Token { tokenType = Num happy_var_1 _ }) -> 
	happyIn46
		 (Lit $ Integer happy_var_1
	)}

happyReduce_112 = happySpecReduce_1  39# happyReduction_112
happyReduction_112 happy_x_1
	 =  case happyOutTok happy_x_1 of { (Token { tokenType = RealTok, tokenText = Lazy.toStrict -> happy_var_1 }) -> 
	happyIn46
		 (Lit $ Real happy_var_1
	)}

happyReduce_113 = happySpecReduce_1  39# happyReduction_113
happyReduction_113 happy_x_1
	 =  happyIn46
		 (Lit $ Bool True
	)

happyReduce_114 = happySpecReduce_1  39# happyReduction_114
happyReduction_114 happy_x_1
	 =  happyIn46
		 (Lit $ Bool False
	)

happyReduce_115 = happySpecReduce_1  39# happyReduction_115
happyReduction_115 happy_x_1
	 =  case happyOut37 happy_x_1 of { happy_var_1 -> 
	happyIn46
		 (App happy_var_1 []
	)}

happyReduce_116 = happySpecReduce_2  39# happyReduction_116
happyReduction_116 happy_x_2
	happy_x_1
	 =  case happyOutTok happy_x_1 of { (Token { tokenType = Op BangOp,      tokenText = Lazy.toStrict -> happy_var_1 }) -> 
	case happyOut46 happy_x_2 of { happy_var_2 -> 
	happyIn46
		 (App happy_var_1 [happy_var_2]
	)}}

happyReduce_117 = happyReduce 4# 39# happyReduction_117
happyReduction_117 (happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut46 happy_x_1 of { happy_var_1 -> 
	case happyOut39 happy_x_3 of { happy_var_3 -> 
	happyIn46
		 (App "[]" [happy_var_1, happy_var_3]
	) `HappyStk` happyRest}}

happyReduce_118 = happyReduce 6# 39# happyReduction_118
happyReduction_118 (happy_x_6 `HappyStk`
	happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut46 happy_x_1 of { happy_var_1 -> 
	case happyOut39 happy_x_3 of { happy_var_3 -> 
	case happyOut39 happy_x_5 of { happy_var_5 -> 
	happyIn46
		 (App "[<-]" [happy_var_1, happy_var_3, happy_var_5]
	) `HappyStk` happyRest}}}

happyReduce_119 = happySpecReduce_3  39# happyReduction_119
happyReduction_119 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut39 happy_x_2 of { happy_var_2 -> 
	happyIn46
		 (happy_var_2
	)}

happyReduce_120 = happySpecReduce_3  39# happyReduction_120
happyReduction_120 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut47 happy_x_2 of { happy_var_2 -> 
	happyIn46
		 (Record (reverse happy_var_2)
	)}

happyReduce_121 = happyReduce 5# 39# happyReduction_121
happyReduction_121 (happy_x_5 `HappyStk`
	happy_x_4 `HappyStk`
	happy_x_3 `HappyStk`
	happy_x_2 `HappyStk`
	happy_x_1 `HappyStk`
	happyRest)
	 = case happyOut39 happy_x_2 of { happy_var_2 -> 
	case happyOut47 happy_x_4 of { happy_var_4 -> 
	happyIn46
		 (RecordUpdate happy_var_2 (reverse happy_var_4)
	) `HappyStk` happyRest}}

happyReduce_122 = happySpecReduce_1  40# happyReduction_122
happyReduction_122 happy_x_1
	 =  case happyOut48 happy_x_1 of { happy_var_1 -> 
	happyIn47
		 ([happy_var_1]
	)}

happyReduce_123 = happySpecReduce_3  40# happyReduction_123
happyReduction_123 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut47 happy_x_1 of { happy_var_1 -> 
	case happyOut48 happy_x_3 of { happy_var_3 -> 
	happyIn47
		 (happy_var_3 : happy_var_1
	)}}

happyReduce_124 = happySpecReduce_3  41# happyReduction_124
happyReduction_124 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut34 happy_x_1 of { happy_var_1 -> 
	case happyOut39 happy_x_3 of { happy_var_3 -> 
	happyIn48
		 ((happy_var_1,happy_var_3)
	)}}

happyReduce_125 = happySpecReduce_1  42# happyReduction_125
happyReduction_125 happy_x_1
	 =  case happyOut46 happy_x_1 of { happy_var_1 -> 
	happyIn49
		 ([happy_var_1]
	)}

happyReduce_126 = happySpecReduce_2  42# happyReduction_126
happyReduction_126 happy_x_2
	happy_x_1
	 =  case happyOut49 happy_x_1 of { happy_var_1 -> 
	case happyOut46 happy_x_2 of { happy_var_2 -> 
	happyIn49
		 (happy_var_2 : happy_var_1
	)}}

happyReduce_127 = happySpecReduce_1  43# happyReduction_127
happyReduction_127 happy_x_1
	 =  case happyOut51 happy_x_1 of { happy_var_1 -> 
	happyIn50
		 (happy_var_1
	)}

happyReduce_128 = happySpecReduce_2  43# happyReduction_128
happyReduction_128 happy_x_2
	happy_x_1
	 =  case happyOut33 happy_x_1 of { happy_var_1 -> 
	case happyOut52 happy_x_2 of { happy_var_2 -> 
	happyIn50
		 (PCon happy_var_1 (reverse happy_var_2)
	)}}

happyReduce_129 = happySpecReduce_1  44# happyReduction_129
happyReduction_129 happy_x_1
	 =  happyIn51
		 (PWild
	)

happyReduce_130 = happySpecReduce_1  44# happyReduction_130
happyReduction_130 happy_x_1
	 =  case happyOut31 happy_x_1 of { happy_var_1 -> 
	happyIn51
		 (PVar happy_var_1
	)}

happyReduce_131 = happySpecReduce_1  44# happyReduction_131
happyReduction_131 happy_x_1
	 =  case happyOut33 happy_x_1 of { happy_var_1 -> 
	happyIn51
		 (PCon happy_var_1 []
	)}

happyReduce_132 = happySpecReduce_3  44# happyReduction_132
happyReduction_132 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut50 happy_x_2 of { happy_var_2 -> 
	happyIn51
		 (happy_var_2
	)}

happyReduce_133 = happySpecReduce_1  45# happyReduction_133
happyReduction_133 happy_x_1
	 =  case happyOut51 happy_x_1 of { happy_var_1 -> 
	happyIn52
		 ([happy_var_1]
	)}

happyReduce_134 = happySpecReduce_2  45# happyReduction_134
happyReduction_134 happy_x_2
	happy_x_1
	 =  case happyOut52 happy_x_1 of { happy_var_1 -> 
	case happyOut51 happy_x_2 of { happy_var_2 -> 
	happyIn52
		 (happy_var_2 : happy_var_1
	)}}

happyReduce_135 = happySpecReduce_1  46# happyReduction_135
happyReduction_135 happy_x_1
	 =  case happyOut39 happy_x_1 of { happy_var_1 -> 
	happyIn53
		 ([happy_var_1]
	)}

happyReduce_136 = happySpecReduce_3  46# happyReduction_136
happyReduction_136 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut53 happy_x_1 of { happy_var_1 -> 
	case happyOut39 happy_x_3 of { happy_var_3 -> 
	happyIn53
		 (happy_var_3 : happy_var_1
	)}}

happyReduce_137 = happySpecReduce_1  47# happyReduction_137
happyReduction_137 happy_x_1
	 =  case happyOut55 happy_x_1 of { happy_var_1 -> 
	happyIn54
		 ([happy_var_1]
	)}

happyReduce_138 = happySpecReduce_3  47# happyReduction_138
happyReduction_138 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut54 happy_x_1 of { happy_var_1 -> 
	case happyOut55 happy_x_3 of { happy_var_3 -> 
	happyIn54
		 (happy_var_3 : happy_var_1
	)}}

happyReduce_139 = happySpecReduce_3  48# happyReduction_139
happyReduction_139 happy_x_3
	happy_x_2
	happy_x_1
	 =  case happyOut50 happy_x_1 of { happy_var_1 -> 
	case happyOut39 happy_x_3 of { happy_var_3 -> 
	happyIn55
		 ((happy_var_1, happy_var_3)
	)}}

happyNewToken action sts stk
	= lexerP(\tk -> 
	let cont i = happyDoAction i tk action sts stk in
	case tk of {
	Token { tokenType = EOF } -> happyDoAction 60# tk action sts stk;
	Token { tokenType = Num happy_dollar_dollar _ } -> cont 1#;
	Token { tokenType = RealTok, tokenText = Lazy.toStrict -> happy_dollar_dollar } -> cont 2#;
	Token { tokenType = StrLit (Lazy.toStrict -> happy_dollar_dollar) } -> cont 3#;
	Token { tokenType = Ident Unqual Lower, tokenText = Lazy.toStrict -> happy_dollar_dollar } -> cont 4#;
	Token { tokenType = Ident Unqual Upper, tokenText = Lazy.toStrict -> happy_dollar_dollar } -> cont 5#;
	Token { tokenType = Ident Qual   Lower, tokenText = Lazy.toStrict -> happy_dollar_dollar } -> cont 6#;
	Token { tokenType = Ident Qual   Upper, tokenText = Lazy.toStrict -> happy_dollar_dollar } -> cont 7#;
	Token { tokenType = TIdent,             tokenText = Lazy.toStrict -> happy_dollar_dollar } -> cont 8#;
	Token { tokenType = Op BangOp,      tokenText = Lazy.toStrict -> happy_dollar_dollar } -> cont 9#;
	Token { tokenType = Op (OtherOp 4), tokenText = Lazy.toStrict -> happy_dollar_dollar } -> cont 10#;
	Token { tokenType = Op (OtherOp 3), tokenText = Lazy.toStrict -> happy_dollar_dollar } -> cont 11#;
	Token { tokenType = Op (OtherOp 2), tokenText = Lazy.toStrict -> happy_dollar_dollar } -> cont 12#;
	Token { tokenType = Op (OtherOp 1), tokenText = Lazy.toStrict -> happy_dollar_dollar } -> cont 13#;
	Token { tokenType = Sym BracketL, tokenPos = happy_dollar_dollar } -> cont 14#;
	Token { tokenType = Sym BracketR, tokenPos = happy_dollar_dollar } -> cont 15#;
	Token { tokenType = Sym ParenL  , tokenPos = happy_dollar_dollar } -> cont 16#;
	Token { tokenType = Sym ParenR  , tokenPos = happy_dollar_dollar } -> cont 17#;
	Token { tokenType = Sym CurlyL  , tokenPos = happy_dollar_dollar } -> cont 18#;
	Token { tokenType = Sym CurlyR  , tokenPos = happy_dollar_dollar } -> cont 19#;
	Token { tokenType = Sym Underscore, tokenPos = happy_dollar_dollar } -> cont 20#;
	Token { tokenType = Sym Eq, tokenPos = happy_dollar_dollar } -> cont 21#;
	Token { tokenType = Sym Quote, tokenPos = happy_dollar_dollar } -> cont 22#;
	Token { tokenType = Sym Comma, tokenPos = happy_dollar_dollar } -> cont 23#;
	Token { tokenType = Sym Dot, tokenPos = happy_dollar_dollar } -> cont 24#;
	Token { tokenType = Sym Colon, tokenPos = happy_dollar_dollar } -> cont 25#;
	Token { tokenType = Sym Semi, tokenPos = happy_dollar_dollar } -> cont 26#;
	Token { tokenType = Sym Bar, tokenPos = happy_dollar_dollar } -> cont 27#;
	Token { tokenType = Op ArrowL, tokenPos = happy_dollar_dollar } -> cont 28#;
	Token { tokenType = Op ArrowR, tokenPos = happy_dollar_dollar } -> cont 29#;
	Token { tokenType = Op ArrowLR, tokenPos = happy_dollar_dollar } -> cont 30#;
	Token { tokenType = KW KW_theory, tokenPos = happy_dollar_dollar } -> cont 31#;
	Token { tokenType = KW KW_end,    tokenPos = happy_dollar_dollar } -> cont 32#;
	Token { tokenType = KW KW_goal,   tokenPos = happy_dollar_dollar } -> cont 33#;
	Token { tokenType = KW KW_use,    tokenPos = happy_dollar_dollar } -> cont 34#;
	Token { tokenType = KW KW_import, tokenPos = happy_dollar_dollar } -> cont 35#;
	Token { tokenType = KW KW_export, tokenPos = happy_dollar_dollar } -> cont 36#;
	Token { tokenType = KW KW_predicate, tokenPos = happy_dollar_dollar } -> cont 37#;
	Token { tokenType = KW KW_function, tokenPos = happy_dollar_dollar } -> cont 38#;
	Token { tokenType = KW KW_constant, tokenPos = happy_dollar_dollar } -> cont 39#;
	Token { tokenType = KW KW_axiom, tokenPos = happy_dollar_dollar } -> cont 40#;
	Token { tokenType = KW KW_lemma, tokenPos = happy_dollar_dollar } -> cont 41#;
	Token { tokenType = KW KW_type, tokenPos = happy_dollar_dollar } -> cont 42#;
	Token { tokenType = KW KW_with, tokenPos = happy_dollar_dollar } -> cont 43#;
	Token { tokenType = KW KW_as,     tokenPos = happy_dollar_dollar } -> cont 44#;
	Token { tokenType = KW KW_true,  tokenPos = happy_dollar_dollar } -> cont 45#;
	Token { tokenType = KW KW_false, tokenPos = happy_dollar_dollar } -> cont 46#;
	Token { tokenType = KW KW_forall,tokenPos = happy_dollar_dollar } -> cont 47#;
	Token { tokenType = KW KW_exists,tokenPos = happy_dollar_dollar } -> cont 48#;
	Token { tokenType = KW KW_not,   tokenPos = happy_dollar_dollar } -> cont 49#;
	Token { tokenType = Op Disj,     tokenPos = happy_dollar_dollar } -> cont 50#;
	Token { tokenType = Op AsymDisj, tokenPos = happy_dollar_dollar } -> cont 51#;
	Token { tokenType = Op Conj,     tokenPos = happy_dollar_dollar } -> cont 52#;
	Token { tokenType = Op AsymConj, tokenPos = happy_dollar_dollar } -> cont 53#;
	Token { tokenType = KW KW_if, tokenPos = happy_dollar_dollar } -> cont 54#;
	Token { tokenType = KW KW_match, tokenPos = happy_dollar_dollar } -> cont 55#;
	Token { tokenType = KW KW_then, tokenPos = happy_dollar_dollar } -> cont 56#;
	Token { tokenType = KW KW_else, tokenPos = happy_dollar_dollar } -> cont 57#;
	Token { tokenType = KW KW_let, tokenPos = happy_dollar_dollar } -> cont 58#;
	Token { tokenType = KW KW_in, tokenPos = happy_dollar_dollar } -> cont 59#;
	_ -> happyError' tk
	})

happyError_ 60# tk = happyError' tk
happyError_ _ tk = happyError' tk

happyThen :: () => ParseM a -> (a -> ParseM b) -> ParseM b
happyThen = (>>=)
happyReturn :: () => a -> ParseM a
happyReturn = (return)
happyThen1 = happyThen
happyReturn1 :: () => a -> ParseM a
happyReturn1 = happyReturn
happyError' :: () => (Token) -> ParseM a
happyError' tk = (\token -> happyError) tk

theories = happySomeParser where
  happySomeParser = happyThen (happyParse 0#) (\x -> happyReturn (happyOut7 x))

theory = happySomeParser where
  happySomeParser = happyThen (happyParse 1#) (\x -> happyReturn (happyOut9 x))

pType = happySomeParser where
  happySomeParser = happyThen (happyParse 2#) (\x -> happyReturn (happyOut20 x))

expr = happySomeParser where
  happySomeParser = happyThen (happyParse 3#) (\x -> happyReturn (happyOut39 x))

happySeq = happyDontSeq


mkTypeParam :: Type -> ParseM [Name]
mkTypeParam ty =
  case ty of
    TyCon x ts | notQual x && all simpleTyCon ts ->
        return (x : [ y | TyCon y [] <- ts ])
    _ -> fail "Malformed type-parameters"
  where
  simpleTyCon (TyCon x []) = notQual x
  simpleTyCon _            = False
  notQual nm               = not (Text.any (== '.') nm)

textPos :: Position -> String
textPos p = show (line p) ++ ":" ++ show (col p)

happyError :: ParseM a
happyError = P $ \ts ->
  Left $ "Parser error around " ++
  case ts of
    t : _ -> textPos (tokenPos t)
    []    -> "the end of the file"

data ParseM a   = P { unP :: [Token] -> Either String (a,[Token]) }

instance Functor ParseM where
  fmap = liftM

instance A.Applicative ParseM where
  pure  = return
  (<*>) = ap

instance Monad ParseM where
  return a  = P (\x -> Right (a,x))
  fail x    = P (\_ -> Left x)
  P m >>= f = P (\x -> case m x of
                         Left err -> Left err
                         Right (a,y)  -> unP (f a) y)


lexerP :: (Token -> ParseM a) -> ParseM a
lexerP k = P $ \ts ->
  case ts of
    Token { tokenType = Err e, tokenText = txt } : _ ->
      Left $
        case e of
          UnterminatedComment -> "unterminated comment"
          UnterminatedString  -> "unterminated string"
          UnterminatedChar    -> "unterminated character"
          InvalidString       -> "invalid string literal: " ++ Lazy.unpack txt
          LexicalError        -> "unexpected symbol"

    t : more -> unP (k t) more
    []       -> Left "unexpected end of file"

parse :: ParseM a -> BS.ByteString -> Either String a
parse p txt = case unP p (lexer txt) of
                Left err -> Left err
                Right (a,_) -> Right a
{-# LINE 1 "templates/GenericTemplate.hs" #-}
{-# LINE 1 "templates/GenericTemplate.hs" #-}
{-# LINE 1 "<command-line>" #-}
{-# LINE 10 "<command-line>" #-}
# 1 "/usr/include/stdc-predef.h" 1 3 4

# 17 "/usr/include/stdc-predef.h" 3 4










































{-# LINE 10 "<command-line>" #-}
{-# LINE 1 "templates/GenericTemplate.hs" #-}
-- Id: GenericTemplate.hs,v 1.26 2005/01/14 14:47:22 simonmar Exp 

{-# LINE 13 "templates/GenericTemplate.hs" #-}





-- Do not remove this comment. Required to fix CPP parsing when using GCC and a clang-compiled alex.
#if __GLASGOW_HASKELL__ > 706
#define LT(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.<# m)) :: Bool)
#define GTE(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.>=# m)) :: Bool)
#define EQ(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.==# m)) :: Bool)
#else
#define LT(n,m) (n Happy_GHC_Exts.<# m)
#define GTE(n,m) (n Happy_GHC_Exts.>=# m)
#define EQ(n,m) (n Happy_GHC_Exts.==# m)
#endif
{-# LINE 46 "templates/GenericTemplate.hs" #-}


data Happy_IntList = HappyCons Happy_GHC_Exts.Int# Happy_IntList





{-# LINE 67 "templates/GenericTemplate.hs" #-}

{-# LINE 77 "templates/GenericTemplate.hs" #-}

{-# LINE 86 "templates/GenericTemplate.hs" #-}

infixr 9 `HappyStk`
data HappyStk a = HappyStk a (HappyStk a)

-----------------------------------------------------------------------------
-- starting the parse

happyParse start_state = happyNewToken start_state notHappyAtAll notHappyAtAll

-----------------------------------------------------------------------------
-- Accepting the parse

-- If the current token is 0#, it means we've just accepted a partial
-- parse (a %partial parser).  We must ignore the saved token on the top of
-- the stack in this case.
happyAccept 0# tk st sts (_ `HappyStk` ans `HappyStk` _) =
        happyReturn1 ans
happyAccept j tk st sts (HappyStk ans _) = 
        (happyTcHack j (happyTcHack st)) (happyReturn1 ans)

-----------------------------------------------------------------------------
-- Arrays only: do the next action



happyDoAction i tk st
        = {- nothing -}


          case action of
                0#           -> {- nothing -}
                                     happyFail i tk st
                -1#          -> {- nothing -}
                                     happyAccept i tk st
                n | LT(n,(0# :: Happy_GHC_Exts.Int#)) -> {- nothing -}

                                                   (happyReduceArr Happy_Data_Array.! rule) i tk st
                                                   where rule = (Happy_GHC_Exts.I# ((Happy_GHC_Exts.negateInt# ((n Happy_GHC_Exts.+# (1# :: Happy_GHC_Exts.Int#))))))
                n                 -> {- nothing -}


                                     happyShift new_state i tk st
                                     where new_state = (n Happy_GHC_Exts.-# (1# :: Happy_GHC_Exts.Int#))
   where off    = indexShortOffAddr happyActOffsets st
         off_i  = (off Happy_GHC_Exts.+# i)
         check  = if GTE(off_i,(0# :: Happy_GHC_Exts.Int#))
                  then EQ(indexShortOffAddr happyCheck off_i, i)
                  else False
         action
          | check     = indexShortOffAddr happyTable off_i
          | otherwise = indexShortOffAddr happyDefActions st


indexShortOffAddr (HappyA# arr) off =
        Happy_GHC_Exts.narrow16Int# i
  where
        i = Happy_GHC_Exts.word2Int# (Happy_GHC_Exts.or# (Happy_GHC_Exts.uncheckedShiftL# high 8#) low)
        high = Happy_GHC_Exts.int2Word# (Happy_GHC_Exts.ord# (Happy_GHC_Exts.indexCharOffAddr# arr (off' Happy_GHC_Exts.+# 1#)))
        low  = Happy_GHC_Exts.int2Word# (Happy_GHC_Exts.ord# (Happy_GHC_Exts.indexCharOffAddr# arr off'))
        off' = off Happy_GHC_Exts.*# 2#





data HappyAddr = HappyA# Happy_GHC_Exts.Addr#




-----------------------------------------------------------------------------
-- HappyState data type (not arrays)

{-# LINE 170 "templates/GenericTemplate.hs" #-}

-----------------------------------------------------------------------------
-- Shifting a token

happyShift new_state 0# tk st sts stk@(x `HappyStk` _) =
     let i = (case Happy_GHC_Exts.unsafeCoerce# x of { (Happy_GHC_Exts.I# (i)) -> i }) in
--     trace "shifting the error token" $
     happyDoAction i tk new_state (HappyCons (st) (sts)) (stk)

happyShift new_state i tk st sts stk =
     happyNewToken new_state (HappyCons (st) (sts)) ((happyInTok (tk))`HappyStk`stk)

-- happyReduce is specialised for the common cases.

happySpecReduce_0 i fn 0# tk st sts stk
     = happyFail 0# tk st sts stk
happySpecReduce_0 nt fn j tk st@((action)) sts stk
     = happyGoto nt j tk st (HappyCons (st) (sts)) (fn `HappyStk` stk)

happySpecReduce_1 i fn 0# tk st sts stk
     = happyFail 0# tk st sts stk
happySpecReduce_1 nt fn j tk _ sts@((HappyCons (st@(action)) (_))) (v1`HappyStk`stk')
     = let r = fn v1 in
       happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))

happySpecReduce_2 i fn 0# tk st sts stk
     = happyFail 0# tk st sts stk
happySpecReduce_2 nt fn j tk _ (HappyCons (_) (sts@((HappyCons (st@(action)) (_))))) (v1`HappyStk`v2`HappyStk`stk')
     = let r = fn v1 v2 in
       happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))

happySpecReduce_3 i fn 0# tk st sts stk
     = happyFail 0# tk st sts stk
happySpecReduce_3 nt fn j tk _ (HappyCons (_) ((HappyCons (_) (sts@((HappyCons (st@(action)) (_))))))) (v1`HappyStk`v2`HappyStk`v3`HappyStk`stk')
     = let r = fn v1 v2 v3 in
       happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))

happyReduce k i fn 0# tk st sts stk
     = happyFail 0# tk st sts stk
happyReduce k nt fn j tk st sts stk
     = case happyDrop (k Happy_GHC_Exts.-# (1# :: Happy_GHC_Exts.Int#)) sts of
         sts1@((HappyCons (st1@(action)) (_))) ->
                let r = fn stk in  -- it doesn't hurt to always seq here...
                happyDoSeq r (happyGoto nt j tk st1 sts1 r)

happyMonadReduce k nt fn 0# tk st sts stk
     = happyFail 0# tk st sts stk
happyMonadReduce k nt fn j tk st sts stk =
      case happyDrop k (HappyCons (st) (sts)) of
        sts1@((HappyCons (st1@(action)) (_))) ->
          let drop_stk = happyDropStk k stk in
          happyThen1 (fn stk tk) (\r -> happyGoto nt j tk st1 sts1 (r `HappyStk` drop_stk))

happyMonad2Reduce k nt fn 0# tk st sts stk
     = happyFail 0# tk st sts stk
happyMonad2Reduce k nt fn j tk st sts stk =
      case happyDrop k (HappyCons (st) (sts)) of
        sts1@((HappyCons (st1@(action)) (_))) ->
         let drop_stk = happyDropStk k stk

             off = indexShortOffAddr happyGotoOffsets st1
             off_i = (off Happy_GHC_Exts.+# nt)
             new_state = indexShortOffAddr happyTable off_i



          in
          happyThen1 (fn stk tk) (\r -> happyNewToken new_state sts1 (r `HappyStk` drop_stk))

happyDrop 0# l = l
happyDrop n (HappyCons (_) (t)) = happyDrop (n Happy_GHC_Exts.-# (1# :: Happy_GHC_Exts.Int#)) t

happyDropStk 0# l = l
happyDropStk n (x `HappyStk` xs) = happyDropStk (n Happy_GHC_Exts.-# (1#::Happy_GHC_Exts.Int#)) xs

-----------------------------------------------------------------------------
-- Moving to a new state after a reduction


happyGoto nt j tk st = 
   {- nothing -}
   happyDoAction j tk new_state
   where off = indexShortOffAddr happyGotoOffsets st
         off_i = (off Happy_GHC_Exts.+# nt)
         new_state = indexShortOffAddr happyTable off_i




-----------------------------------------------------------------------------
-- Error recovery (0# is the error token)

-- parse error if we are in recovery and we fail again
happyFail 0# tk old_st _ stk@(x `HappyStk` _) =
     let i = (case Happy_GHC_Exts.unsafeCoerce# x of { (Happy_GHC_Exts.I# (i)) -> i }) in
--      trace "failing" $ 
        happyError_ i tk

{-  We don't need state discarding for our restricted implementation of
    "error".  In fact, it can cause some bogus parses, so I've disabled it
    for now --SDM

-- discard a state
happyFail  0# tk old_st (HappyCons ((action)) (sts)) 
                                                (saved_tok `HappyStk` _ `HappyStk` stk) =
--      trace ("discarding state, depth " ++ show (length stk))  $
        happyDoAction 0# tk action sts ((saved_tok`HappyStk`stk))
-}

-- Enter error recovery: generate an error token,
--                       save the old token and carry on.
happyFail  i tk (action) sts stk =
--      trace "entering error recovery" $
        happyDoAction 0# tk action sts ( (Happy_GHC_Exts.unsafeCoerce# (Happy_GHC_Exts.I# (i))) `HappyStk` stk)

-- Internal happy errors:

notHappyAtAll :: a
notHappyAtAll = error "Internal Happy error\n"

-----------------------------------------------------------------------------
-- Hack to get the typechecker to accept our action functions


happyTcHack :: Happy_GHC_Exts.Int# -> a -> a
happyTcHack x y = y
{-# INLINE happyTcHack #-}


-----------------------------------------------------------------------------
-- Seq-ing.  If the --strict flag is given, then Happy emits 
--      happySeq = happyDoSeq
-- otherwise it emits
--      happySeq = happyDontSeq

happyDoSeq, happyDontSeq :: a -> b -> b
happyDoSeq   a b = a `seq` b
happyDontSeq a b = b

-----------------------------------------------------------------------------
-- Don't inline any functions from the template.  GHC has a nasty habit
-- of deciding to inline happyGoto everywhere, which increases the size of
-- the generated parser quite a bit.


{-# NOINLINE happyDoAction #-}
{-# NOINLINE happyTable #-}
{-# NOINLINE happyCheck #-}
{-# NOINLINE happyActOffsets #-}
{-# NOINLINE happyGotoOffsets #-}
{-# NOINLINE happyDefActions #-}

{-# NOINLINE happyShift #-}
{-# NOINLINE happySpecReduce_0 #-}
{-# NOINLINE happySpecReduce_1 #-}
{-# NOINLINE happySpecReduce_2 #-}
{-# NOINLINE happySpecReduce_3 #-}
{-# NOINLINE happyReduce #-}
{-# NOINLINE happyMonadReduce #-}
{-# NOINLINE happyGoto #-}
{-# NOINLINE happyFail #-}

-- end of Happy Template.