{-# OPTIONS_GHC -w #-}
{-# OPTIONS -XMagicHash -XBangPatterns -XTypeSynonymInstances -XFlexibleInstances -cpp #-}
#if __GLASGOW_HASKELL__ >= 710
{-# OPTIONS_GHC -XPartialTypeSignatures #-}
#endif
-- | Futhark parser written with Happy.
module Language.Futhark.Parser.Parser
  ( prog
  , expression
  , declaration
  , modExpression
  , futharkType
  , parse
  , ReadLineMonad (..)
  , getLinesFromM
  , parseInMonad
  , SyntaxError(..)
  )
  where

import Data.Bifunctor (second)
import Control.Monad
import Control.Monad.Trans
import Control.Monad.Except
import Control.Monad.Reader
import Control.Monad.Trans.State
import Data.Array
import qualified Data.ByteString as BS
import qualified Data.Text as T
import qualified Data.Text.Encoding as T
import Data.Char (ord)
import Data.Maybe (fromMaybe, fromJust)
import Data.List (genericLength)
import qualified Data.List.NonEmpty as NE
import qualified Data.Map.Strict as M
import Data.Monoid

import Language.Futhark.Syntax hiding (ID)
import Language.Futhark.Prop
import Language.Futhark.Pretty
import Language.Futhark.Parser.Lexer (Token(..))
import Futhark.Util.Pretty
import Futhark.Util.Loc
import Language.Futhark.Parser.Monad
import qualified Data.Array as Happy_Data_Array
import qualified Data.Bits as Bits
import qualified GHC.Exts as Happy_GHC_Exts
import Control.Applicative(Applicative(..))
import Control.Monad (ap)

-- parser produced by Happy Version 1.20.0

newtype HappyAbsSyn t102 t103 t104 t105 = HappyAbsSyn HappyAny
#if __GLASGOW_HASKELL__ >= 607
type HappyAny = Happy_GHC_Exts.Any
#else
type HappyAny = forall a . a
#endif
newtype HappyWrap8 = HappyWrap8 (DocComment)
happyIn8 :: (DocComment) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn8 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
DocComment -> HappyAbsSyn t102 t103 t104 t105
happyIn8 DocComment
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (DocComment -> HappyWrap8
HappyWrap8 DocComment
x)
{-# INLINE happyIn8 #-}
happyOut8 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap8
happyOut8 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap8
happyOut8 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut8 #-}
newtype HappyWrap9 = HappyWrap9 (UncheckedProg)
happyIn9 :: (UncheckedProg) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn9 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedProg -> HappyAbsSyn t102 t103 t104 t105
happyIn9 UncheckedProg
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedProg -> HappyWrap9
HappyWrap9 UncheckedProg
x)
{-# INLINE happyIn9 #-}
happyOut9 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap9
happyOut9 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap9
happyOut9 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut9 #-}
newtype HappyWrap10 = HappyWrap10 (UncheckedDec)
happyIn10 :: (UncheckedDec) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn10 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedDec -> HappyAbsSyn t102 t103 t104 t105
happyIn10 UncheckedDec
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedDec -> HappyWrap10
HappyWrap10 UncheckedDec
x)
{-# INLINE happyIn10 #-}
happyOut10 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap10
happyOut10 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap10
happyOut10 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut10 #-}
newtype HappyWrap11 = HappyWrap11 ([UncheckedDec])
happyIn11 :: ([UncheckedDec]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn11 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[UncheckedDec] -> HappyAbsSyn t102 t103 t104 t105
happyIn11 [UncheckedDec]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([UncheckedDec] -> HappyWrap11
HappyWrap11 [UncheckedDec]
x)
{-# INLINE happyIn11 #-}
happyOut11 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap11
happyOut11 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap11
happyOut11 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut11 #-}
newtype HappyWrap12 = HappyWrap12 (UncheckedDec)
happyIn12 :: (UncheckedDec) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn12 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedDec -> HappyAbsSyn t102 t103 t104 t105
happyIn12 UncheckedDec
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedDec -> HappyWrap12
HappyWrap12 UncheckedDec
x)
{-# INLINE happyIn12 #-}
happyOut12 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap12
happyOut12 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap12
happyOut12 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut12 #-}
newtype HappyWrap13 = HappyWrap13 (UncheckedSigExp)
happyIn13 :: (UncheckedSigExp) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn13 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedSigExp -> HappyAbsSyn t102 t103 t104 t105
happyIn13 UncheckedSigExp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedSigExp -> HappyWrap13
HappyWrap13 UncheckedSigExp
x)
{-# INLINE happyIn13 #-}
happyOut13 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap13
happyOut13 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap13
happyOut13 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut13 #-}
newtype HappyWrap14 = HappyWrap14 (TypeRefBase Name)
happyIn14 :: (TypeRefBase Name) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn14 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
TypeRefBase Name -> HappyAbsSyn t102 t103 t104 t105
happyIn14 TypeRefBase Name
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (TypeRefBase Name -> HappyWrap14
HappyWrap14 TypeRefBase Name
x)
{-# INLINE happyIn14 #-}
happyOut14 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap14
happyOut14 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap14
happyOut14 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut14 #-}
newtype HappyWrap15 = HappyWrap15 (SigBindBase NoInfo Name)
happyIn15 :: (SigBindBase NoInfo Name) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn15 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
SigBindBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn15 SigBindBase NoInfo Name
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (SigBindBase NoInfo Name -> HappyWrap15
HappyWrap15 SigBindBase NoInfo Name
x)
{-# INLINE happyIn15 #-}
happyOut15 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap15
happyOut15 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap15
happyOut15 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut15 #-}
newtype HappyWrap16 = HappyWrap16 (UncheckedModExp)
happyIn16 :: (UncheckedModExp) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn16 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedModExp -> HappyAbsSyn t102 t103 t104 t105
happyIn16 UncheckedModExp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedModExp -> HappyWrap16
HappyWrap16 UncheckedModExp
x)
{-# INLINE happyIn16 #-}
happyOut16 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap16
happyOut16 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap16
happyOut16 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut16 #-}
newtype HappyWrap17 = HappyWrap17 (UncheckedModExp)
happyIn17 :: (UncheckedModExp) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn17 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedModExp -> HappyAbsSyn t102 t103 t104 t105
happyIn17 UncheckedModExp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedModExp -> HappyWrap17
HappyWrap17 UncheckedModExp
x)
{-# INLINE happyIn17 #-}
happyOut17 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap17
happyOut17 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap17
happyOut17 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut17 #-}
newtype HappyWrap18 = HappyWrap18 (UncheckedModExp)
happyIn18 :: (UncheckedModExp) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn18 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedModExp -> HappyAbsSyn t102 t103 t104 t105
happyIn18 UncheckedModExp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedModExp -> HappyWrap18
HappyWrap18 UncheckedModExp
x)
{-# INLINE happyIn18 #-}
happyOut18 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap18
happyOut18 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap18
happyOut18 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut18 #-}
newtype HappyWrap19 = HappyWrap19 (UncheckedSigExp)
happyIn19 :: (UncheckedSigExp) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn19 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedSigExp -> HappyAbsSyn t102 t103 t104 t105
happyIn19 UncheckedSigExp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedSigExp -> HappyWrap19
HappyWrap19 UncheckedSigExp
x)
{-# INLINE happyIn19 #-}
happyOut19 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap19
happyOut19 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap19
happyOut19 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut19 #-}
newtype HappyWrap20 = HappyWrap20 (ModBindBase NoInfo Name)
happyIn20 :: (ModBindBase NoInfo Name) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn20 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
ModBindBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn20 ModBindBase NoInfo Name
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (ModBindBase NoInfo Name -> HappyWrap20
HappyWrap20 ModBindBase NoInfo Name
x)
{-# INLINE happyIn20 #-}
happyOut20 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap20
happyOut20 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap20
happyOut20 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut20 #-}
newtype HappyWrap21 = HappyWrap21 (ModParamBase NoInfo Name)
happyIn21 :: (ModParamBase NoInfo Name) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn21 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
ModParamBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn21 ModParamBase NoInfo Name
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (ModParamBase NoInfo Name -> HappyWrap21
HappyWrap21 ModParamBase NoInfo Name
x)
{-# INLINE happyIn21 #-}
happyOut21 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap21
happyOut21 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap21
happyOut21 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut21 #-}
newtype HappyWrap22 = HappyWrap22 ([ModParamBase NoInfo Name])
happyIn22 :: ([ModParamBase NoInfo Name]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn22 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[ModParamBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn22 [ModParamBase NoInfo Name]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([ModParamBase NoInfo Name] -> HappyWrap22
HappyWrap22 [ModParamBase NoInfo Name]
x)
{-# INLINE happyIn22 #-}
happyOut22 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap22
happyOut22 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap22
happyOut22 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut22 #-}
newtype HappyWrap23 = HappyWrap23 (Liftedness)
happyIn23 :: (Liftedness) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn23 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
Liftedness -> HappyAbsSyn t102 t103 t104 t105
happyIn23 Liftedness
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (Liftedness -> HappyWrap23
HappyWrap23 Liftedness
x)
{-# INLINE happyIn23 #-}
happyOut23 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap23
happyOut23 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap23
happyOut23 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut23 #-}
newtype HappyWrap24 = HappyWrap24 (SpecBase NoInfo Name)
happyIn24 :: (SpecBase NoInfo Name) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn24 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
SpecBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn24 SpecBase NoInfo Name
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (SpecBase NoInfo Name -> HappyWrap24
HappyWrap24 SpecBase NoInfo Name
x)
{-# INLINE happyIn24 #-}
happyOut24 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap24
happyOut24 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap24
happyOut24 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut24 #-}
newtype HappyWrap25 = HappyWrap25 ([SpecBase NoInfo Name])
happyIn25 :: ([SpecBase NoInfo Name]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn25 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[SpecBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn25 [SpecBase NoInfo Name]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([SpecBase NoInfo Name] -> HappyWrap25
HappyWrap25 [SpecBase NoInfo Name]
x)
{-# INLINE happyIn25 #-}
happyOut25 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap25
happyOut25 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap25
happyOut25 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut25 #-}
newtype HappyWrap26 = HappyWrap26 (SizeBinder Name)
happyIn26 :: (SizeBinder Name) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn26 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
SizeBinder Name -> HappyAbsSyn t102 t103 t104 t105
happyIn26 SizeBinder Name
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (SizeBinder Name -> HappyWrap26
HappyWrap26 SizeBinder Name
x)
{-# INLINE happyIn26 #-}
happyOut26 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap26
happyOut26 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap26
happyOut26 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut26 #-}
newtype HappyWrap27 = HappyWrap27 ([SizeBinder Name])
happyIn27 :: ([SizeBinder Name]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn27 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[SizeBinder Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn27 [SizeBinder Name]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([SizeBinder Name] -> HappyWrap27
HappyWrap27 [SizeBinder Name]
x)
{-# INLINE happyIn27 #-}
happyOut27 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap27
happyOut27 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap27
happyOut27 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut27 #-}
newtype HappyWrap28 = HappyWrap28 (TypeParamBase Name)
happyIn28 :: (TypeParamBase Name) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn28 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
TypeParamBase Name -> HappyAbsSyn t102 t103 t104 t105
happyIn28 TypeParamBase Name
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (TypeParamBase Name -> HappyWrap28
HappyWrap28 TypeParamBase Name
x)
{-# INLINE happyIn28 #-}
happyOut28 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap28
happyOut28 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap28
happyOut28 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut28 #-}
newtype HappyWrap29 = HappyWrap29 ([TypeParamBase Name])
happyIn29 :: ([TypeParamBase Name]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn29 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[TypeParamBase Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn29 [TypeParamBase Name]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([TypeParamBase Name] -> HappyWrap29
HappyWrap29 [TypeParamBase Name]
x)
{-# INLINE happyIn29 #-}
happyOut29 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap29
happyOut29 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap29
happyOut29 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut29 #-}
newtype HappyWrap30 = HappyWrap30 ((QualName Name, Loc))
happyIn30 :: ((QualName Name, Loc)) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn30 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30 (QualName Name, Loc)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((QualName Name, Loc) -> HappyWrap30
HappyWrap30 (QualName Name, Loc)
x)
{-# INLINE happyIn30 #-}
happyOut30 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap30
happyOut30 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap30
happyOut30 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut30 #-}
newtype HappyWrap31 = HappyWrap31 (Name)
happyIn31 :: (Name) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn31 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
Name -> HappyAbsSyn t102 t103 t104 t105
happyIn31 Name
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (Name -> HappyWrap31
HappyWrap31 Name
x)
{-# INLINE happyIn31 #-}
happyOut31 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap31
happyOut31 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap31
happyOut31 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut31 #-}
newtype HappyWrap32 = HappyWrap32 ((Name, Loc))
happyIn32 :: ((Name, Loc)) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn32 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn32 (Name, Loc)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((Name, Loc) -> HappyWrap32
HappyWrap32 (Name, Loc)
x)
{-# INLINE happyIn32 #-}
happyOut32 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap32
happyOut32 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap32
happyOut32 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut32 #-}
newtype HappyWrap33 = HappyWrap33 (ValBindBase NoInfo Name)
happyIn33 :: (ValBindBase NoInfo Name) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn33 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
ValBindBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn33 ValBindBase NoInfo Name
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (ValBindBase NoInfo Name -> HappyWrap33
HappyWrap33 ValBindBase NoInfo Name
x)
{-# INLINE happyIn33 #-}
happyOut33 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap33
happyOut33 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap33
happyOut33 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut33 #-}
newtype HappyWrap34 = HappyWrap34 (TypeBindBase NoInfo Name)
happyIn34 :: (TypeBindBase NoInfo Name) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn34 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
TypeBindBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn34 TypeBindBase NoInfo Name
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (TypeBindBase NoInfo Name -> HappyWrap34
HappyWrap34 TypeBindBase NoInfo Name
x)
{-# INLINE happyIn34 #-}
happyOut34 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap34
happyOut34 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap34
happyOut34 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut34 #-}
newtype HappyWrap35 = HappyWrap35 (UncheckedTypeExp)
happyIn35 :: (UncheckedTypeExp) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn35 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn35 UncheckedTypeExp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedTypeExp -> HappyWrap35
HappyWrap35 UncheckedTypeExp
x)
{-# INLINE happyIn35 #-}
happyOut35 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap35
happyOut35 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap35
happyOut35 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut35 #-}
newtype HappyWrap36 = HappyWrap36 ([Name])
happyIn36 :: ([Name]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn36 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn36 [Name]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([Name] -> HappyWrap36
HappyWrap36 [Name]
x)
{-# INLINE happyIn36 #-}
happyOut36 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap36
happyOut36 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap36
happyOut36 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut36 #-}
newtype HappyWrap37 = HappyWrap37 (UncheckedTypeExp)
happyIn37 :: (UncheckedTypeExp) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn37 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn37 UncheckedTypeExp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedTypeExp -> HappyWrap37
HappyWrap37 UncheckedTypeExp
x)
{-# INLINE happyIn37 #-}
happyOut37 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap37
happyOut37 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap37
happyOut37 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut37 #-}
newtype HappyWrap38 = HappyWrap38 (UncheckedTypeExp)
happyIn38 :: (UncheckedTypeExp) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn38 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn38 UncheckedTypeExp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedTypeExp -> HappyWrap38
HappyWrap38 UncheckedTypeExp
x)
{-# INLINE happyIn38 #-}
happyOut38 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap38
happyOut38 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap38
happyOut38 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut38 #-}
newtype HappyWrap39 = HappyWrap39 (([(Name, [UncheckedTypeExp])], Loc))
happyIn39 :: (([(Name, [UncheckedTypeExp])], Loc)) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn39 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
([(Name, [UncheckedTypeExp])], Loc)
-> HappyAbsSyn t102 t103 t104 t105
happyIn39 ([(Name, [UncheckedTypeExp])], Loc)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (([(Name, [UncheckedTypeExp])], Loc) -> HappyWrap39
HappyWrap39 ([(Name, [UncheckedTypeExp])], Loc)
x)
{-# INLINE happyIn39 #-}
happyOut39 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap39
happyOut39 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap39
happyOut39 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut39 #-}
newtype HappyWrap40 = HappyWrap40 ((Name, [UncheckedTypeExp], Loc))
happyIn40 :: ((Name, [UncheckedTypeExp], Loc)) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn40 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, [UncheckedTypeExp], Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn40 (Name, [UncheckedTypeExp], Loc)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((Name, [UncheckedTypeExp], Loc) -> HappyWrap40
HappyWrap40 (Name, [UncheckedTypeExp], Loc)
x)
{-# INLINE happyIn40 #-}
happyOut40 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap40
happyOut40 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap40
happyOut40 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut40 #-}
newtype HappyWrap41 = HappyWrap41 (UncheckedTypeExp)
happyIn41 :: (UncheckedTypeExp) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn41 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn41 UncheckedTypeExp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedTypeExp -> HappyWrap41
HappyWrap41 UncheckedTypeExp
x)
{-# INLINE happyIn41 #-}
happyOut41 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap41
happyOut41 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap41
happyOut41 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut41 #-}
newtype HappyWrap42 = HappyWrap42 (UncheckedTypeExp)
happyIn42 :: (UncheckedTypeExp) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn42 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn42 UncheckedTypeExp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedTypeExp -> HappyWrap42
HappyWrap42 UncheckedTypeExp
x)
{-# INLINE happyIn42 #-}
happyOut42 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap42
happyOut42 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap42
happyOut42 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut42 #-}
newtype HappyWrap43 = HappyWrap43 ((Name, Loc))
happyIn43 :: ((Name, Loc)) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn43 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn43 (Name, Loc)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((Name, Loc) -> HappyWrap43
HappyWrap43 (Name, Loc)
x)
{-# INLINE happyIn43 #-}
happyOut43 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap43
happyOut43 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap43
happyOut43 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut43 #-}
newtype HappyWrap44 = HappyWrap44 (TypeArgExp Name)
happyIn44 :: (TypeArgExp Name) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn44 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
TypeArgExp Name -> HappyAbsSyn t102 t103 t104 t105
happyIn44 TypeArgExp Name
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (TypeArgExp Name -> HappyWrap44
HappyWrap44 TypeArgExp Name
x)
{-# INLINE happyIn44 #-}
happyOut44 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap44
happyOut44 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap44
happyOut44 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut44 #-}
newtype HappyWrap45 = HappyWrap45 ((Name, UncheckedTypeExp))
happyIn45 :: ((Name, UncheckedTypeExp)) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn45 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, UncheckedTypeExp) -> HappyAbsSyn t102 t103 t104 t105
happyIn45 (Name, UncheckedTypeExp)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((Name, UncheckedTypeExp) -> HappyWrap45
HappyWrap45 (Name, UncheckedTypeExp)
x)
{-# INLINE happyIn45 #-}
happyOut45 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap45
happyOut45 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap45
happyOut45 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut45 #-}
newtype HappyWrap46 = HappyWrap46 ([(Name, UncheckedTypeExp)])
happyIn46 :: ([(Name, UncheckedTypeExp)]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn46 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[(Name, UncheckedTypeExp)] -> HappyAbsSyn t102 t103 t104 t105
happyIn46 [(Name, UncheckedTypeExp)]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([(Name, UncheckedTypeExp)] -> HappyWrap46
HappyWrap46 [(Name, UncheckedTypeExp)]
x)
{-# INLINE happyIn46 #-}
happyOut46 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap46
happyOut46 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap46
happyOut46 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut46 #-}
newtype HappyWrap47 = HappyWrap47 ([UncheckedTypeExp])
happyIn47 :: ([UncheckedTypeExp]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn47 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[UncheckedTypeExp] -> HappyAbsSyn t102 t103 t104 t105
happyIn47 [UncheckedTypeExp]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([UncheckedTypeExp] -> HappyWrap47
HappyWrap47 [UncheckedTypeExp]
x)
{-# INLINE happyIn47 #-}
happyOut47 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap47
happyOut47 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap47
happyOut47 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut47 #-}
newtype HappyWrap48 = HappyWrap48 (SizeExp Name)
happyIn48 :: (SizeExp Name) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn48 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
SizeExp Name -> HappyAbsSyn t102 t103 t104 t105
happyIn48 SizeExp Name
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (SizeExp Name -> HappyWrap48
HappyWrap48 SizeExp Name
x)
{-# INLINE happyIn48 #-}
happyOut48 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap48
happyOut48 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap48
happyOut48 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut48 #-}
newtype HappyWrap49 = HappyWrap49 (PatBase NoInfo Name)
happyIn49 :: (PatBase NoInfo Name) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn49 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn49 PatBase NoInfo Name
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (PatBase NoInfo Name -> HappyWrap49
HappyWrap49 PatBase NoInfo Name
x)
{-# INLINE happyIn49 #-}
happyOut49 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap49
happyOut49 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap49
happyOut49 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut49 #-}
newtype HappyWrap50 = HappyWrap50 ((PatBase NoInfo Name, [PatBase NoInfo Name]))
happyIn50 :: ((PatBase NoInfo Name, [PatBase NoInfo Name])) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn50 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PatBase NoInfo Name, [PatBase NoInfo Name])
-> HappyAbsSyn t102 t103 t104 t105
happyIn50 (PatBase NoInfo Name, [PatBase NoInfo Name])
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((PatBase NoInfo Name, [PatBase NoInfo Name]) -> HappyWrap50
HappyWrap50 (PatBase NoInfo Name, [PatBase NoInfo Name])
x)
{-# INLINE happyIn50 #-}
happyOut50 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap50
happyOut50 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap50
happyOut50 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut50 #-}
newtype HappyWrap51 = HappyWrap51 ([PatBase NoInfo Name])
happyIn51 :: ([PatBase NoInfo Name]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn51 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[PatBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn51 [PatBase NoInfo Name]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([PatBase NoInfo Name] -> HappyWrap51
HappyWrap51 [PatBase NoInfo Name]
x)
{-# INLINE happyIn51 #-}
happyOut51 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap51
happyOut51 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap51
happyOut51 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut51 #-}
newtype HappyWrap52 = HappyWrap52 ((QualName Name, Loc))
happyIn52 :: ((QualName Name, Loc)) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn52 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn52 (QualName Name, Loc)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((QualName Name, Loc) -> HappyWrap52
HappyWrap52 (QualName Name, Loc)
x)
{-# INLINE happyIn52 #-}
happyOut52 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap52
happyOut52 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap52
happyOut52 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut52 #-}
newtype HappyWrap53 = HappyWrap53 (UncheckedExp)
happyIn53 :: (UncheckedExp) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn53 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn53 UncheckedExp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap53
HappyWrap53 UncheckedExp
x)
{-# INLINE happyIn53 #-}
happyOut53 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap53
happyOut53 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut53 #-}
newtype HappyWrap54 = HappyWrap54 (UncheckedExp)
happyIn54 :: (UncheckedExp) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn54 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn54 UncheckedExp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap54
HappyWrap54 UncheckedExp
x)
{-# INLINE happyIn54 #-}
happyOut54 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap54
happyOut54 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut54 #-}
newtype HappyWrap55 = HappyWrap55 ([UncheckedExp])
happyIn55 :: ([UncheckedExp]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn55 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[UncheckedExp] -> HappyAbsSyn t102 t103 t104 t105
happyIn55 [UncheckedExp]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([UncheckedExp] -> HappyWrap55
HappyWrap55 [UncheckedExp]
x)
{-# INLINE happyIn55 #-}
happyOut55 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap55
happyOut55 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap55
happyOut55 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut55 #-}
newtype HappyWrap56 = HappyWrap56 (UncheckedExp)
happyIn56 :: (UncheckedExp) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn56 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn56 UncheckedExp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap56
HappyWrap56 UncheckedExp
x)
{-# INLINE happyIn56 #-}
happyOut56 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap56
happyOut56 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap56
happyOut56 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut56 #-}
newtype HappyWrap57 = HappyWrap57 ((PrimValue, Loc))
happyIn57 :: ((PrimValue, Loc)) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn57 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PrimValue, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn57 (PrimValue, Loc)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((PrimValue, Loc) -> HappyWrap57
HappyWrap57 (PrimValue, Loc)
x)
{-# INLINE happyIn57 #-}
happyOut57 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap57
happyOut57 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap57
happyOut57 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut57 #-}
newtype HappyWrap58 = HappyWrap58 ((PrimValue, Loc))
happyIn58 :: ((PrimValue, Loc)) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn58 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PrimValue, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn58 (PrimValue, Loc)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((PrimValue, Loc) -> HappyWrap58
HappyWrap58 (PrimValue, Loc)
x)
{-# INLINE happyIn58 #-}
happyOut58 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap58
happyOut58 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap58
happyOut58 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut58 #-}
newtype HappyWrap59 = HappyWrap59 ((UncheckedExp, [UncheckedExp]))
happyIn59 :: ((UncheckedExp, [UncheckedExp])) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn59 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(UncheckedExp, [UncheckedExp]) -> HappyAbsSyn t102 t103 t104 t105
happyIn59 (UncheckedExp, [UncheckedExp])
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((UncheckedExp, [UncheckedExp]) -> HappyWrap59
HappyWrap59 (UncheckedExp, [UncheckedExp])
x)
{-# INLINE happyIn59 #-}
happyOut59 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap59
happyOut59 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap59
happyOut59 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut59 #-}
newtype HappyWrap60 = HappyWrap60 (([UncheckedExp], UncheckedExp))
happyIn60 :: (([UncheckedExp], UncheckedExp)) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn60 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
([UncheckedExp], UncheckedExp) -> HappyAbsSyn t102 t103 t104 t105
happyIn60 ([UncheckedExp], UncheckedExp)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (([UncheckedExp], UncheckedExp) -> HappyWrap60
HappyWrap60 ([UncheckedExp], UncheckedExp)
x)
{-# INLINE happyIn60 #-}
happyOut60 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap60
happyOut60 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap60
happyOut60 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut60 #-}
newtype HappyWrap61 = HappyWrap61 ((Name, Loc))
happyIn61 :: ((Name, Loc)) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn61 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn61 (Name, Loc)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((Name, Loc) -> HappyWrap61
HappyWrap61 (Name, Loc)
x)
{-# INLINE happyIn61 #-}
happyOut61 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap61
happyOut61 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap61
happyOut61 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut61 #-}
newtype HappyWrap62 = HappyWrap62 ([(Name, Loc)])
happyIn62 :: ([(Name, Loc)]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn62 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[(Name, Loc)] -> HappyAbsSyn t102 t103 t104 t105
happyIn62 [(Name, Loc)]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([(Name, Loc)] -> HappyWrap62
HappyWrap62 [(Name, Loc)]
x)
{-# INLINE happyIn62 #-}
happyOut62 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap62
happyOut62 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap62
happyOut62 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut62 #-}
newtype HappyWrap63 = HappyWrap63 ([(Name, Loc)])
happyIn63 :: ([(Name, Loc)]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn63 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[(Name, Loc)] -> HappyAbsSyn t102 t103 t104 t105
happyIn63 [(Name, Loc)]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([(Name, Loc)] -> HappyWrap63
HappyWrap63 [(Name, Loc)]
x)
{-# INLINE happyIn63 #-}
happyOut63 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap63
happyOut63 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap63
happyOut63 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut63 #-}
newtype HappyWrap64 = HappyWrap64 (FieldBase NoInfo Name)
happyIn64 :: (FieldBase NoInfo Name) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn64 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
FieldBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn64 FieldBase NoInfo Name
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (FieldBase NoInfo Name -> HappyWrap64
HappyWrap64 FieldBase NoInfo Name
x)
{-# INLINE happyIn64 #-}
happyOut64 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap64
happyOut64 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap64
happyOut64 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut64 #-}
newtype HappyWrap65 = HappyWrap65 ([FieldBase NoInfo Name])
happyIn65 :: ([FieldBase NoInfo Name]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn65 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[FieldBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn65 [FieldBase NoInfo Name]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([FieldBase NoInfo Name] -> HappyWrap65
HappyWrap65 [FieldBase NoInfo Name]
x)
{-# INLINE happyIn65 #-}
happyOut65 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap65
happyOut65 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap65
happyOut65 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut65 #-}
newtype HappyWrap66 = HappyWrap66 ([FieldBase NoInfo Name])
happyIn66 :: ([FieldBase NoInfo Name]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn66 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[FieldBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn66 [FieldBase NoInfo Name]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([FieldBase NoInfo Name] -> HappyWrap66
HappyWrap66 [FieldBase NoInfo Name]
x)
{-# INLINE happyIn66 #-}
happyOut66 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap66
happyOut66 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap66
happyOut66 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut66 #-}
newtype HappyWrap67 = HappyWrap67 (UncheckedExp)
happyIn67 :: (UncheckedExp) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn67 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn67 UncheckedExp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap67
HappyWrap67 UncheckedExp
x)
{-# INLINE happyIn67 #-}
happyOut67 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap67
happyOut67 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap67
happyOut67 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut67 #-}
newtype HappyWrap68 = HappyWrap68 (UncheckedExp)
happyIn68 :: (UncheckedExp) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn68 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn68 UncheckedExp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap68
HappyWrap68 UncheckedExp
x)
{-# INLINE happyIn68 #-}
happyOut68 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap68
happyOut68 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap68
happyOut68 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut68 #-}
newtype HappyWrap69 = HappyWrap69 (UncheckedExp)
happyIn69 :: (UncheckedExp) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn69 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69 UncheckedExp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap69
HappyWrap69 UncheckedExp
x)
{-# INLINE happyIn69 #-}
happyOut69 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap69
happyOut69 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap69
happyOut69 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut69 #-}
newtype HappyWrap70 = HappyWrap70 (UncheckedExp)
happyIn70 :: (UncheckedExp) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn70 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn70 UncheckedExp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap70
HappyWrap70 UncheckedExp
x)
{-# INLINE happyIn70 #-}
happyOut70 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap70
happyOut70 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap70
happyOut70 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut70 #-}
newtype HappyWrap71 = HappyWrap71 (UncheckedExp)
happyIn71 :: (UncheckedExp) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn71 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn71 UncheckedExp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap71
HappyWrap71 UncheckedExp
x)
{-# INLINE happyIn71 #-}
happyOut71 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap71
happyOut71 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap71
happyOut71 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut71 #-}
newtype HappyWrap72 = HappyWrap72 (UncheckedExp)
happyIn72 :: (UncheckedExp) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn72 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn72 UncheckedExp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap72
HappyWrap72 UncheckedExp
x)
{-# INLINE happyIn72 #-}
happyOut72 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap72
happyOut72 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap72
happyOut72 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut72 #-}
newtype HappyWrap73 = HappyWrap73 (UncheckedExp)
happyIn73 :: (UncheckedExp) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn73 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn73 UncheckedExp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap73
HappyWrap73 UncheckedExp
x)
{-# INLINE happyIn73 #-}
happyOut73 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap73
happyOut73 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap73
happyOut73 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut73 #-}
newtype HappyWrap74 = HappyWrap74 (UncheckedExp)
happyIn74 :: (UncheckedExp) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn74 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn74 UncheckedExp
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedExp -> HappyWrap74
HappyWrap74 UncheckedExp
x)
{-# INLINE happyIn74 #-}
happyOut74 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap74
happyOut74 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap74
happyOut74 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut74 #-}
newtype HappyWrap75 = HappyWrap75 (NE.NonEmpty (CaseBase NoInfo Name))
happyIn75 :: (NE.NonEmpty (CaseBase NoInfo Name)) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn75 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
NonEmpty (CaseBase NoInfo Name) -> HappyAbsSyn t102 t103 t104 t105
happyIn75 NonEmpty (CaseBase NoInfo Name)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (NonEmpty (CaseBase NoInfo Name) -> HappyWrap75
HappyWrap75 NonEmpty (CaseBase NoInfo Name)
x)
{-# INLINE happyIn75 #-}
happyOut75 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap75
happyOut75 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap75
happyOut75 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut75 #-}
newtype HappyWrap76 = HappyWrap76 (CaseBase NoInfo Name)
happyIn76 :: (CaseBase NoInfo Name) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn76 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
CaseBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn76 CaseBase NoInfo Name
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (CaseBase NoInfo Name -> HappyWrap76
HappyWrap76 CaseBase NoInfo Name
x)
{-# INLINE happyIn76 #-}
happyOut76 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap76
happyOut76 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap76
happyOut76 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut76 #-}
newtype HappyWrap77 = HappyWrap77 (PatBase NoInfo Name)
happyIn77 :: (PatBase NoInfo Name) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn77 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn77 PatBase NoInfo Name
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (PatBase NoInfo Name -> HappyWrap77
HappyWrap77 PatBase NoInfo Name
x)
{-# INLINE happyIn77 #-}
happyOut77 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap77
happyOut77 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap77
happyOut77 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut77 #-}
newtype HappyWrap78 = HappyWrap78 ([PatBase NoInfo Name])
happyIn78 :: ([PatBase NoInfo Name]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn78 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[PatBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn78 [PatBase NoInfo Name]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([PatBase NoInfo Name] -> HappyWrap78
HappyWrap78 [PatBase NoInfo Name]
x)
{-# INLINE happyIn78 #-}
happyOut78 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap78
happyOut78 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap78
happyOut78 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut78 #-}
newtype HappyWrap79 = HappyWrap79 (PatBase NoInfo Name)
happyIn79 :: (PatBase NoInfo Name) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn79 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn79 PatBase NoInfo Name
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (PatBase NoInfo Name -> HappyWrap79
HappyWrap79 PatBase NoInfo Name
x)
{-# INLINE happyIn79 #-}
happyOut79 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap79
happyOut79 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap79
happyOut79 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut79 #-}
newtype HappyWrap80 = HappyWrap80 ([PatBase NoInfo Name])
happyIn80 :: ([PatBase NoInfo Name]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn80 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[PatBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn80 [PatBase NoInfo Name]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([PatBase NoInfo Name] -> HappyWrap80
HappyWrap80 [PatBase NoInfo Name]
x)
{-# INLINE happyIn80 #-}
happyOut80 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap80
happyOut80 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap80
happyOut80 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut80 #-}
newtype HappyWrap81 = HappyWrap81 ((Name, PatBase NoInfo Name))
happyIn81 :: ((Name, PatBase NoInfo Name)) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn81 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, PatBase NoInfo Name) -> HappyAbsSyn t102 t103 t104 t105
happyIn81 (Name, PatBase NoInfo Name)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((Name, PatBase NoInfo Name) -> HappyWrap81
HappyWrap81 (Name, PatBase NoInfo Name)
x)
{-# INLINE happyIn81 #-}
happyOut81 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap81
happyOut81 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap81
happyOut81 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut81 #-}
newtype HappyWrap82 = HappyWrap82 ([(Name, PatBase NoInfo Name)])
happyIn82 :: ([(Name, PatBase NoInfo Name)]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn82 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[(Name, PatBase NoInfo Name)] -> HappyAbsSyn t102 t103 t104 t105
happyIn82 [(Name, PatBase NoInfo Name)]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([(Name, PatBase NoInfo Name)] -> HappyWrap82
HappyWrap82 [(Name, PatBase NoInfo Name)]
x)
{-# INLINE happyIn82 #-}
happyOut82 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap82
happyOut82 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap82
happyOut82 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut82 #-}
newtype HappyWrap83 = HappyWrap83 ([(Name, PatBase NoInfo Name)])
happyIn83 :: ([(Name, PatBase NoInfo Name)]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn83 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[(Name, PatBase NoInfo Name)] -> HappyAbsSyn t102 t103 t104 t105
happyIn83 [(Name, PatBase NoInfo Name)]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([(Name, PatBase NoInfo Name)] -> HappyWrap83
HappyWrap83 [(Name, PatBase NoInfo Name)]
x)
{-# INLINE happyIn83 #-}
happyOut83 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap83
happyOut83 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap83
happyOut83 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut83 #-}
newtype HappyWrap84 = HappyWrap84 ((PatLit, Loc))
happyIn84 :: ((PatLit, Loc)) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn84 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PatLit, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn84 (PatLit, Loc)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((PatLit, Loc) -> HappyWrap84
HappyWrap84 (PatLit, Loc)
x)
{-# INLINE happyIn84 #-}
happyOut84 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap84
happyOut84 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap84
happyOut84 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut84 #-}
newtype HappyWrap85 = HappyWrap85 (LoopFormBase NoInfo Name)
happyIn85 :: (LoopFormBase NoInfo Name) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn85 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
LoopFormBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn85 LoopFormBase NoInfo Name
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (LoopFormBase NoInfo Name -> HappyWrap85
HappyWrap85 LoopFormBase NoInfo Name
x)
{-# INLINE happyIn85 #-}
happyOut85 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap85
happyOut85 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap85
happyOut85 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut85 #-}
newtype HappyWrap86 = HappyWrap86 (((Name, Loc), UncheckedSlice, Loc))
happyIn86 :: (((Name, Loc), UncheckedSlice, Loc)) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn86 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
((Name, Loc), UncheckedSlice, Loc)
-> HappyAbsSyn t102 t103 t104 t105
happyIn86 ((Name, Loc), UncheckedSlice, Loc)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (((Name, Loc), UncheckedSlice, Loc) -> HappyWrap86
HappyWrap86 ((Name, Loc), UncheckedSlice, Loc)
x)
{-# INLINE happyIn86 #-}
happyOut86 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap86
happyOut86 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap86
happyOut86 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut86 #-}
newtype HappyWrap87 = HappyWrap87 (((QualName Name, Loc), UncheckedSlice, Loc))
happyIn87 :: (((QualName Name, Loc), UncheckedSlice, Loc)) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn87 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
((QualName Name, Loc), UncheckedSlice, Loc)
-> HappyAbsSyn t102 t103 t104 t105
happyIn87 ((QualName Name, Loc), UncheckedSlice, Loc)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (((QualName Name, Loc), UncheckedSlice, Loc) -> HappyWrap87
HappyWrap87 ((QualName Name, Loc), UncheckedSlice, Loc)
x)
{-# INLINE happyIn87 #-}
happyOut87 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap87
happyOut87 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap87
happyOut87 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut87 #-}
newtype HappyWrap88 = HappyWrap88 (UncheckedDimIndex)
happyIn88 :: (UncheckedDimIndex) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn88 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedDimIndex -> HappyAbsSyn t102 t103 t104 t105
happyIn88 UncheckedDimIndex
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedDimIndex -> HappyWrap88
HappyWrap88 UncheckedDimIndex
x)
{-# INLINE happyIn88 #-}
happyOut88 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap88
happyOut88 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap88
happyOut88 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut88 #-}
newtype HappyWrap89 = HappyWrap89 ([UncheckedDimIndex])
happyIn89 :: ([UncheckedDimIndex]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn89 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedSlice -> HappyAbsSyn t102 t103 t104 t105
happyIn89 UncheckedSlice
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (UncheckedSlice -> HappyWrap89
HappyWrap89 UncheckedSlice
x)
{-# INLINE happyIn89 #-}
happyOut89 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap89
happyOut89 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap89
happyOut89 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut89 #-}
newtype HappyWrap90 = HappyWrap90 ((UncheckedDimIndex, [UncheckedDimIndex]))
happyIn90 :: ((UncheckedDimIndex, [UncheckedDimIndex])) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn90 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(UncheckedDimIndex, UncheckedSlice)
-> HappyAbsSyn t102 t103 t104 t105
happyIn90 (UncheckedDimIndex, UncheckedSlice)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((UncheckedDimIndex, UncheckedSlice) -> HappyWrap90
HappyWrap90 (UncheckedDimIndex, UncheckedSlice)
x)
{-# INLINE happyIn90 #-}
happyOut90 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap90
happyOut90 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap90
happyOut90 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut90 #-}
newtype HappyWrap91 = HappyWrap91 (IdentBase NoInfo Name)
happyIn91 :: (IdentBase NoInfo Name) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn91 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
IdentBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn91 IdentBase NoInfo Name
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (IdentBase NoInfo Name -> HappyWrap91
HappyWrap91 IdentBase NoInfo Name
x)
{-# INLINE happyIn91 #-}
happyOut91 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap91
happyOut91 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap91
happyOut91 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut91 #-}
newtype HappyWrap92 = HappyWrap92 ((Name, Loc))
happyIn92 :: ((Name, Loc)) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn92 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn92 (Name, Loc)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((Name, Loc) -> HappyWrap92
HappyWrap92 (Name, Loc)
x)
{-# INLINE happyIn92 #-}
happyOut92 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap92
happyOut92 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap92
happyOut92 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut92 #-}
newtype HappyWrap93 = HappyWrap93 (PatBase NoInfo Name)
happyIn93 :: (PatBase NoInfo Name) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn93 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn93 PatBase NoInfo Name
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (PatBase NoInfo Name -> HappyWrap93
HappyWrap93 PatBase NoInfo Name
x)
{-# INLINE happyIn93 #-}
happyOut93 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap93
happyOut93 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap93
happyOut93 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut93 #-}
newtype HappyWrap94 = HappyWrap94 ([PatBase NoInfo Name])
happyIn94 :: ([PatBase NoInfo Name]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn94 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[PatBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn94 [PatBase NoInfo Name]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([PatBase NoInfo Name] -> HappyWrap94
HappyWrap94 [PatBase NoInfo Name]
x)
{-# INLINE happyIn94 #-}
happyOut94 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap94
happyOut94 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap94
happyOut94 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut94 #-}
newtype HappyWrap95 = HappyWrap95 (PatBase NoInfo Name)
happyIn95 :: (PatBase NoInfo Name) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn95 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn95 PatBase NoInfo Name
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (PatBase NoInfo Name -> HappyWrap95
HappyWrap95 PatBase NoInfo Name
x)
{-# INLINE happyIn95 #-}
happyOut95 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap95
happyOut95 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap95
happyOut95 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut95 #-}
newtype HappyWrap96 = HappyWrap96 ((Name, PatBase NoInfo Name))
happyIn96 :: ((Name, PatBase NoInfo Name)) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn96 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, PatBase NoInfo Name) -> HappyAbsSyn t102 t103 t104 t105
happyIn96 (Name, PatBase NoInfo Name)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((Name, PatBase NoInfo Name) -> HappyWrap96
HappyWrap96 (Name, PatBase NoInfo Name)
x)
{-# INLINE happyIn96 #-}
happyOut96 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap96
happyOut96 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap96
happyOut96 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut96 #-}
newtype HappyWrap97 = HappyWrap97 ([(Name, PatBase NoInfo Name)])
happyIn97 :: ([(Name, PatBase NoInfo Name)]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn97 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[(Name, PatBase NoInfo Name)] -> HappyAbsSyn t102 t103 t104 t105
happyIn97 [(Name, PatBase NoInfo Name)]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([(Name, PatBase NoInfo Name)] -> HappyWrap97
HappyWrap97 [(Name, PatBase NoInfo Name)]
x)
{-# INLINE happyIn97 #-}
happyOut97 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap97
happyOut97 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap97
happyOut97 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut97 #-}
newtype HappyWrap98 = HappyWrap98 ([(Name, PatBase NoInfo Name)])
happyIn98 :: ([(Name, PatBase NoInfo Name)]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn98 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[(Name, PatBase NoInfo Name)] -> HappyAbsSyn t102 t103 t104 t105
happyIn98 [(Name, PatBase NoInfo Name)]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([(Name, PatBase NoInfo Name)] -> HappyWrap98
HappyWrap98 [(Name, PatBase NoInfo Name)]
x)
{-# INLINE happyIn98 #-}
happyOut98 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap98
happyOut98 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap98
happyOut98 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut98 #-}
newtype HappyWrap99 = HappyWrap99 ((AttrAtom Name, Loc))
happyIn99 :: ((AttrAtom Name, Loc)) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn99 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(AttrAtom Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn99 (AttrAtom Name, Loc)
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ((AttrAtom Name, Loc) -> HappyWrap99
HappyWrap99 (AttrAtom Name, Loc)
x)
{-# INLINE happyIn99 #-}
happyOut99 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap99
happyOut99 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap99
happyOut99 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut99 #-}
newtype HappyWrap100 = HappyWrap100 (AttrInfo Name)
happyIn100 :: (AttrInfo Name) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn100 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
AttrInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn100 AttrInfo Name
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# (AttrInfo Name -> HappyWrap100
HappyWrap100 AttrInfo Name
x)
{-# INLINE happyIn100 #-}
happyOut100 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap100
happyOut100 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap100
happyOut100 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut100 #-}
newtype HappyWrap101 = HappyWrap101 ([AttrInfo Name])
happyIn101 :: ([AttrInfo Name]) -> (HappyAbsSyn t102 t103 t104 t105)
happyIn101 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[AttrInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn101 [AttrInfo Name]
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# ([AttrInfo Name] -> HappyWrap101
HappyWrap101 [AttrInfo Name]
x)
{-# INLINE happyIn101 #-}
happyOut101 :: (HappyAbsSyn t102 t103 t104 t105) -> HappyWrap101
happyOut101 :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap101
happyOut101 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut101 #-}
happyIn102 :: t102 -> (HappyAbsSyn t102 t103 t104 t105)
happyIn102 :: forall {k} {k} {k} t102 (t103 :: k) (t104 :: k) (t105 :: k).
t102 -> HappyAbsSyn t102 t103 t104 t105
happyIn102 t102
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# t102
x
{-# INLINE happyIn102 #-}
happyOut102 :: (HappyAbsSyn t102 t103 t104 t105) -> t102
happyOut102 :: forall {k} {k} {k} t102 (t103 :: k) (t104 :: k) (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> t102
happyOut102 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut102 #-}
happyIn103 :: t103 -> (HappyAbsSyn t102 t103 t104 t105)
happyIn103 :: forall {k} {k} {k} t103 (t102 :: k) (t104 :: k) (t105 :: k).
t103 -> HappyAbsSyn t102 t103 t104 t105
happyIn103 t103
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# t103
x
{-# INLINE happyIn103 #-}
happyOut103 :: (HappyAbsSyn t102 t103 t104 t105) -> t103
happyOut103 :: forall {k} {k} {k} (t102 :: k) t103 (t104 :: k) (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> t103
happyOut103 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut103 #-}
happyIn104 :: t104 -> (HappyAbsSyn t102 t103 t104 t105)
happyIn104 :: forall {k} {k} {k} t104 (t102 :: k) (t103 :: k) (t105 :: k).
t104 -> HappyAbsSyn t102 t103 t104 t105
happyIn104 t104
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# t104
x
{-# INLINE happyIn104 #-}
happyOut104 :: (HappyAbsSyn t102 t103 t104 t105) -> t104
happyOut104 :: forall {k} {k} {k} (t102 :: k) (t103 :: k) t104 (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> t104
happyOut104 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut104 #-}
happyIn105 :: t105 -> (HappyAbsSyn t102 t103 t104 t105)
happyIn105 :: forall {k} {k} {k} t105 (t102 :: k) (t103 :: k) (t104 :: k).
t105 -> HappyAbsSyn t102 t103 t104 t105
happyIn105 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# t105
x
{-# INLINE happyIn105 #-}
happyOut105 :: (HappyAbsSyn t102 t103 t104 t105) -> t105
happyOut105 :: forall {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k) t105.
HappyAbsSyn t102 t103 t104 t105 -> t105
happyOut105 HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOut105 #-}
happyInTok :: (L Token) -> (HappyAbsSyn t102 t103 t104 t105)
happyInTok :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
L Token -> HappyAbsSyn t102 t103 t104 t105
happyInTok L Token
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# L Token
x
{-# INLINE happyInTok #-}
happyOutTok :: (HappyAbsSyn t102 t103 t104 t105) -> (L Token)
happyOutTok :: forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
x = unsafeCoerce# :: forall a b. a -> b
Happy_GHC_Exts.unsafeCoerce# HappyAbsSyn t102 t103 t104 t105
x
{-# INLINE happyOutTok #-}


happyExpList :: HappyAddr
happyExpList :: HappyAddr
happyExpList = Addr# -> HappyAddr
HappyA# Addr#
"\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\x00\x00\x00\x00\x00\x00\x00\x00\x04\x04\x80\x3b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5c\x00\x00\x20\x00\x00\x00\x48\x01\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x20\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\x00\x00\x00\x00\x00\x00\x00\x00\x04\x04\x80\x3b\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\x20\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\x30\x00\x00\x00\x00\x00\x00\x00\x00\x04\x04\x80\x1b\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\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\x04\x00\x00\x00\x00\x00\x00\x48\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\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\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x20\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\x00\x00\x00\x00\x00\x00\x00\x00\x04\x04\x80\x3b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\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\x80\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x20\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\x00\x00\x00\x00\x00\x00\x00\x00\x04\x04\x80\x3b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\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\x30\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6f\xfb\xff\xff\x07\x00\x02\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x7c\xff\x7f\x00\x00\x00\x00\x48\x01\x00\x18\x40\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\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\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\x80\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0c\x00\x00\x00\x00\x00\x00\x48\x15\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x14\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x10\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x10\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\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\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\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\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\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\xfd\xff\xff\xe0\xfb\xff\xff\x5f\x25\x02\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x27\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x7c\xff\x7f\x00\x00\x00\x00\x48\x01\x00\x18\x40\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\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\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x44\x00\x00\x00\x00\x00\x00\x48\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x44\x00\x00\x00\x00\x00\x00\x48\x01\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\x04\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5c\x00\x00\x20\x00\x00\x00\x48\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5c\x00\x00\x20\x00\x00\x00\x58\x01\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x01\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x01\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\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\x00\x00\x00\x00\x00\x00\x00\x00\x04\x04\x80\x3b\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\x30\x00\x00\x00\x00\x00\x00\x00\x00\x04\x04\x80\x3b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\x00\x00\x00\x00\x00\x00\x00\x00\x04\x04\x80\x3b\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\x30\x00\x00\x00\x00\x00\x00\x00\x00\x04\x04\x80\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\x00\x00\x00\x00\x00\x00\x00\x00\x04\x04\x80\x3b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\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\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\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\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\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\x10\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\x10\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x80\x00\x00\x00\x00\x00\x00\x10\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\x5c\x00\x00\x20\x00\x00\x00\x58\x01\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\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\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\x04\x01\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\x40\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\x5c\x00\x00\x20\x00\x00\x00\x48\x01\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x7c\xff\x7f\x00\x00\x00\x00\x48\x01\x00\x18\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x10\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\x10\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\x04\x00\x00\x60\xfb\xff\xff\x5f\x14\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x01\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\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\x08\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\x30\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x08\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\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\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\x10\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\x52\x7d\xff\x7f\xc0\x00\x00\x00\x58\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\x08\x30\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6f\xfb\xff\xff\x07\x00\x02\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x80\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\x04\x00\x00\x00\x00\x00\x00\x00\x01\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\x52\x7d\xff\x7f\xc0\x00\x00\x00\x58\x25\x00\x1c\x40\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\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\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\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\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\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\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\x04\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\x10\x00\x30\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6f\xfb\xff\xff\x07\x00\x12\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\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\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\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x10\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x30\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x80\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x01\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\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x14\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\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\x10\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\xc1\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x80\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\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\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\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\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\x04\x01\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5c\x00\x00\x20\x00\x00\x00\x48\x01\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5c\x00\x00\x20\x00\x00\x00\x48\x01\x40\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\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\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\x80\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\x10\x00\x10\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\x04\x00\x00\x00\x00\x00\x00\x48\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\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\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\x0c\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\xc1\x01\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\x60\xfb\xff\xff\x07\x00\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\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\xc1\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\xfb\xff\xff\x07\x00\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\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x60\xfb\xff\xff\x5f\x14\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\xc1\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\xfb\xff\xff\x07\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x60\xfb\xff\xff\x5f\x14\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\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\x10\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\x10\x08\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\x04\x00\x00\x00\x00\x00\x00\x48\x10\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\xc1\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\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\x04\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\x04\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\x04\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\x10\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\x00\x00\x00\x00\x00\x00\x00\x00\x04\x04\x80\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x10\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\xc1\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\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\x10\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\x08\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\x10\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\x08\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\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\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\x04\x00\x40\x27\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\x10\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\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x08\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\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x10\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\xfb\xff\xcf\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\xfb\xff\xcf\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\xf0\x07\x0e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\xf0\x07\x0e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\xf0\x07\x0e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\xfb\xff\xef\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\xfb\xff\xef\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\xf0\x07\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\xf0\x07\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\xfa\x07\xce\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\xfa\x07\xce\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\xfa\x07\xce\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\xfa\x07\xce\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\xfa\x07\xce\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\xfa\x07\xce\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\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\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\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\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\xc0\x07\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\xc0\x07\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\xf0\x07\x0e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\xf0\x07\x0e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\xfa\x07\xce\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\xc0\x07\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\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6f\xfb\xff\xff\x07\x00\x02\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6f\xfb\xff\xff\x07\x00\x02\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6f\xfb\xff\xff\x07\x00\x02\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6f\xfb\xff\xff\x07\x00\x02\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6f\xfb\xff\xff\x07\x00\x02\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\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\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\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\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5c\x00\x00\x20\x00\x00\x00\x48\x01\x40\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\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x14\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\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\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\x44\xff\x5f\x40\x00\x00\x00\x48\x14\x00\x18\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\x6f\xfb\xff\xff\x07\x00\x12\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\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\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x10\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x10\x1c\x40\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\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\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x10\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\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\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x58\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\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\x80\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x10\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6f\xfb\xff\xff\x17\x00\x02\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\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\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\x04\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\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\x04\x01\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\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\x10\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\x10\x08\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\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5c\x00\x00\x20\x00\x00\x00\x48\x01\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\x44\x00\x00\x00\x00\x00\x00\x48\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\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\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\x5c\x00\x00\x20\x00\x00\x00\x48\x01\x40\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\x5c\x00\x00\x20\x00\x00\x00\x48\x01\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5c\x00\x00\x20\x00\x00\x00\x48\x01\x40\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\x04\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5c\x00\x00\x20\x00\x00\x00\x48\x01\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\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5c\x00\x00\x20\x00\x00\x00\x48\x01\x40\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\x30\x00\x00\x00\x00\x00\x00\x00\x00\x04\x04\x80\x3b\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\x01\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\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\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\x10\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\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\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\x04\x00\x00\x00\x00\x00\x00\x48\x14\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\x04\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x14\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5c\x00\x00\x20\x00\x00\x00\x48\x01\x40\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\x30\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\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\x30\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\x30\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\x10\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\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\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\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6f\xfb\xff\xff\x07\x00\x12\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\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\x6f\xfb\xff\xff\x07\x00\x02\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x44\xff\x5f\x40\x00\x00\x00\x48\x10\x00\x18\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\x08\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\x10\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\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\xff\x1f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x44\xff\x5f\x60\xfb\xff\xff\x5f\x14\x02\x18\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x01\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\x30\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\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\xb0\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\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\x04\x00\x00\x00\x00\x00\x00\x48\x14\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\x00\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\x00\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\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\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\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\x04\x00\x00\x00\x00\x00\x00\x48\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x20\x00\x80\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\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\x04\x00\x40\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x40\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\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\x04\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\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\x04\x00\x00\x60\xfb\xff\xff\x07\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x08\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\x00\x80\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\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\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\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\x04\x00\x00\x00\x00\x00\x00\x48\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\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x10\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\x10\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\x10\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\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x14\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\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\x10\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\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x14\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\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5c\x00\x00\x20\x00\x00\x00\x48\x01\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\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\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\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\x10\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\x10\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\x5c\x00\x00\x20\x00\x00\x00\x48\x01\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc1\x01\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\x08\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\x08\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x20\x00\x80\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\xc1\x01\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\x08\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\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\xc1\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc1\x01\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\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0c\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\x08\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\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\x10\x00\x08\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x08\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x60\xfb\xff\xff\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\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\x60\xfb\xff\xff\x07\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6f\xfb\xff\xff\x07\x00\x02\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6f\xfb\xff\xff\x07\x00\x02\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6f\xfb\xff\xff\x07\x00\x02\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\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\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\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\xb0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\x00\x03\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\x30\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\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\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\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x80\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\x10\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\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\x10\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xff\x1f\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5c\x00\x00\x20\x00\x00\x00\x48\x01\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\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\x44\xff\x5f\x40\x00\x00\x00\x48\x10\x00\x18\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6f\xfb\xff\xff\x07\x00\x02\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6f\xfb\xff\xff\x07\x00\x02\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\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\x04\x01\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\x10\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\x30\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\x08\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\x5c\x00\x00\x20\x00\x00\x00\x48\x01\x40\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\x5c\x00\x00\x20\x00\x00\x00\x48\x01\x40\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\x6f\xfb\xff\xff\x07\x00\x02\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\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\x44\xff\x5f\x40\x00\x00\x00\x48\x14\x00\x18\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\x44\xff\x5f\x40\x00\x00\x00\x48\x14\x00\x18\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5c\x00\x00\x20\x00\x00\x00\x48\x01\x40\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\x04\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x44\xff\x5f\x40\x00\x00\x00\x48\x14\x00\x18\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\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\x30\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\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\x30\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\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\x04\x00\x40\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc1\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\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\x04\x00\x00\x00\x00\x00\x00\x48\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\x10\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\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x08\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\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\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\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\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\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\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x48\x14\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\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\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\x30\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x52\x7d\xff\x7f\xc0\x00\x00\x00\x48\x25\x00\x1c\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\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\x30\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\x30\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5c\x00\x00\x20\x00\x00\x00\x48\x01\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5c\x00\x00\x20\x00\x00\x00\x48\x01\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\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5c\x00\x00\x20\x00\x00\x00\x48\x01\x40\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5c\x00\x00\x20\x00\x00\x00\x48\x01\x40\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\x08\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\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\x60\xfb\xff\xff\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb0\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\x00\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x30\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\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\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\x44\xff\x5f\x40\x00\x00\x00\x48\x14\x00\x18\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\xc1\x01\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\x04\x00\x00\x00\x00\x00\x00\x48\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\x30\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\x30\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\x08\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x10\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"#

{-# NOINLINE happyExpListPerState #-}
happyExpListPerState :: Int -> [a]
happyExpListPerState Int
st =
    [a]
token_strs_expected
  where token_strs :: [a]
token_strs = [a
"error",a
"%dummy",a
"%start_prog",a
"%start_futharkType",a
"%start_expression",a
"%start_modExpression",a
"%start_declaration",a
"Doc",a
"Prog",a
"Dec",a
"Decs",a
"Dec_",a
"SigExp",a
"TypeRef",a
"SigBind",a
"ModExp",a
"ModExpApply",a
"ModExpAtom",a
"SimpleSigExp",a
"ModBind",a
"ModParam",a
"ModParams",a
"Liftedness",a
"Spec",a
"Specs",a
"SizeBinder",a
"SizeBinders1",a
"TypeParam",a
"TypeParams",a
"BinOp",a
"BindingBinOp",a
"BindingId",a
"Val",a
"TypeAbbr",a
"TypeExp",a
"TypeExpDims",a
"TypeExpTerm",a
"SumType",a
"SumClauses",a
"SumClause",a
"TypeExpApply",a
"TypeExpAtom",a
"Constr",a
"TypeArg",a
"FieldType",a
"FieldTypes1",a
"TupleTypes",a
"SizeExp",a
"FunParam",a
"FunParams1",a
"FunParams",a
"QualName",a
"Exp",a
"Exp2",a
"ApplyList",a
"Atom",a
"NumLit",a
"PrimLit",a
"Exps1",a
"Exps1_",a
"FieldAccess",a
"FieldAccesses",a
"FieldAccesses_",a
"Field",a
"Fields",a
"Fields1",a
"LetExp",a
"LetBody",a
"BinOpExp",a
"SectionExp",a
"RangeExp",a
"IfExp",a
"LoopExp",a
"MatchExp",a
"Cases",a
"Case",a
"CPat",a
"CPats1",a
"CInnerPat",a
"ConstrFields",a
"CFieldPat",a
"CFieldPats",a
"CFieldPats1",a
"CaseLiteral",a
"LoopForm",a
"VarSlice",a
"QualVarSlice",a
"DimIndex",a
"DimIndices",a
"DimIndices1",a
"VarId",a
"FieldId",a
"Pat",a
"Pats1",a
"InnerPat",a
"FieldPat",a
"FieldPats",a
"FieldPats1",a
"AttrAtom",a
"AttrInfo",a
"Attrs",a
"maybeAscription__SigExp__",a
"maybeAscription__SimpleSigExp__",a
"maybeAscription__TypeExp__",a
"maybeAscription__TypeExpTerm__",a
"if",a
"then",a
"else",a
"let",a
"def",a
"loop",a
"in",a
"match",a
"case",a
"id",a
"'id['",a
"'qid['",a
"'qid.('",a
"constructor",a
"'.int'",a
"intlit",a
"i8lit",a
"i16lit",a
"i32lit",a
"i64lit",a
"u8lit",a
"u16lit",a
"u32lit",a
"u64lit",a
"floatlit",a
"f16lit",a
"f32lit",a
"f64lit",a
"stringlit",a
"charlit",a
"'.'",a
"'..'",a
"'...'",a
"'..<'",a
"'..>'",a
"'='",a
"'*'",a
"'-'",a
"'!'",a
"'<'",a
"'^'",a
"'~'",a
"'|'",a
"'+...'",a
"'-...'",a
"'*...'",a
"'/...'",a
"'%...'",a
"'//...'",a
"'%%...'",a
"'==...'",a
"'!=...'",a
"'<...'",a
"'>...'",a
"'<=...'",a
"'>=...'",a
"'**...'",a
"'<<...'",a
"'>>...'",a
"'|>...'",a
"'<|...'",a
"'|...'",a
"'&...'",a
"'^...'",a
"'||...'",a
"'&&...'",a
"'('",a
"')'",a
"')['",a
"'{'",a
"'}'",a
"'['",a
"']'",a
"'#['",a
"','",a
"'_'",a
"'\\\\'",a
"'\\''",a
"'\\'^'",a
"'\\'~'",a
"'`'",a
"entry",a
"'->'",a
"':'",a
"':>'",a
"'?'",a
"for",a
"do",a
"with",a
"assert",a
"true",a
"false",a
"while",a
"include",a
"import",a
"type",a
"module",a
"val",a
"open",a
"local",a
"doc",a
"hole",a
"%eof"]
        bit_start :: Int
bit_start = Int
st forall a. Num a => a -> a -> a
Prelude.* Int
208
        bit_end :: Int
bit_end = (Int
st forall a. Num a => a -> a -> a
Prelude.+ Int
1) forall a. Num a => a -> a -> a
Prelude.* Int
208
        read_bit :: Int -> Bool
read_bit = HappyAddr -> Int -> Bool
readArrayBit HappyAddr
happyExpList
        bits :: [Bool]
bits = forall a b. (a -> b) -> [a] -> [b]
Prelude.map Int -> Bool
read_bit [Int
bit_start..Int
bit_end forall a. Num a => a -> a -> a
Prelude.- Int
1]
        bits_indexed :: [(Bool, Int)]
bits_indexed = forall a b. [a] -> [b] -> [(a, b)]
Prelude.zip [Bool]
bits [Int
0..Int
207]
        token_strs_expected :: [a]
token_strs_expected = forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
Prelude.concatMap (Bool, Int) -> [a]
f [(Bool, Int)]
bits_indexed
        f :: (Bool, Int) -> [a]
f (Bool
Prelude.False, Int
_) = []
        f (Bool
Prelude.True, Int
nr) = [[a]
token_strs forall a. [a] -> Int -> a
Prelude.!! Int
nr]

happyActOffsets :: HappyAddr
happyActOffsets :: HappyAddr
happyActOffsets = Addr# -> HappyAddr
HappyA# Addr#
"\x50\x00\xbc\x01\x00\x04\x3c\x00\x50\x00\xa3\xff\x00\x00\x91\x00\xef\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0e\x01\x13\x01\x5b\x02\x17\x00\x48\x00\xc5\x00\xf7\xff\x3c\x00\x50\x00\x50\x01\xa4\x00\xa4\x00\x00\x00\x00\x01\x3c\x00\x50\x00\x5c\x00\x6e\x00\x00\x00\x00\x00\x90\x00\xa1\x06\xae\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01\x00\x04\xb3\x00\xf6\x00\x00\x04\x5e\x00\x5e\x00\x00\x04\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\x04\x00\x04\x01\x00\x01\x03\xbb\x00\x32\x03\x53\x01\xae\x04\x00\x00\x00\x00\x00\x00\x54\x00\x93\x00\x00\x00\xcf\x00\xb0\x01\x67\x01\x00\x00\x00\x00\x00\x00\x5e\x03\x5e\x03\x19\x02\x02\x01\x31\x01\x5e\x03\xbf\x00\x50\x00\xdc\x00\x50\x00\x50\x00\x00\x00\x91\x00\x50\x00\x2f\x01\x2d\x01\x26\x01\x00\x00\x00\x00\x0c\x01\x33\x01\x60\x01\x00\x00\x00\x00\x00\x00\xa8\x00\x44\x00\x00\x00\x00\x00\x5f\x01\x62\x01\xb4\x01\x00\x00\x00\x00\x5e\x03\x00\x00\xa8\x01\xbc\x01\xae\x04\x53\x01\xb2\x01\x00\x00\x00\x00\xa3\x05\x8c\x03\x00\x00\x00\x00\xc8\x01\xda\x01\x00\x00\x6c\x01\xca\x01\xcb\x01\x00\x00\xe0\x01\x0d\x02\x00\x00\x39\x02\xbe\x01\x18\x01\x9f\x03\xd3\x06\x00\x01\x00\x00\x3e\x00\x00\x00\x75\x01\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\x7b\x02\x00\x00\x00\x00\x78\x01\xd0\x05\x28\x02\x45\x02\x00\x00\xd2\x01\x52\x02\xfb\xff\x3a\x00\x57\x02\x8e\x03\x6c\x02\xf6\x00\xb8\x02\xc0\x02\x68\x02\xdf\x02\x04\x00\x00\x01\x00\x00\xe2\x02\x00\x04\x00\x00\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\xee\x02\xf2\x00\xbc\x01\xbc\x01\x00\x00\x9c\x02\x03\x03\xdb\x02\x28\x01\x00\x00\x00\x00\x00\x00\x57\x01\x00\x00\xb6\x02\xea\x02\x37\x03\xc3\x02\x00\x00\x00\x00\x00\x00\x18\x02\x00\x00\x8e\x08\xfd\x02\x18\x02\x8e\x08\xb5\x08\xa3\x05\x18\x02\xdc\x08\xa3\x05\x00\x00\x00\x00\x05\x03\xb1\x01\x00\x00\x00\x00\x53\x01\x18\x02\x53\x01\x5b\x03\x5d\x03\x6e\x03\x75\x03\xd0\x01\x53\x01\x53\x01\x91\x00\x09\x03\x53\x01\x18\x02\x7d\x03\x67\x03\x63\x03\x54\x03\x72\x03\x00\x00\x66\x01\xa6\x04\x00\x00\x00\x00\x56\x03\x6f\x03\x47\x00\x00\x00\x00\x00\xb1\x03\x8f\x01\x2f\x02\x61\x03\x06\x13\xe8\x12\x73\x13\x73\x13\x73\x13\xca\x12\xca\x12\x85\x13\x85\x13\x00\x00\x22\x13\x22\x13\x22\x13\x22\x13\x22\x13\x22\x13\xac\x03\xac\x03\xac\x03\xac\x03\xac\x03\x20\x04\x20\x04\x73\x13\x73\x13\x22\x13\x20\x04\xac\x03\x05\x07\x05\x07\x05\x07\x37\x07\x57\x04\x69\x07\x00\x00\x00\x00\x00\x04\x8f\x03\x53\x01\x00\x04\x00\x04\xb8\x03\x00\x00\xb7\x03\xbc\x01\xad\x03\x00\x04\x01\x01\x00\x04\x00\x00\x06\x04\x54\x05\x00\x00\x05\x06\x00\x04\x00\x00\x2f\x02\x8c\x02\x00\x00\xb6\x03\x00\x00\xe9\x02\xdd\x03\xf5\x03\x00\x04\x46\x03\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x00\x04\x26\x04\x8f\x01\xa3\x03\x00\x04\x3a\x06\x00\x00\x00\x04\x00\x00\xca\x03\x00\x04\x00\x00\xd0\x00\x00\x04\x29\x00\xf7\x03\x16\x04\x00\x00\x03\x04\xd3\x01\x23\x04\x19\x02\x00\x00\x00\x00\x00\x00\xb0\x01\x35\x04\x00\x00\x00\x00\xbc\x01\x00\x00\xbc\x01\xbc\x01\x00\x00\xe8\x03\x19\x02\x55\x04\xbc\x01\x00\x00\x50\x00\x00\x00\x00\x00\x00\x00\x62\x04\x00\x00\x00\x00\x00\x00\x61\x04\x5c\x04\x6d\x04\x00\x00\x00\x00\x00\x04\x00\x00\x09\x01\x00\x00\x00\x00\xe8\x03\x09\x01\xbc\x01\x69\x02\x6a\x04\x8d\x04\x00\x00\x69\x02\x00\x00\x69\x02\x00\x00\x90\x04\xa9\x04\x00\x00\xb4\x04\x00\x00\x00\x00\x00\x00\xc5\x04\x00\x00\x6c\x06\x00\x04\x00\x00\x69\x07\x00\x04\x6b\x05\x00\x00\xbd\x04\xce\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x75\x14\x05\x05\xe8\x03\xec\x03\x00\x00\x00\x00\x69\x02\xfc\x04\x28\x05\x22\x05\x4e\x04\x00\x04\x00\x00\x09\x01\x00\x04\x88\x00\x88\x00\xfa\x04\x00\x00\x49\x00\x00\x04\x00\x04\x00\x04\x00\x04\x07\x05\x00\x00\x00\x04\x00\x00\x00\x00\x6d\x01\x3c\x00\x6d\x01\xa6\x04\xa6\x04\x16\x05\x00\x00\xec\x03\x6d\x01\x00\x03\x55\x05\xaa\x04\xe7\x02\x8a\x00\x6d\x01\x59\x05\x4d\x05\x6d\x01\x00\x00\x6d\x01\x2f\x05\x64\x05\x53\x01\x3a\x05\x00\x00\x00\x00\x3a\x05\x3a\x05\x09\x01\x00\x00\x00\x00\x00\x00\x49\x05\x3c\x05\x00\x00\x3c\x05\x09\x01\x03\x09\x4a\x05\x5b\x05\x86\x05\xbc\x01\x8e\x05\x00\x00\x60\x05\x98\x05\x9e\x05\xa1\x05\x00\x00\xbc\x01\x18\x02\xcc\x03\xcc\x03\x3c\x00\x00\x00\x18\x02\xcc\x03\x6d\x01\x00\x00\x18\x02\x18\x02\x45\x05\x5f\x03\xcc\x03\x81\x05\x00\x00\x00\x00\x00\x00\x42\x03\x00\x00\x44\x03\xac\x12\xa9\x05\xc3\x07\x69\x07\x69\x07\x69\x07\x00\x04\xc4\x05\x00\x00\x00\x00\x00\x00\x00\x04\x00\x00\x00\x00\x00\x00\x88\x00\x00\x00\xe4\x02\x5c\x05\x00\x04\x00\x04\xa5\x05\x9f\x05\xb0\x05\x00\x00\x63\x00\xb6\x05\x0f\x02\x75\x14\x00\x00\x00\x00\x00\x00\x00\x00\xbc\x01\x00\x04\x00\x00\x00\x00\x6b\x05\x69\x07\x69\x07\x00\x04\xdc\x05\x00\x04\x00\x00\x00\x00\x00\x00\x18\x04\x00\x00\x00\x00\x00\x00\xdf\x05\xe4\x02\xd9\x05\x00\x00\xbc\x01\x00\x00\x00\x00\xbc\x01\x00\x00\x00\x00\x00\x00\x69\x07\x00\x00\x00\x00\x00\x00\x00\x00\x54\x05\x00\x00\x54\x05\xbc\x01\x00\x00\x71\x04\x54\x05\xe4\x02\xe4\x02\x00\x04\x00\x00\xe4\x02\x00\x04\xe4\x02\x00\x04\x00\x00\x00\x00\xa6\x04\x18\x02\x25\x06\x6d\x01\x01\x06\x0d\x06\x80\x03\x34\x06\x10\x06\x59\x06\x00\x00\x00\x04\x00\x04\x00\x04\x5c\x06\x00\x04\x00\x00\x00\x04\x66\x06\x09\x01\x00\x00\x00\x04\xe4\x02\xe4\x02\x00\x04\xe4\x02\xe4\x02\xe4\x02\xbc\x01\x19\x02\x43\x06\xbc\x01\xbc\x01\x05\x04\x73\x06\x9b\x06\x00\x00\xac\x12\x88\x00\xe4\x02\x00\x00\x00\x00\x00\x00\x00\x00\x80\x06\x84\x06\x00\x00\x00\x00\x54\x05\x00\x00\x18\x02\x00\x00\x00\x00\x6d\x01\x00\x00\x00\x00\xe4\x02\xe4\x02\x05\x04\xc0\x06\x00\x00\x00\x00"#

happyGotoOffsets :: HappyAddr
happyGotoOffsets :: HappyAddr
happyGotoOffsets = Addr# -> HappyAddr
HappyA# Addr#
"\xc4\x02\x64\x06\xa0\x03\x06\x02\xf3\x04\x00\x00\x00\x00\x3d\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x69\x00\x6b\x00\x3e\x03\xcd\x06\x00\x00\xd8\x06\x00\x00\x48\x02\x84\x13\x00\x00\xf9\xff\x74\x00\x00\x00\x91\x03\x4f\x02\xb2\x07\xe2\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xdb\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb2\x03\xfd\x03\x4e\x00\xcd\xff\x29\x09\xe3\x07\xfc\x07\x40\x09\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\x96\x0b\xad\x0b\x98\x07\x75\x02\xe6\x02\xa7\x03\x6e\x01\x89\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x58\x14\xea\x07\x00\x00\x00\x00\x00\x00\x9e\x02\xb3\x02\x14\x04\xcb\x06\xe4\x00\xe0\x02\xd4\x06\x8f\x05\x00\x00\x46\x09\x63\x13\x00\x00\x9d\x04\x69\x13\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xee\x03\x00\x00\x00\x00\xcb\x06\x00\x00\x00\x00\x00\x00\x00\x00\xf3\x02\x00\x00\x43\x01\xfd\x06\x75\x05\x77\x01\x90\x06\x00\x00\x00\x00\x96\x00\xa1\x03\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\xc4\x0b\x00\x00\xe7\x06\x2a\x04\x00\x00\x00\x00\x00\x00\xdb\x0b\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\xea\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf2\x0b\x00\x00\x63\x04\xca\x06\x00\x00\x40\x04\xbb\x04\xdf\x01\x00\x00\x00\x00\xe4\x04\x00\x00\x00\x00\x17\x05\x00\x00\x00\x00\x09\x0c\x00\x00\x20\x0c\x37\x0c\x4e\x0c\x65\x0c\x7c\x0c\x93\x0c\xaa\x0c\xc1\x0c\xd8\x0c\xef\x0c\x06\x0d\x1d\x0d\x34\x0d\x4b\x0d\x62\x0d\x79\x0d\x90\x0d\xa7\x0d\xbe\x0d\xd5\x0d\xec\x0d\x03\x0e\x1a\x0e\x31\x0e\x48\x0e\x5f\x0e\x76\x0e\x8d\x0e\xa4\x0e\xbb\x0e\xd2\x0e\xe9\x0e\xed\x06\x5d\x01\x2f\x07\x61\x07\x00\x00\xc2\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1e\x00\x00\x00\x00\x00\x1b\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x3e\x05\x00\x00\x41\x05\x00\x00\x40\x05\x43\x05\x00\x00\xfb\x00\x47\x05\x5d\x05\x51\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5f\x00\x62\x05\xa0\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xa1\x00\xa9\x01\x8e\x13\x00\x00\xac\x01\x76\x05\x00\x00\x00\x00\x7f\x05\xc4\x06\x00\x00\x00\x00\x7b\x00\xd1\x02\x00\x00\x00\x00\x00\x00\x00\x00\xff\xff\x00\x00\x00\x00\x00\x00\x67\x05\x15\x08\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\x57\x09\x00\x00\x9a\x01\x6e\x09\x85\x09\x00\x00\x00\x00\x00\x00\xc1\x07\x00\x00\x9c\x09\x23\x02\xb3\x09\x00\x00\x68\x05\x8e\x02\x00\x00\x00\x00\x00\x0f\x00\x00\x60\x08\x17\x0f\x00\x00\x00\x00\x00\x00\x2e\x08\x00\x00\x00\x00\x2e\x0f\x45\x0f\x5c\x0f\x73\x0f\x8a\x0f\xa1\x0f\xb8\x0f\xcf\x0f\xe6\x0f\xfd\x0f\x14\x10\x2b\x10\x42\x10\x59\x10\x70\x10\x87\x10\x9e\x10\xb5\x10\xcc\x10\xe3\x10\xfa\x10\x11\x11\x28\x11\x3f\x11\x56\x11\x6d\x11\x84\x11\x9b\x11\xf7\x06\x80\x05\x47\x08\x43\x03\x00\x00\x00\x00\xca\x09\x00\x00\x56\x00\xe1\x09\x00\x00\x20\x03\xf8\x09\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf6\x05\x00\x00\x00\x00\x00\x00\x58\x14\x00\x00\x00\x00\x00\x00\x89\x08\x00\x00\xa2\x13\xaa\x12\x00\x00\xf5\x00\x2b\x06\x00\x00\xc2\x13\x00\x00\x74\x13\x00\x00\x00\x00\x00\x00\x13\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0f\x0a\x00\x00\xfe\x03\x00\x00\x00\x00\x4b\x03\x3a\x02\xd2\x13\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\xb2\x11\x00\x00\x00\x00\xc9\x11\x71\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x17\x07\x38\x02\x78\x02\x5f\x05\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xfc\x06\x26\x0a\x00\x00\xc9\x02\x3d\x0a\x83\x05\x85\x05\xeb\x06\x00\x00\x00\x00\xe0\x11\xf7\x11\x0e\x12\x25\x12\x00\x00\x00\x00\x3c\x12\x00\x00\x00\x00\xda\x00\x5a\x02\x38\x01\x6e\x02\x2e\x03\x00\x00\x00\x00\x90\x05\x69\x01\x44\x07\x00\x00\x04\x06\x00\x00\xe7\x05\xad\x01\x67\x00\x00\x00\xf5\x01\x00\x00\xf6\x01\x00\x00\x00\x00\xc9\x01\xf4\x06\x00\x00\x00\x00\xf5\x06\x01\x07\x58\x04\x00\x00\x00\x00\x00\x00\x00\x00\x1a\x07\x00\x00\x1b\x07\x98\x04\x00\x00\x00\x00\x00\x00\x00\x00\xe2\x13\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf2\x13\x0a\x06\x00\x00\x00\x00\x67\x02\x00\x00\x3b\x06\x00\x00\xfc\x01\x00\x00\x3d\x06\x3f\x06\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\x54\x0a\x00\x00\x00\x00\x00\x00\x00\x00\x6b\x0a\x00\x00\x00\x00\x00\x00\x4d\x06\x00\x00\x00\x00\x00\x00\x82\x0a\x99\x0a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x4c\x07\x00\x00\x00\x00\x00\x00\x00\x00\x02\x14\xb0\x0a\x00\x00\x00\x00\xa5\x03\x00\x00\x00\x00\x53\x12\x00\x00\x6a\x12\x00\x00\x00\x00\x00\x00\xa1\x04\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb2\x13\x00\x00\x00\x00\x12\x14\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x3b\x02\x00\x00\xeb\x02\x22\x14\x00\x00\x9a\x02\x48\x03\x00\x00\x00\x00\xc7\x0a\x00\x00\x00\x00\xde\x0a\x00\x00\x81\x12\x00\x00\x00\x00\x3b\x03\xa2\x06\x00\x00\x03\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf5\x0a\x0c\x0b\x23\x0b\x00\x00\x3a\x0b\x00\x00\x51\x0b\x00\x00\xab\x04\x00\x00\x68\x0b\x00\x00\x00\x00\x7f\x0b\x00\x00\x00\x00\x00\x00\x32\x14\x92\x06\x00\x00\x42\x14\x52\x14\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x7d\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xe0\x04\x00\x00\xa6\x06\x00\x00\x00\x00\x05\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#

happyAdjustOffset :: Happy_GHC_Exts.Int# -> Happy_GHC_Exts.Int#
happyAdjustOffset :: Int# -> Int#
happyAdjustOffset Int#
off = Int#
off

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

happyCheck :: HappyAddr
happyCheck :: HappyAddr
happyCheck = Addr# -> HappyAddr
HappyA# Addr#
"\xff\xff\x0a\x00\x01\x00\x0a\x00\x09\x00\x04\x00\x02\x00\x06\x00\x65\x00\x08\x00\x0b\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x0a\x00\x55\x00\x05\x00\x57\x00\x2c\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x2c\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x43\x00\x44\x00\x0a\x00\x46\x00\x0a\x00\x48\x00\x2c\x00\x4a\x00\x03\x00\x24\x00\x4d\x00\x54\x00\x55\x00\x0a\x00\x51\x00\x0f\x00\x04\x00\x05\x00\x67\x00\x60\x00\x54\x00\x55\x00\x43\x00\x5a\x00\x5b\x00\x5c\x00\x24\x00\x01\x00\x12\x00\x13\x00\x04\x00\x1f\x00\x06\x00\x1d\x00\x08\x00\x66\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x06\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x54\x00\x0a\x00\x43\x00\x05\x00\x18\x00\x46\x00\x18\x00\x26\x00\x27\x00\x48\x00\x24\x00\x29\x00\x4d\x00\x43\x00\x1d\x00\x04\x00\x05\x00\x38\x00\x07\x00\x3a\x00\x57\x00\x29\x00\x2c\x00\x29\x00\x04\x00\x05\x00\x5d\x00\x54\x00\x0f\x00\x4a\x00\x5f\x00\x4e\x00\x54\x00\x55\x00\x43\x00\x2c\x00\x43\x00\x52\x00\x55\x00\x46\x00\x57\x00\x48\x00\x2c\x00\x4a\x00\x1f\x00\x54\x00\x4d\x00\x16\x00\x17\x00\x0a\x00\x5f\x00\x60\x00\x61\x00\x54\x00\x63\x00\x64\x00\x65\x00\x57\x00\x54\x00\x5a\x00\x5b\x00\x5c\x00\x67\x00\x01\x00\x0a\x00\x0b\x00\x04\x00\x57\x00\x06\x00\x57\x00\x08\x00\x66\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x29\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x0a\x00\x4a\x00\x54\x00\x55\x00\x54\x00\x05\x00\x10\x00\x26\x00\x27\x00\x52\x00\x54\x00\x55\x00\x53\x00\x43\x00\x60\x00\x61\x00\x46\x00\x55\x00\x44\x00\x57\x00\x29\x00\x2a\x00\x5f\x00\x60\x00\x61\x00\x4b\x00\x63\x00\x64\x00\x43\x00\x67\x00\x57\x00\x46\x00\x2b\x00\x48\x00\x0a\x00\x4a\x00\x43\x00\x4c\x00\x0a\x00\x46\x00\x10\x00\x48\x00\x49\x00\x4a\x00\x2c\x00\x48\x00\x4d\x00\x25\x00\x26\x00\x0a\x00\x0a\x00\x0b\x00\x0c\x00\x0f\x00\x0e\x00\x16\x00\x17\x00\x0a\x00\x44\x00\x5a\x00\x5b\x00\x5c\x00\x0a\x00\x01\x00\x25\x00\x26\x00\x04\x00\x0a\x00\x06\x00\x1f\x00\x08\x00\x66\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x25\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x0a\x00\x54\x00\x43\x00\x48\x00\x0a\x00\x46\x00\x05\x00\x26\x00\x27\x00\x4a\x00\x10\x00\x4c\x00\x67\x00\x43\x00\x43\x00\x44\x00\x46\x00\x46\x00\x54\x00\x48\x00\x4a\x00\x43\x00\x4c\x00\x1f\x00\x46\x00\x55\x00\x43\x00\x57\x00\x4a\x00\x46\x00\x4c\x00\x43\x00\x4b\x00\x56\x00\x46\x00\x4c\x00\x43\x00\x44\x00\x0a\x00\x46\x00\x4c\x00\x48\x00\x0a\x00\x4a\x00\x20\x00\x2c\x00\x4d\x00\x23\x00\x16\x00\x17\x00\x0a\x00\x0b\x00\x0c\x00\x44\x00\x0e\x00\x05\x00\x49\x00\x0a\x00\x0a\x00\x5a\x00\x5b\x00\x5c\x00\x0e\x00\x01\x00\x0a\x00\x47\x00\x04\x00\x47\x00\x06\x00\x54\x00\x08\x00\x66\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x25\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x37\x00\x2c\x00\x43\x00\x29\x00\x2a\x00\x46\x00\x43\x00\x26\x00\x27\x00\x46\x00\x0f\x00\x4c\x00\x29\x00\x2a\x00\x43\x00\x44\x00\x54\x00\x46\x00\x55\x00\x48\x00\x57\x00\x43\x00\x43\x00\x49\x00\x46\x00\x46\x00\x1f\x00\x48\x00\x43\x00\x54\x00\x05\x00\x46\x00\x54\x00\x56\x00\x0e\x00\x67\x00\x43\x00\x44\x00\x0a\x00\x46\x00\x44\x00\x48\x00\x0e\x00\x4a\x00\x54\x00\x55\x00\x4d\x00\x29\x00\x2a\x00\x57\x00\x0a\x00\x0b\x00\x0c\x00\x29\x00\x0e\x00\x2b\x00\x54\x00\x55\x00\x57\x00\x5a\x00\x5b\x00\x5c\x00\x29\x00\x01\x00\x2b\x00\x29\x00\x04\x00\x2b\x00\x06\x00\x2c\x00\x08\x00\x66\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x25\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x57\x00\x29\x00\x43\x00\x2b\x00\x44\x00\x46\x00\x57\x00\x26\x00\x27\x00\x05\x00\x05\x00\x4b\x00\x49\x00\x23\x00\x43\x00\x57\x00\x05\x00\x46\x00\x57\x00\x48\x00\x47\x00\x54\x00\x2c\x00\x05\x00\x4b\x00\x05\x00\x30\x00\x31\x00\x32\x00\x08\x00\x09\x00\x0a\x00\x49\x00\x56\x00\x49\x00\x44\x00\x43\x00\x4b\x00\x44\x00\x46\x00\x3e\x00\x48\x00\x4b\x00\x4a\x00\x43\x00\x4b\x00\x4d\x00\x57\x00\x2c\x00\x2c\x00\x0a\x00\x0b\x00\x0c\x00\x54\x00\x0e\x00\x2c\x00\x4e\x00\x4f\x00\x4b\x00\x5a\x00\x5b\x00\x5c\x00\x2c\x00\x01\x00\x2c\x00\x2c\x00\x04\x00\x55\x00\x06\x00\x57\x00\x08\x00\x66\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x25\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x16\x00\x17\x00\x08\x00\x09\x00\x0a\x00\x44\x00\x47\x00\x26\x00\x27\x00\x08\x00\x09\x00\x0a\x00\x4b\x00\x23\x00\x43\x00\x24\x00\x23\x00\x46\x00\x48\x00\x48\x00\x08\x00\x09\x00\x0a\x00\x0a\x00\x4e\x00\x4f\x00\x50\x00\x31\x00\x32\x00\x10\x00\x31\x00\x32\x00\x00\x00\x08\x00\x09\x00\x0a\x00\x43\x00\x4b\x00\x2c\x00\x46\x00\x53\x00\x48\x00\x55\x00\x4a\x00\x57\x00\x2c\x00\x4d\x00\x45\x00\x10\x00\x47\x00\x45\x00\x46\x00\x47\x00\x54\x00\x4c\x00\x0a\x00\x2c\x00\x4c\x00\x1a\x00\x5a\x00\x5b\x00\x5c\x00\x24\x00\x01\x00\x49\x00\x55\x00\x04\x00\x57\x00\x06\x00\x2c\x00\x08\x00\x66\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x49\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x54\x00\x23\x00\x38\x00\x39\x00\x3a\x00\x48\x00\x23\x00\x26\x00\x27\x00\x48\x00\x2c\x00\x4e\x00\x4f\x00\x50\x00\x30\x00\x31\x00\x32\x00\x54\x00\x54\x00\x55\x00\x31\x00\x32\x00\x49\x00\x4a\x00\x4b\x00\x00\x00\x01\x00\x28\x00\x3e\x00\x04\x00\x54\x00\x2c\x00\x07\x00\x54\x00\x0a\x00\x0b\x00\x43\x00\x0c\x00\x00\x00\x46\x00\x45\x00\x48\x00\x47\x00\x4a\x00\x4e\x00\x4f\x00\x4d\x00\x4c\x00\x28\x00\x24\x00\x19\x00\x1a\x00\x2c\x00\x54\x00\x10\x00\x11\x00\x49\x00\x24\x00\x4b\x00\x5a\x00\x5b\x00\x5c\x00\x0a\x00\x01\x00\x1a\x00\x0a\x00\x04\x00\x54\x00\x06\x00\x54\x00\x08\x00\x66\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0a\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x28\x00\x23\x00\x54\x00\x0a\x00\x2c\x00\x0a\x00\x23\x00\x26\x00\x27\x00\x10\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x28\x00\x31\x00\x32\x00\x55\x00\x2c\x00\x57\x00\x3b\x00\x47\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x29\x00\x2a\x00\x44\x00\x43\x00\x43\x00\x00\x00\x46\x00\x45\x00\x48\x00\x47\x00\x4a\x00\x4e\x00\x4f\x00\x4d\x00\x4c\x00\x54\x00\x55\x00\x53\x00\x00\x00\x0a\x00\x54\x00\x10\x00\x11\x00\x59\x00\x0a\x00\x10\x00\x5a\x00\x5b\x00\x5c\x00\x49\x00\x01\x00\x1a\x00\x44\x00\x04\x00\x10\x00\x06\x00\x44\x00\x08\x00\x66\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x1a\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x0a\x00\x23\x00\x0a\x00\x0a\x00\x0a\x00\x0b\x00\x23\x00\x26\x00\x27\x00\x10\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x0a\x00\x31\x00\x32\x00\x5b\x00\x5c\x00\x5d\x00\x3b\x00\x0a\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x44\x00\x0a\x00\x44\x00\x43\x00\x44\x00\x24\x00\x46\x00\x45\x00\x48\x00\x47\x00\x4a\x00\x4e\x00\x4f\x00\x4d\x00\x4c\x00\x53\x00\x0a\x00\x53\x00\x0a\x00\x5b\x00\x5c\x00\x59\x00\x10\x00\x59\x00\x10\x00\x54\x00\x5a\x00\x5b\x00\x5c\x00\x58\x00\x01\x00\x5a\x00\x43\x00\x04\x00\x54\x00\x06\x00\x54\x00\x08\x00\x66\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x51\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x53\x00\x23\x00\x44\x00\x53\x00\x35\x00\x36\x00\x23\x00\x26\x00\x27\x00\x59\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x53\x00\x0a\x00\x24\x00\x31\x00\x32\x00\x49\x00\x59\x00\x10\x00\x3b\x00\x24\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x44\x00\x45\x00\x39\x00\x43\x00\x35\x00\x36\x00\x46\x00\x4b\x00\x48\x00\x47\x00\x4a\x00\x4e\x00\x4f\x00\x4d\x00\x4c\x00\x0a\x00\x54\x00\x55\x00\x54\x00\x0a\x00\x54\x00\x10\x00\x58\x00\x59\x00\x5a\x00\x10\x00\x5a\x00\x5b\x00\x5c\x00\x49\x00\x01\x00\x5b\x00\x5c\x00\x04\x00\x58\x00\x06\x00\x51\x00\x08\x00\x66\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x09\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x53\x00\x23\x00\x44\x00\x0a\x00\x35\x00\x36\x00\x59\x00\x26\x00\x27\x00\x10\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x0a\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x3b\x00\x44\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x04\x00\x4b\x00\x43\x00\x07\x00\x25\x00\x46\x00\x44\x00\x48\x00\x0c\x00\x4a\x00\x4e\x00\x4f\x00\x4d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x55\x00\x56\x00\x57\x00\x19\x00\x1a\x00\x53\x00\x39\x00\x5a\x00\x5b\x00\x5c\x00\x47\x00\x59\x00\x35\x00\x36\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x66\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x53\x00\x20\x00\x21\x00\x22\x00\x23\x00\x0a\x00\x25\x00\x26\x00\x49\x00\x28\x00\x29\x00\x10\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x43\x00\x5b\x00\x5c\x00\x46\x00\x49\x00\x48\x00\x44\x00\x04\x00\x54\x00\x55\x00\x07\x00\x57\x00\x43\x00\x44\x00\x51\x00\x0c\x00\x48\x00\x5d\x00\x4b\x00\x55\x00\x56\x00\x57\x00\x59\x00\x44\x00\x5b\x00\x5c\x00\x0a\x00\x4b\x00\x19\x00\x1a\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x66\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x12\x00\x13\x00\x25\x00\x26\x00\x44\x00\x28\x00\x29\x00\x44\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x55\x00\x56\x00\x57\x00\x4a\x00\x43\x00\x49\x00\x00\x00\x46\x00\x02\x00\x48\x00\x04\x00\x14\x00\x15\x00\x07\x00\x51\x00\x5b\x00\x5c\x00\x5d\x00\x0c\x00\x55\x00\x56\x00\x57\x00\x23\x00\x5e\x00\x51\x00\x60\x00\x61\x00\x62\x00\x5b\x00\x5c\x00\x65\x00\x19\x00\x1a\x00\x49\x00\x0a\x00\x53\x00\x31\x00\x32\x00\x0e\x00\x66\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x54\x00\x1e\x00\x28\x00\x45\x00\x46\x00\x47\x00\x0d\x00\x0e\x00\x25\x00\x26\x00\x4c\x00\x28\x00\x29\x00\x07\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x43\x00\x44\x00\x28\x00\x46\x00\x35\x00\x36\x00\x54\x00\x4a\x00\x49\x00\x4c\x00\x14\x00\x15\x00\x14\x00\x15\x00\x51\x00\x16\x00\x17\x00\x16\x00\x17\x00\x14\x00\x15\x00\x47\x00\x0a\x00\x0a\x00\x5b\x00\x5c\x00\x0e\x00\x0a\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x24\x00\x1e\x00\x16\x00\x17\x00\x0a\x00\x14\x00\x15\x00\x49\x00\x0e\x00\x26\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x24\x00\x1e\x00\x14\x00\x15\x00\x0d\x00\x0e\x00\x54\x00\x00\x00\x54\x00\x26\x00\x49\x00\x04\x00\x23\x00\x4b\x00\x07\x00\x43\x00\x23\x00\x54\x00\x46\x00\x0c\x00\x35\x00\x36\x00\x4a\x00\x44\x00\x4c\x00\x2c\x00\x31\x00\x32\x00\x44\x00\x30\x00\x31\x00\x32\x00\x19\x00\x1a\x00\x24\x00\x43\x00\x44\x00\x0a\x00\x43\x00\x5b\x00\x5c\x00\x46\x00\x24\x00\x3e\x00\x58\x00\x35\x00\x36\x00\x4c\x00\x47\x00\x48\x00\x5b\x00\x5c\x00\x24\x00\x4c\x00\x3b\x00\x3c\x00\x3b\x00\x3c\x00\x24\x00\x4e\x00\x4f\x00\x24\x00\x5b\x00\x5c\x00\x25\x00\x26\x00\x49\x00\x28\x00\x29\x00\x24\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x43\x00\x44\x00\x24\x00\x46\x00\x4b\x00\x5b\x00\x5c\x00\x4a\x00\x49\x00\x4c\x00\x20\x00\x21\x00\x22\x00\x23\x00\x51\x00\x25\x00\x26\x00\x47\x00\x28\x00\x29\x00\x44\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x16\x00\x17\x00\x35\x00\x36\x00\x14\x00\x15\x00\x44\x00\x51\x00\x2c\x00\x44\x00\x54\x00\x20\x00\x21\x00\x22\x00\x23\x00\x59\x00\x25\x00\x26\x00\x53\x00\x28\x00\x29\x00\x0a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x14\x00\x15\x00\x14\x00\x15\x00\x14\x00\x15\x00\x54\x00\x51\x00\x2c\x00\x24\x00\x54\x00\x20\x00\x21\x00\x22\x00\x23\x00\x59\x00\x25\x00\x26\x00\x54\x00\x28\x00\x29\x00\x54\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x24\x00\x44\x00\x1b\x00\x24\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x3b\x00\x3c\x00\x24\x00\x51\x00\x20\x00\x21\x00\x22\x00\x23\x00\x2c\x00\x25\x00\x26\x00\x59\x00\x28\x00\x29\x00\x53\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x14\x00\x15\x00\x3b\x00\x3c\x00\x14\x00\x15\x00\x49\x00\x51\x00\x2c\x00\x24\x00\x54\x00\x20\x00\x21\x00\x22\x00\x23\x00\x59\x00\x25\x00\x26\x00\x44\x00\x28\x00\x29\x00\x4b\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x24\x00\x18\x00\x1b\x00\x0f\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x0d\x00\x1c\x00\x61\x00\x51\x00\x20\x00\x21\x00\x22\x00\x23\x00\x2c\x00\x25\x00\x26\x00\x59\x00\x28\x00\x29\x00\x16\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x4d\x00\x1b\x00\x2c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x5f\x00\x5e\x00\x2c\x00\x51\x00\x20\x00\x21\x00\x22\x00\x23\x00\x2c\x00\x25\x00\x26\x00\x59\x00\x28\x00\x29\x00\x1c\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x31\x00\x4d\x00\x1b\x00\x60\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x0f\x00\x60\x00\x60\x00\x51\x00\x20\x00\x21\x00\x22\x00\x23\x00\x2c\x00\x25\x00\x26\x00\x59\x00\x28\x00\x29\x00\x60\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x60\x00\x60\x00\x1b\x00\x31\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xff\xff\xff\xff\xff\xff\x51\x00\x20\x00\x21\x00\x22\x00\x23\x00\x2c\x00\x25\x00\x26\x00\x59\x00\x28\x00\x29\x00\xff\xff\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\xff\xff\xff\xff\x16\x00\xff\xff\xff\xff\xff\xff\x00\x00\xff\xff\x02\x00\x03\x00\x04\x00\xff\xff\xff\xff\x07\x00\x51\x00\x23\x00\xff\xff\xff\xff\x0c\x00\xff\xff\xff\xff\xff\xff\x59\x00\xff\xff\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x19\x00\x1a\x00\x35\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\xff\xff\x1b\x00\xff\xff\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xff\xff\x4e\x00\x4f\x00\x25\x00\x26\x00\xff\xff\x28\x00\x29\x00\x2c\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x23\x00\xff\xff\x1e\x00\x1f\x00\x20\x00\xff\xff\x22\x00\x23\x00\x24\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x2c\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x59\x00\xff\xff\x3b\x00\x23\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\xff\xff\xff\xff\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\x4e\x00\x4f\x00\x50\x00\x51\x00\x52\x00\xff\xff\x3b\x00\x23\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\xff\xff\xff\xff\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\x4e\x00\x4f\x00\x50\x00\x51\x00\x52\x00\xff\xff\x3b\x00\x23\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\xff\xff\xff\xff\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\x4e\x00\x4f\x00\x50\x00\x51\x00\x52\x00\xff\xff\x3b\x00\x23\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\xff\xff\xff\xff\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\x4e\x00\x4f\x00\x50\x00\x51\x00\x52\x00\xff\xff\x3b\x00\x23\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\xff\xff\xff\xff\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\x4e\x00\x4f\x00\x50\x00\x51\x00\x52\x00\xff\xff\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\xff\xff\x1b\x00\xff\xff\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xff\xff\x4e\x00\x4f\x00\x50\x00\xff\xff\x52\x00\x25\x00\x26\x00\x2c\x00\x28\x00\x29\x00\xff\xff\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x25\x00\x26\x00\xff\xff\x28\x00\x29\x00\x51\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x25\x00\x26\x00\xff\xff\x28\x00\x29\x00\x51\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x25\x00\x26\x00\xff\xff\x28\x00\x29\x00\x51\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x00\x00\xff\xff\x02\x00\x03\x00\x04\x00\xff\xff\x23\x00\x07\x00\xff\xff\xff\xff\xff\xff\xff\xff\x0c\x00\xff\xff\x51\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\x19\x00\x1a\x00\xff\xff\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\x23\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x2c\x00\xff\xff\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\x4e\x00\x4f\x00\xff\xff\xff\xff\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\xff\xff\x1b\x00\xff\xff\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xff\xff\x4e\x00\x4f\x00\x25\x00\x26\x00\xff\xff\x28\x00\x29\x00\x2c\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x25\x00\x26\x00\xff\xff\x28\x00\x29\x00\xff\xff\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\xff\xff\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x25\x00\x26\x00\xff\xff\x28\x00\x29\x00\xff\xff\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\xff\xff\xff\xff\x3e\x00\x3f\x00\x40\x00\xff\xff\x42\x00\x25\x00\x26\x00\xff\xff\x28\x00\x29\x00\xff\xff\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\xff\xff\xff\xff\x3e\x00\x3f\x00\x40\x00\x25\x00\x26\x00\xff\xff\xff\xff\x29\x00\xff\xff\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x39\x00\x3a\x00\x3b\x00\xff\xff\xff\xff\x3e\x00\x3f\x00\x40\x00\x00\x00\xff\xff\x02\x00\x03\x00\x04\x00\xff\xff\x00\x00\x07\x00\x02\x00\x03\x00\x04\x00\xff\xff\x0c\x00\x07\x00\xff\xff\xff\xff\xff\xff\x00\x00\x0c\x00\x02\x00\x03\x00\x04\x00\xff\xff\xff\xff\x07\x00\x19\x00\x1a\x00\xff\xff\xff\xff\x0c\x00\xff\xff\x19\x00\x1a\x00\x00\x00\xff\xff\x02\x00\xff\xff\x04\x00\xff\xff\xff\xff\x07\x00\xff\xff\x19\x00\x1a\x00\xff\xff\x0c\x00\xff\xff\x04\x00\xff\xff\xff\xff\x07\x00\xff\xff\xff\xff\x25\x00\x26\x00\x0c\x00\xff\xff\xff\xff\x19\x00\x1a\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\x19\x00\x1a\x00\xff\xff\x25\x00\x26\x00\x39\x00\x3a\x00\x3b\x00\xff\xff\xff\xff\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x1b\x00\x39\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xff\xff\xff\xff\xff\xff\x27\x00\xff\xff\xff\xff\xff\xff\x1b\x00\x2c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xff\xff\xff\xff\xff\xff\x27\x00\xff\xff\xff\xff\xff\xff\x1b\x00\x2c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x1b\x00\x2c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x1b\x00\x2c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x1b\x00\x2c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x1b\x00\x2c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x1b\x00\x2c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x1b\x00\x2c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x1b\x00\x2c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x1b\x00\x2c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x1b\x00\x2c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x1e\x00\x1f\x00\x20\x00\xff\xff\x22\x00\x23\x00\xff\xff\xff\xff\x2c\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x2c\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\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\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 :: HappyAddr
happyTable = Addr# -> HappyAddr
HappyA# Addr#
"\x00\x00\x04\x01\x32\x00\xff\x00\x6f\x01\x33\x00\x60\x01\x34\x00\x07\x00\x35\x00\x0c\x02\x1c\x00\x36\x00\x37\x00\x38\x00\x39\x00\x9c\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x9d\x00\x0b\x01\xc5\x00\x2c\x01\xc6\x00\x1a\x00\x9e\x00\x9f\x00\x4a\x00\xa0\x00\xa1\x00\x0d\x02\xa2\x00\xa3\x00\xa4\x00\xa5\x00\xa6\x00\xa7\x00\xa8\x00\xa9\x00\xaa\x00\xab\x00\xac\x00\xad\x00\xae\x00\xaf\x00\xb0\x00\xb1\x00\xb2\x00\xb3\x00\xb4\x00\xb5\x00\xb6\x00\xb7\x00\xb8\x00\xb9\x00\x4b\x00\xba\x00\x1c\x00\x4c\x00\x5e\x01\x4d\x00\x2d\x01\x4e\x00\x5c\x02\xd1\x01\x4f\x00\xf7\x00\xf8\x00\x1c\x00\xbb\x00\x9c\x00\x0f\x00\x10\x00\xff\xff\x05\x01\xf7\x00\xf8\x00\x0c\x01\x50\x00\x51\x00\x52\x00\x6a\x01\x32\x00\xc8\x00\xc9\x00\x33\x00\xd2\x00\x34\x00\x09\x01\x35\x00\x53\x00\x1c\x00\x36\x00\x37\x00\x38\x00\x39\x00\x44\x02\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\xd2\x01\xfe\x00\x1d\x00\x1a\x02\x11\x01\x1e\x00\x0d\x01\x49\x00\x4a\x00\x79\x01\x9a\x02\x31\x02\x1f\x00\x0f\x02\xf9\x00\x33\x00\x60\x02\x92\x00\x61\x02\xd7\x01\x6b\x01\x12\x01\x45\x02\x0e\x01\x0f\x00\x10\x00\x6c\x01\xb4\x01\x9c\x00\x11\x00\x20\x00\xca\x00\xf7\x00\xf8\x00\xfb\x00\x1a\x00\x4b\x00\x12\x00\xcb\x00\x4c\x00\xc6\x00\x4d\x00\x2d\x01\x4e\x00\xd2\x00\x95\x00\x4f\x00\x15\x01\xa8\x01\x1c\x00\x13\x00\x14\x00\x15\x00\xc3\x00\x16\x00\x17\x00\x07\x00\x85\x00\x9b\x02\x50\x00\x51\x00\x52\x00\xff\xff\x32\x00\xcd\x00\x36\x00\x33\x00\x85\x00\x34\x00\x85\x00\x35\x00\x53\x00\x1c\x00\x36\x00\x37\x00\x38\x00\x39\x00\x29\x02\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x8d\x00\x11\x00\xf7\x00\xf8\x00\x48\x02\x54\x02\x8e\x00\x49\x00\x4a\x00\x12\x00\xf7\x00\xf8\x00\x82\x00\x1d\x00\x62\x02\x63\x02\x1e\x00\xa9\x01\xb5\x01\xc6\x00\x07\x01\x08\x01\x13\x00\x14\x00\x15\x00\xb6\x01\x16\x00\x17\x00\x88\x00\xff\xff\x85\x00\x89\x00\x81\x00\xce\x00\x73\x00\xc8\x00\x4b\x00\x8a\x00\x87\x00\x4c\x00\x74\x00\x4d\x00\x92\x00\x4e\x00\x2d\x01\x6c\x00\x4f\x00\x6f\x00\x70\x00\xfb\x01\x77\x00\x5d\x00\x5e\x00\x9c\x00\x39\x00\x15\x01\x16\x01\x87\x00\xd6\x01\x50\x00\x51\x00\x52\x00\x10\x01\x32\x00\x6f\x00\xc3\x01\x33\x00\x10\x01\x34\x00\xd2\x00\x35\x00\x53\x00\x1c\x00\x36\x00\x37\x00\x38\x00\x39\x00\x5f\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\xbb\x01\x71\x00\x88\x00\x3a\x01\x73\x00\x89\x00\x52\x02\x49\x00\x4a\x00\xc8\x00\x74\x00\x8a\x00\xff\xff\x88\x00\x60\x00\x78\x00\x89\x00\x61\x00\x71\x00\x62\x00\xc8\x00\x88\x00\x8a\x00\xbc\x01\x89\x00\x21\x01\x14\x01\xc6\x00\xc8\x00\x89\x00\x8a\x00\x11\x01\xb9\x01\x63\x00\x89\x00\x8a\x00\x4b\x00\x9d\x01\x87\x00\x4c\x00\x8a\x00\x4d\x00\x1c\x00\x4e\x00\xaf\x01\x2d\x01\x4f\x00\x5a\x00\x15\x01\x16\x01\x1c\x00\x5d\x00\x5e\x00\x31\x01\x39\x00\x4d\x02\xba\x01\x1c\x02\x1c\x00\x50\x00\x51\x00\x52\x00\x39\x00\x32\x00\x1c\x00\x75\x00\x33\x00\xb8\x01\x34\x00\x01\x01\x35\x00\x53\x00\x1c\x00\x36\x00\x37\x00\x38\x00\x39\x00\x5f\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x37\x01\x2d\x01\x88\x00\x83\x00\x84\x00\x89\x00\x2f\x01\x49\x00\x4a\x00\x30\x01\x9c\x00\x8a\x00\x83\x00\xac\x01\x60\x00\x78\x00\x01\x01\x61\x00\x17\x01\x62\x00\xc6\x00\x2f\x01\x7a\x00\xb3\x01\x30\x01\x61\x00\xd2\x00\x7f\x00\x2f\x01\x38\x01\x46\x02\x30\x01\xb7\x01\x63\x00\x39\x00\xff\xff\x4b\x00\x78\x01\x1c\x00\x4c\x00\x76\x01\x4d\x00\x39\x00\x4e\x00\xf7\x00\xf8\x00\x4f\x00\x83\x00\x02\x02\x85\x00\x1c\x00\x5d\x00\x5e\x00\x24\x02\x39\x00\x2f\x02\xf7\x00\xf8\x00\x85\x00\x50\x00\x51\x00\x52\x00\x24\x02\x32\x00\x28\x02\x24\x02\x33\x00\x25\x02\x34\x00\x2d\x01\x35\x00\x53\x00\x1c\x00\x36\x00\x37\x00\x38\x00\x39\x00\x5f\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x85\x00\x24\x02\x7a\x00\x3e\x02\xcc\x01\x61\x00\x85\x00\x49\x00\x4a\x00\x42\x02\x41\x02\x33\x02\xb2\x01\x20\x00\x60\x00\x85\x00\xae\x02\x61\x00\x85\x00\x62\x00\x28\xff\xac\x01\x21\x00\xc9\x02\x28\xff\xe2\x02\xd3\x00\x26\x00\x27\x00\x17\x00\x18\x00\x19\x00\xa4\x01\x63\x00\xa2\x01\xcc\x01\x4b\x00\xa1\x01\xcc\x01\x4c\x00\x2a\x00\x4d\x00\x2b\x02\x4e\x00\xa3\x01\xcd\x01\x4f\x00\x85\x00\x2d\x01\x2d\x01\x1c\x00\x5d\x00\x5e\x00\x72\x01\x39\x00\x2d\x01\x2f\x00\x30\x00\xa0\x01\x50\x00\x51\x00\x52\x00\x2d\x01\x32\x00\x2d\x01\x1a\x00\x33\x00\x64\x01\x34\x00\xc6\x00\x35\x00\x53\x00\x1c\x00\x36\x00\x37\x00\x38\x00\x39\x00\x5f\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x15\x01\x6f\x02\x02\x01\x18\x00\x19\x00\x97\x02\x9f\x01\x49\x00\x4a\x00\xfc\x00\x18\x00\x19\x00\x98\x02\xe8\x01\x7a\x00\x9e\x01\xe8\x01\x61\x00\x1e\x01\x62\x00\x53\x02\x18\x00\x19\x00\x8d\x00\x1f\x01\x20\x01\x21\x01\x26\x00\xe9\x01\x8e\x00\x26\x00\xe9\x01\x11\x02\xb0\x02\x18\x00\x19\x00\x4b\x00\x74\x01\x1a\x00\x4c\x00\xf8\x01\x4d\x00\xf9\x01\x4e\x00\xc6\x00\x1a\x00\x4f\x00\x70\x02\x51\x02\xeb\x01\xd4\x02\xd5\x02\xeb\x01\xc3\x00\xec\x01\x1c\x00\x1a\x00\xec\x01\x14\x02\x50\x00\x51\x00\x52\x00\xaf\xfe\x32\x00\x73\x01\x85\x02\x33\x00\xc6\x00\x34\x00\x1a\x00\x35\x00\x53\x00\x1c\x00\x36\x00\x37\x00\x38\x00\x39\x00\x70\x01\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x68\x01\x20\x00\x92\x00\x93\x00\x94\x00\x1e\x01\xe8\x01\x49\x00\x4a\x00\xce\x00\x21\x00\x1f\x01\x20\x01\x21\x01\x82\x00\x26\x00\x27\x00\xaf\xfe\xf7\x00\xf8\x00\x26\x00\xe9\x01\x6b\x02\x6c\x02\x6d\x02\x63\x00\x64\x00\x7b\x00\x2a\x00\x65\x00\x95\x00\x6d\x00\x0a\x00\x6e\x02\x28\x01\x29\x01\x4b\x00\x0b\x00\x11\x02\x4c\x00\xea\x01\x4d\x00\xeb\x01\x4e\x00\x2f\x00\x30\x00\x4f\x00\xec\x01\x7a\x00\x64\x01\x0c\x00\x0d\x00\x6d\x00\xe5\x01\x12\x02\x13\x02\x6b\x02\x63\x01\xd1\x02\x50\x00\x51\x00\x52\x00\x61\x01\x32\x00\x14\x02\x5e\x01\x33\x00\x6e\x02\x34\x00\x35\x01\x35\x00\x53\x00\x1c\x00\x36\x00\x37\x00\x38\x00\x39\x00\x1c\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x6c\x00\x20\x00\x01\x01\x97\x00\x6d\x00\x33\x01\xe8\x01\x49\x00\x4a\x00\x74\x00\x21\x00\x8e\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x8f\x00\x90\x00\xb0\x01\x26\x00\xe9\x01\x65\x02\x6d\x00\xc6\x00\x28\x00\x32\x01\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x07\x01\x08\x01\x49\x02\x4b\x00\xfb\x00\x11\x02\x4c\x00\xd3\x02\x4d\x00\xeb\x01\x4e\x00\x2f\x00\x30\x00\x4f\x00\xec\x01\xf7\x00\xf8\x00\x1d\x02\x11\x02\x8d\x00\xc3\x00\x12\x02\x50\x02\x1e\x02\x2a\x01\x8e\x00\x50\x00\x51\x00\x52\x00\x25\x01\x32\x00\x14\x02\x34\x02\x33\x00\xcc\x02\x34\x00\x27\x02\x35\x00\x53\x00\x1c\x00\x36\x00\x37\x00\x38\x00\x39\x00\x14\x02\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x2f\x02\x20\x00\x2e\x02\x1c\x00\xaa\x02\xab\x02\xe8\x01\x49\x00\x4a\x00\x6f\x00\x21\x00\x8e\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\xda\x01\x90\x00\x2d\x02\x26\x00\xe9\x01\x8a\x00\xd3\x01\xd4\x01\x28\x00\x2c\x02\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\xa8\x02\x23\x02\xa7\x02\x4b\x00\xdf\x01\x22\x02\x4c\x00\xd0\x02\x4d\x00\xeb\x01\x4e\x00\x2f\x00\x30\x00\x4f\x00\xec\x01\x1d\x02\x73\x00\x1d\x02\x8d\x00\x8a\x00\x0c\x01\x1e\x02\x74\x00\x1e\x02\x8e\x00\xa4\x01\x50\x00\x51\x00\x52\x00\xa5\x01\x32\x00\x86\x02\xfb\x00\x33\x00\x20\x02\x34\x00\x11\x02\x35\x00\x53\x00\x1c\x00\x36\x00\x37\x00\x38\x00\x39\x00\x09\x02\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x10\x02\x20\x00\xc7\x02\x1d\x02\xcf\x00\xfd\x00\x78\x02\x49\x00\x4a\x00\x1e\x02\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x1d\x02\x97\x00\x0c\x02\x26\x00\xe9\x01\x04\x02\x1e\x02\x74\x00\x28\x00\x00\x02\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x99\x01\x9a\x01\xeb\x00\x4b\x00\xcf\x00\xd0\x00\x4c\x00\x9b\x01\x4d\x00\x93\x02\x4e\x00\x2f\x00\x30\x00\x4f\x00\xec\x01\x73\x00\xf7\x00\xf8\x00\xa4\x01\x8d\x00\xc3\x00\x74\x00\xa5\x01\xa6\x01\xa7\x01\x8e\x00\x50\x00\x51\x00\x52\x00\xff\x01\x32\x00\x8a\x00\x8b\x00\x33\x00\xfd\x01\x34\x00\xe3\x01\x35\x00\x53\x00\x1c\x00\x36\x00\x37\x00\x38\x00\x39\x00\x6f\x01\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x1d\x02\x20\x00\xe1\x01\x8d\x00\xcf\x00\xfd\x00\x1e\x02\x49\x00\x4a\x00\x8e\x00\x21\x00\xce\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x1c\x00\x78\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x28\x00\xe0\x01\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x5b\x00\x14\x01\xd0\x01\x4b\x00\x0a\x00\xd9\x00\x4c\x00\xce\x01\x4d\x00\x0b\x00\x4e\x00\x2f\x00\x30\x00\x4f\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\x34\x02\x87\x02\xc6\x00\x0c\x00\x0d\x00\x1d\x02\xeb\x00\x50\x00\x51\x00\x52\x00\xcf\x01\x1e\x02\xcf\x00\x79\x01\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x53\x00\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\xcb\x01\x52\xff\x52\xff\x52\xff\x52\xff\x73\x00\x52\xff\x52\xff\xc9\x01\x52\xff\x52\xff\x74\x00\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x52\xff\x8a\x00\x66\x01\x52\xff\xc2\x01\x52\xff\x8b\x02\xbd\x01\xf7\x00\xf8\x00\x0a\x00\x6b\x01\x6c\x01\x6d\x01\x52\xff\x0b\x00\x6c\x00\x6c\x01\x8c\x02\x34\x02\x3a\x02\xc6\x00\x52\xff\x8a\x02\x52\xff\x52\xff\x4b\x02\x84\x02\x0c\x00\x0d\x00\x1c\x00\x36\x00\x37\x00\x38\x00\x39\x00\x52\xff\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\xc8\x00\x65\x01\x9e\x00\x19\x01\x83\x02\xa0\x00\xa1\x00\x82\x02\xa2\x00\xa3\x00\xa4\x00\xa5\x00\xa6\x00\xa7\x00\xa8\x00\xa9\x00\xaa\x00\xab\x00\xac\x00\xad\x00\xae\x00\xaf\x00\xb0\x00\xb1\x00\xb2\x00\xb3\x00\xb4\x00\xb5\x00\xb6\x00\xb7\x00\xb8\x00\xb9\x00\x34\x02\x35\x02\xc6\x00\x16\x02\x4b\x00\x81\x02\x07\x00\x4c\x00\x08\x00\x4d\x00\x09\x00\x1b\x01\x61\x01\x0a\x00\xbb\x00\x8a\x00\xd3\x01\x90\x02\x0b\x00\x34\x02\xbc\x02\xc6\x00\xe8\x01\x17\x02\x80\x02\x18\x02\x19\x02\x1a\x02\x51\x00\x52\x00\x07\x00\x0c\x00\x0d\x00\x7f\x02\xee\x01\x78\x02\x26\x00\xe9\x01\x39\x00\x53\x00\xef\x01\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\xf0\x01\x44\x00\x45\x00\x46\x00\x77\x02\xf1\x01\x6a\x02\xd4\x02\xe4\x02\xeb\x01\x2a\x01\x2b\x01\x9e\x00\x72\x02\xec\x01\xa0\x00\xa1\x00\x69\x02\xa2\x00\xa3\x00\xa4\x00\xa5\x00\xa6\x00\xa7\x00\xa8\x00\xa9\x00\xaa\x00\xab\x00\xac\x00\xad\x00\xae\x00\xaf\x00\xb0\x00\xb1\x00\xb2\x00\xb3\x00\xb4\x00\xb5\x00\xb6\x00\xb7\x00\xb8\x00\xb9\x00\xf3\x01\x73\x02\xb7\xfe\xf4\x01\xcf\x00\x5e\x01\x38\x02\xf5\x01\x57\x02\xf6\x01\x1b\x01\x26\x01\x1b\x01\x23\x01\xbb\x00\x15\x01\x25\x01\x15\x01\x22\x01\x1b\x01\x1c\x01\x50\x02\xee\x01\x4c\x02\x51\x00\x52\x00\x39\x00\x1c\x00\xef\x01\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\xf0\x01\x44\x00\x45\x00\x46\x00\x44\x02\xf1\x01\x15\x01\x1a\x01\xee\x01\x1b\x01\x30\x02\x41\x02\x39\x00\xf2\x01\xef\x01\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\xf0\x01\x44\x00\x45\x00\x46\x00\x40\x02\xf1\x01\x1b\x01\x23\x02\x2a\x01\x20\x02\x38\x02\x68\x00\x38\x02\xf2\x01\x3a\x02\x69\x00\x78\x02\xbc\x02\x0a\x00\xf3\x01\x20\x00\xac\x02\xf4\x01\x0b\x00\xcf\x00\x0a\x02\xf5\x01\xbb\x02\xf6\x01\x21\x00\x26\x00\xe9\x01\xb7\x02\xad\x01\x26\x00\x27\x00\x0c\x00\x0d\x00\xba\x02\xf6\x01\x6d\x01\x87\x00\xf3\x01\x51\x00\x52\x00\xf4\x01\xb8\x02\x2a\x00\xa1\x02\xcf\x00\xdc\x01\xf6\x01\x79\x02\x7a\x02\x8a\x00\x6a\x02\xb6\x02\xec\x01\x5d\x02\x63\x02\x5d\x02\x5e\x02\xb5\x02\x2f\x00\x30\x00\xb4\x02\x51\x00\x52\x00\x9e\x00\x19\x01\xa9\x02\xa0\x00\xa1\x00\xa6\x02\xa2\x00\xa3\x00\xa4\x00\xa5\x00\xa6\x00\xa7\x00\xa8\x00\xa9\x00\xaa\x00\xab\x00\xac\x00\xad\x00\xae\x00\xaf\x00\xb0\x00\xb1\x00\xb2\x00\xb3\x00\xb4\x00\xb5\x00\xb6\x00\xb7\x00\xb8\x00\xb9\x00\x88\x00\x1a\x01\xa4\x02\x89\x00\x9d\x02\x8a\x00\x4e\x02\xc8\x00\x9e\x02\x8a\x00\xd5\x00\xd6\x00\xd7\x00\xd8\x00\xbb\x00\xd9\x00\xda\x00\x9c\x02\xdb\x00\xdc\x00\x99\x02\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\xee\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\xc9\x01\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x15\x01\x49\x02\xcf\x00\xfd\x00\x1b\x01\xb1\x02\x92\x02\xf5\x00\x5b\x00\x90\x02\x75\x01\xd5\x00\xd6\x00\xd7\x00\xd8\x00\xf6\x00\xd9\x00\xda\x00\x8f\x02\xdb\x00\xdc\x00\xcb\x02\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\xee\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\xc2\x01\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x1b\x01\xaf\x02\x1b\x01\xad\x02\x1b\x01\xac\x02\xc9\x02\xf5\x00\x5b\x00\xc6\x02\xe8\x01\xd5\x00\xd6\x00\xd7\x00\xd8\x00\xf6\x00\xd9\x00\xda\x00\xc8\x02\xdb\x00\xdc\x00\x01\x01\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\xee\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\xc5\x02\xda\x01\x53\x00\xc1\x02\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x5d\x02\xa1\x02\xbe\x02\xf5\x00\xd5\x00\xd6\x00\xd7\x00\xd8\x00\x5b\x00\xd9\x00\xda\x00\xf6\x00\xdb\x00\xdc\x00\xde\x02\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\xee\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\xde\x02\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x1b\x01\xcb\x02\x5d\x02\xd9\x02\x1b\x01\xe3\x02\xdb\x02\xf5\x00\x5b\x00\x40\x02\x7e\x02\xd5\x00\xd6\x00\xd7\x00\xd8\x00\xf6\x00\xd9\x00\xda\x00\xd8\x02\xdb\x00\xdc\x00\xd9\x02\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\xee\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\xc5\x02\x09\x01\x75\x00\x05\x01\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\xf9\x00\x6a\x00\xaa\x01\xf5\x00\xd5\x00\xd6\x00\xd7\x00\xd8\x00\x5b\x00\x7c\x01\x7d\x01\xf6\x00\x7e\x01\x7f\x01\x7a\x01\x80\x01\x81\x01\x82\x01\x83\x01\x84\x01\x85\x01\x86\x01\x87\x01\x88\x01\x89\x01\x8a\x01\x8b\x01\x8c\x01\x8d\x01\x8e\x01\x8f\x01\x90\x01\x91\x01\x92\x01\x93\x01\x94\x01\x95\x01\x96\x01\x97\x01\x76\x01\x68\x01\xae\x01\x3a\x01\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x33\x01\x1e\x02\xdd\x01\x98\x01\xd5\x00\xd6\x00\xd7\x00\xd8\x00\x5b\x00\xd9\x00\xda\x00\xf6\x00\xdb\x00\xdc\x00\x8c\x02\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\xee\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\x73\x02\x67\x02\x36\x01\x5c\x02\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x4c\x02\x3d\x02\x3c\x02\xf5\x00\xd5\x00\x06\x02\x07\x02\x08\x02\x5b\x00\xd9\x00\xda\x00\xf6\x00\xdb\x00\xdc\x00\x3b\x02\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\xee\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\x38\x02\x36\x02\x35\x01\x73\x02\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x00\x00\x00\x00\x00\x00\xf5\x00\xd5\x00\xd6\x00\xd7\x00\xd8\x00\x5b\x00\xd9\x00\xda\x00\xf6\x00\xdb\x00\xdc\x00\x00\x00\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\xee\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\x00\x00\x00\x00\x97\x00\x00\x00\x00\x00\x00\x00\x07\x00\x00\x00\x66\x00\xfb\x00\x09\x00\x00\x00\x00\x00\x0a\x00\xf5\x00\x20\x00\x00\x00\x00\x00\x0b\x00\x00\x00\x00\x00\x00\x00\xf6\x00\x00\x00\x21\x00\x98\x00\x99\x00\x24\x00\x25\x00\x26\x00\x27\x00\x0c\x00\x0d\x00\x9a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x00\x00\xfd\x01\x00\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x00\x00\x2f\x00\x30\x00\xd9\x00\xda\x00\x00\x00\xdb\x00\xdc\x00\x5b\x00\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\xee\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\x20\x00\x00\x00\x55\x00\x56\x00\x57\x00\x00\x00\x7c\x00\x5a\x00\x7d\x00\x21\x00\x00\x00\xbe\x00\x24\x00\x25\x00\x26\x00\x27\x00\x5b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xf6\x00\x00\x00\x28\x00\x20\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x00\x00\x00\x00\x21\x00\x00\x00\xbe\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x2f\x00\x30\x00\xbf\x00\xc3\x00\xc1\x00\x00\x00\x28\x00\x20\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x00\x00\x00\x00\x21\x00\x00\x00\xbe\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x2f\x00\x30\x00\xbf\x00\xc0\x00\xc1\x00\x00\x00\x28\x00\x20\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x00\x00\x00\x00\x21\x00\x00\x00\xbe\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x2f\x00\x30\x00\xbf\x00\x09\x02\xc1\x00\x00\x00\x28\x00\x20\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x00\x00\x00\x00\x21\x00\x00\x00\xbe\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x2f\x00\x30\x00\xbf\x00\xe1\x01\xc1\x00\x00\x00\x28\x00\x20\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x00\x00\x00\x00\x21\x00\x00\x00\xbe\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x2f\x00\x30\x00\xbf\x00\xdb\x01\xc1\x00\x00\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x00\x00\xc7\x01\x00\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x00\x00\x2f\x00\x30\x00\xbf\x00\x00\x00\xe5\x01\x9e\x00\x19\x01\x5b\x00\xa0\x00\xa1\x00\x00\x00\xa2\x00\xa3\x00\xa4\x00\xa5\x00\xa6\x00\xa7\x00\xa8\x00\xa9\x00\xaa\x00\xab\x00\xac\x00\xad\x00\xae\x00\xaf\x00\xb0\x00\xb1\x00\xb2\x00\xb3\x00\xb4\x00\xb5\x00\xb6\x00\xb7\x00\xb8\x00\xb9\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xaf\xfe\xaf\xfe\x00\x00\xaf\xfe\xaf\xfe\xbb\x00\xaf\xfe\xaf\xfe\xaf\xfe\xaf\xfe\xaf\xfe\xaf\xfe\xaf\xfe\xaf\xfe\xaf\xfe\xaf\xfe\xaf\xfe\xaf\xfe\xaf\xfe\xaf\xfe\xaf\xfe\xaf\xfe\xaf\xfe\xaf\xfe\xaf\xfe\xaf\xfe\xaf\xfe\xaf\xfe\xaf\xfe\xaf\xfe\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x9e\x00\x19\x01\x00\x00\xa0\x00\xa1\x00\xaf\xfe\xa2\x00\xa3\x00\xa4\x00\xa5\x00\xa6\x00\xa7\x00\xa8\x00\xa9\x00\xaa\x00\xab\x00\xac\x00\xad\x00\xae\x00\xaf\x00\xb0\x00\xb1\x00\xb2\x00\xb3\x00\xb4\x00\xb5\x00\xb6\x00\xb7\x00\xb8\x00\xb9\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xae\xfe\xae\xfe\x00\x00\xae\xfe\xae\xfe\xbb\x00\xae\xfe\xae\xfe\xae\xfe\xae\xfe\xae\xfe\xae\xfe\xae\xfe\xae\xfe\xae\xfe\xae\xfe\xae\xfe\xae\xfe\xae\xfe\xae\xfe\xae\xfe\xae\xfe\xae\xfe\xae\xfe\xae\xfe\xae\xfe\xae\xfe\xae\xfe\xae\xfe\xae\xfe\x07\x00\x00\x00\x66\x00\x67\x00\x09\x00\x00\x00\x20\x00\x0a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0b\x00\x00\x00\xae\xfe\x21\x00\xc4\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x0c\x00\x0d\x00\x00\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\xbd\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x04\x02\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x01\x02\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x02\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\xfb\x01\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\xf7\x01\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\xd8\x01\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\xd6\x01\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\xd2\x01\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x88\x02\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x66\x02\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x64\x02\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\xa4\x02\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\xa2\x02\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x9f\x02\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x9e\x02\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x94\x02\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\xcf\x02\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\xce\x02\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\xc3\x02\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\xc2\x02\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\xc1\x02\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\xbf\x02\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\xbe\x02\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\xe1\x02\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\xe0\x02\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\xbc\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\xbb\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x9b\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\xbc\x00\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x70\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x5c\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x5a\x01\x24\x00\x5b\x01\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x59\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x58\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x57\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x56\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x55\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x54\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x53\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x52\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x51\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x50\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x4f\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x4e\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x4d\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x4c\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x4b\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x4a\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x49\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x48\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x47\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x46\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x45\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x44\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x43\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x42\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x41\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x40\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x3f\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x3e\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x3d\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x3c\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x3b\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\xe6\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\xe3\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x56\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x55\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x54\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x53\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x52\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x51\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x50\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x4f\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x4e\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x4d\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x4c\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x4b\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x4a\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x49\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x48\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x47\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x46\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x45\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x44\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x43\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x42\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x41\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x40\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x3f\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x3e\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x3d\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x3c\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x3b\x01\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x7c\x02\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x7b\x02\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x5a\x02\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x59\x02\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x58\x02\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x57\x02\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x55\x02\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x92\x02\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\x57\x02\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x20\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x21\x00\x00\x00\xcd\x02\x24\x00\x25\x00\x26\x00\x27\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x30\x00\x00\x00\x00\x00\x28\x00\x00\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x00\x00\xc4\x01\x00\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x00\x00\x2f\x00\x30\x00\xd9\x00\xda\x00\x00\x00\xdb\x00\xdc\x00\x5b\x00\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\xee\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\xd9\x00\xda\x00\x00\x00\xdb\x00\xdc\x00\x00\x00\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\x00\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\xd9\x00\xda\x00\x00\x00\xdb\x00\xdc\x00\x00\x00\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\x00\x00\x00\x00\xf0\x00\xf1\x00\xf2\x00\x00\x00\xf4\x00\xd9\x00\xda\x00\x00\x00\xdb\x00\xdc\x00\x00\x00\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\x00\x00\x00\x00\xf0\x00\xf1\x00\xf2\x00\xd9\x00\xda\x00\x00\x00\x00\x00\xdc\x00\x00\x00\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xeb\x00\xec\x00\xed\x00\x00\x00\x00\x00\xf0\x00\xf1\x00\xf2\x00\x07\x00\x00\x00\x66\x00\xbe\x01\x09\x00\x00\x00\x07\x00\x0a\x00\x66\x00\xbc\x01\x09\x00\x00\x00\x0b\x00\x0a\x00\x00\x00\x00\x00\x00\x00\x07\x00\x0b\x00\x66\x00\xbf\x01\x09\x00\x00\x00\x00\x00\x0a\x00\x0c\x00\x0d\x00\x00\x00\x00\x00\x0b\x00\x00\x00\x0c\x00\x0d\x00\x07\x00\x00\x00\x01\x01\x00\x00\x09\x00\x00\x00\x00\x00\x0a\x00\x00\x00\x0c\x00\x0d\x00\x00\x00\x0b\x00\x00\x00\x27\x02\x00\x00\x00\x00\x0a\x00\x00\x00\x00\x00\xd9\x00\xda\x00\x0b\x00\x00\x00\x00\x00\x0c\x00\x0d\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\x00\x00\x0c\x00\x0d\x00\x00\x00\xd9\x00\xda\x00\xeb\x00\xec\x00\xed\x00\x00\x00\x00\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc5\x01\xeb\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x00\x00\x00\x00\x00\x00\xc6\x01\x00\x00\x00\x00\x00\x00\xc5\x01\x5b\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x00\x00\x00\x00\x00\x00\x8d\x02\x00\x00\x00\x00\x00\x00\xc0\x01\x5b\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x84\x02\x5b\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb8\x02\x5b\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb2\x02\x5b\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x95\x02\x5b\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd6\x02\x5b\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xd2\x02\x5b\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xdf\x02\x5b\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xdc\x02\x5b\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xdb\x02\x5b\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x55\x00\x56\x00\x57\x00\x00\x00\x7f\x00\x5a\x00\x00\x00\x00\x00\x5b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x5b\x00\x75\x02\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x41\x00\x42\x00\x76\x02\x44\x00\x45\x00\x46\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\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 :: Array
  Int
  (Int#
   -> L Token
   -> Int#
   -> Happy_IntList
   -> HappyStk
        (HappyAbsSyn
           (Maybe UncheckedSigExp)
           (Maybe UncheckedSigExp)
           (Maybe UncheckedTypeExp)
           (Maybe UncheckedTypeExp))
   -> ParserMonad
        (HappyAbsSyn
           (Maybe UncheckedSigExp)
           (Maybe UncheckedSigExp)
           (Maybe UncheckedTypeExp)
           (Maybe UncheckedTypeExp)))
happyReduceArr = forall i e. Ix i => (i, i) -> [(i, e)] -> Array i e
Happy_Data_Array.array (Int
5, Int
364) [
	(Int
5 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_5),
	(Int
6 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_6),
	(Int
7 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_7),
	(Int
8 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_8),
	(Int
9 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_9),
	(Int
10 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_10),
	(Int
11 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_11),
	(Int
12 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_12),
	(Int
13 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_13),
	(Int
14 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_14),
	(Int
15 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_15),
	(Int
16 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_16),
	(Int
17 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_17),
	(Int
18 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_18),
	(Int
19 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_19),
	(Int
20 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_20),
	(Int
21 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_21),
	(Int
22 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_22),
	(Int
23 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_23),
	(Int
24 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_24),
	(Int
25 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_25),
	(Int
26 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_26),
	(Int
27 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_27),
	(Int
28 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_28),
	(Int
29 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_29),
	(Int
30 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_30),
	(Int
31 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_31),
	(Int
32 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_32),
	(Int
33 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_33),
	(Int
34 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_34),
	(Int
35 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_35),
	(Int
36 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_36),
	(Int
37 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_37),
	(Int
38 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_38),
	(Int
39 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_39),
	(Int
40 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_40),
	(Int
41 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_41),
	(Int
42 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_42),
	(Int
43 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_43),
	(Int
44 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_44),
	(Int
45 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_45),
	(Int
46 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_46),
	(Int
47 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_47),
	(Int
48 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_48),
	(Int
49 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_49),
	(Int
50 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_50),
	(Int
51 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_51),
	(Int
52 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_52),
	(Int
53 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_53),
	(Int
54 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_54),
	(Int
55 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_55),
	(Int
56 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_56),
	(Int
57 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_57),
	(Int
58 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_58),
	(Int
59 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_59),
	(Int
60 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_60),
	(Int
61 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_61),
	(Int
62 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_62),
	(Int
63 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_63),
	(Int
64 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_64),
	(Int
65 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_65),
	(Int
66 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_66),
	(Int
67 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_67),
	(Int
68 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_68),
	(Int
69 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_69),
	(Int
70 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_70),
	(Int
71 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_71),
	(Int
72 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_72),
	(Int
73 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_73),
	(Int
74 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_74),
	(Int
75 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_75),
	(Int
76 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_76),
	(Int
77 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_77),
	(Int
78 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_78),
	(Int
79 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_79),
	(Int
80 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_80),
	(Int
81 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_81),
	(Int
82 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_82),
	(Int
83 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_83),
	(Int
84 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_84),
	(Int
85 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_85),
	(Int
86 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_86),
	(Int
87 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_87),
	(Int
88 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_88),
	(Int
89 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_89),
	(Int
90 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_90),
	(Int
91 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_91),
	(Int
92 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_92),
	(Int
93 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_93),
	(Int
94 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_94),
	(Int
95 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_95),
	(Int
96 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_96),
	(Int
97 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_97),
	(Int
98 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_98),
	(Int
99 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_99),
	(Int
100 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_100),
	(Int
101 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_101),
	(Int
102 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_102),
	(Int
103 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_103),
	(Int
104 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_104),
	(Int
105 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_105),
	(Int
106 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_106),
	(Int
107 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_107),
	(Int
108 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_108),
	(Int
109 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_109),
	(Int
110 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_110),
	(Int
111 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_111),
	(Int
112 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_112),
	(Int
113 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_113),
	(Int
114 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_114),
	(Int
115 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_115),
	(Int
116 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_116),
	(Int
117 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_117),
	(Int
118 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_118),
	(Int
119 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_119),
	(Int
120 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_120),
	(Int
121 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_121),
	(Int
122 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_122),
	(Int
123 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_123),
	(Int
124 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_124),
	(Int
125 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_125),
	(Int
126 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_126),
	(Int
127 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_127),
	(Int
128 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_128),
	(Int
129 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_129),
	(Int
130 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_130),
	(Int
131 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_131),
	(Int
132 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_132),
	(Int
133 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_133),
	(Int
134 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_134),
	(Int
135 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_135),
	(Int
136 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_136),
	(Int
137 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_137),
	(Int
138 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_138),
	(Int
139 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_139),
	(Int
140 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_140),
	(Int
141 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_141),
	(Int
142 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_142),
	(Int
143 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_143),
	(Int
144 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_144),
	(Int
145 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_145),
	(Int
146 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_146),
	(Int
147 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_147),
	(Int
148 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_148),
	(Int
149 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_149),
	(Int
150 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_150),
	(Int
151 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_151),
	(Int
152 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_152),
	(Int
153 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_153),
	(Int
154 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_154),
	(Int
155 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_155),
	(Int
156 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_156),
	(Int
157 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_157),
	(Int
158 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_158),
	(Int
159 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_159),
	(Int
160 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_160),
	(Int
161 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_161),
	(Int
162 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_162),
	(Int
163 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_163),
	(Int
164 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_164),
	(Int
165 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_165),
	(Int
166 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_166),
	(Int
167 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_167),
	(Int
168 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_168),
	(Int
169 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_169),
	(Int
170 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_170),
	(Int
171 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_171),
	(Int
172 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_172),
	(Int
173 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_173),
	(Int
174 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_174),
	(Int
175 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_175),
	(Int
176 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_176),
	(Int
177 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_177),
	(Int
178 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_178),
	(Int
179 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_179),
	(Int
180 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_180),
	(Int
181 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_181),
	(Int
182 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_182),
	(Int
183 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_183),
	(Int
184 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_184),
	(Int
185 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_185),
	(Int
186 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_186),
	(Int
187 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_187),
	(Int
188 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_188),
	(Int
189 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_189),
	(Int
190 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_190),
	(Int
191 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_191),
	(Int
192 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_192),
	(Int
193 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_193),
	(Int
194 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_194),
	(Int
195 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_195),
	(Int
196 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_196),
	(Int
197 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_197),
	(Int
198 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_198),
	(Int
199 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_199),
	(Int
200 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_200),
	(Int
201 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_201),
	(Int
202 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_202),
	(Int
203 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_203),
	(Int
204 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_204),
	(Int
205 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_205),
	(Int
206 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_206),
	(Int
207 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_207),
	(Int
208 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_208),
	(Int
209 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_209),
	(Int
210 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_210),
	(Int
211 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_211),
	(Int
212 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_212),
	(Int
213 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_213),
	(Int
214 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_214),
	(Int
215 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_215),
	(Int
216 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_216),
	(Int
217 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_217),
	(Int
218 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_218),
	(Int
219 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_219),
	(Int
220 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_220),
	(Int
221 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_221),
	(Int
222 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_222),
	(Int
223 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_223),
	(Int
224 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_224),
	(Int
225 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_225),
	(Int
226 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_226),
	(Int
227 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_227),
	(Int
228 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_228),
	(Int
229 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_229),
	(Int
230 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_230),
	(Int
231 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_231),
	(Int
232 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_232),
	(Int
233 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_233),
	(Int
234 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_234),
	(Int
235 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_235),
	(Int
236 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_236),
	(Int
237 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_237),
	(Int
238 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_238),
	(Int
239 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_239),
	(Int
240 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_240),
	(Int
241 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_241),
	(Int
242 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_242),
	(Int
243 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_243),
	(Int
244 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_244),
	(Int
245 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_245),
	(Int
246 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_246),
	(Int
247 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_247),
	(Int
248 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_248),
	(Int
249 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_249),
	(Int
250 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_250),
	(Int
251 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_251),
	(Int
252 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_252),
	(Int
253 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_253),
	(Int
254 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_254),
	(Int
255 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_255),
	(Int
256 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_256),
	(Int
257 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_257),
	(Int
258 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_258),
	(Int
259 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_259),
	(Int
260 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_260),
	(Int
261 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_261),
	(Int
262 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_262),
	(Int
263 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_263),
	(Int
264 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_264),
	(Int
265 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_265),
	(Int
266 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_266),
	(Int
267 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_267),
	(Int
268 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_268),
	(Int
269 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_269),
	(Int
270 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_270),
	(Int
271 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_271),
	(Int
272 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_272),
	(Int
273 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_273),
	(Int
274 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_274),
	(Int
275 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_275),
	(Int
276 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_276),
	(Int
277 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_277),
	(Int
278 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_278),
	(Int
279 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_279),
	(Int
280 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_280),
	(Int
281 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_281),
	(Int
282 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_282),
	(Int
283 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_283),
	(Int
284 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_284),
	(Int
285 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_285),
	(Int
286 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_286),
	(Int
287 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_287),
	(Int
288 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_288),
	(Int
289 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_289),
	(Int
290 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_290),
	(Int
291 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_291),
	(Int
292 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_292),
	(Int
293 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_293),
	(Int
294 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_294),
	(Int
295 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_295),
	(Int
296 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_296),
	(Int
297 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_297),
	(Int
298 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_298),
	(Int
299 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_299),
	(Int
300 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_300),
	(Int
301 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_301),
	(Int
302 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_302),
	(Int
303 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_303),
	(Int
304 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_304),
	(Int
305 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_305),
	(Int
306 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_306),
	(Int
307 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_307),
	(Int
308 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_308),
	(Int
309 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_309),
	(Int
310 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_310),
	(Int
311 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_311),
	(Int
312 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_312),
	(Int
313 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_313),
	(Int
314 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_314),
	(Int
315 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_315),
	(Int
316 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_316),
	(Int
317 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_317),
	(Int
318 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_318),
	(Int
319 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_319),
	(Int
320 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_320),
	(Int
321 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_321),
	(Int
322 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_322),
	(Int
323 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_323),
	(Int
324 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_324),
	(Int
325 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_325),
	(Int
326 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_326),
	(Int
327 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_327),
	(Int
328 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_328),
	(Int
329 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_329),
	(Int
330 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_330),
	(Int
331 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_331),
	(Int
332 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_332),
	(Int
333 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_333),
	(Int
334 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_334),
	(Int
335 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_335),
	(Int
336 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_336),
	(Int
337 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_337),
	(Int
338 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_338),
	(Int
339 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_339),
	(Int
340 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_340),
	(Int
341 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_341),
	(Int
342 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_342),
	(Int
343 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_343),
	(Int
344 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_344),
	(Int
345 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_345),
	(Int
346 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_346),
	(Int
347 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_347),
	(Int
348 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_348),
	(Int
349 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_349),
	(Int
350 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_350),
	(Int
351 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_351),
	(Int
352 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_352),
	(Int
353 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_353),
	(Int
354 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_354),
	(Int
355 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_355),
	(Int
356 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_356),
	(Int
357 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_357),
	(Int
358 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_358),
	(Int
359 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_359),
	(Int
360 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_360),
	(Int
361 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_361),
	(Int
362 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_362),
	(Int
363 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_363),
	(Int
364 , Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_364)
	]

happy_n_terms :: Int
happy_n_terms = Int
104 :: Prelude.Int
happy_n_nonterms :: Int
happy_n_nonterms = Int
98 :: Prelude.Int

#if __GLASGOW_HASKELL__ >= 710
happyReduce_5 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_5 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_5 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
0# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_5
happyReduction_5 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_5 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
DocComment -> HappyAbsSyn t102 t103 t104 t105
happyIn8
		 (let L Loc
loc (DOC String
s) = L Token
happy_var_1 in String -> SrcLoc -> DocComment
DocComment String
s (forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_6 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_6 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_6 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
1# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_6
happyReduction_6 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_6 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap8
happyOut8 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap8 DocComment
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap8
happyOut8 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap8 DocComment
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap12
happyOut12 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap12 UncheckedDec
happy_var_3) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap11
happyOut11 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap11 [UncheckedDec]
happy_var_4) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedProg -> HappyAbsSyn t102 t103 t104 t105
happyIn9
		 (forall (f :: * -> *) vn.
Maybe DocComment -> [DecBase f vn] -> ProgBase f vn
Prog (forall a. a -> Maybe a
Just DocComment
happy_var_1) (DocComment -> UncheckedDec -> UncheckedDec
addDoc DocComment
happy_var_2 UncheckedDec
happy_var_3 forall a. a -> [a] -> [a]
: [UncheckedDec]
happy_var_4)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_7 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_7 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_7 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
1# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_7
happyReduction_7 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_7 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap8
happyOut8 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap8 DocComment
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap12
happyOut12 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap12 UncheckedDec
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap11
happyOut11 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap11 [UncheckedDec]
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedProg -> HappyAbsSyn t102 t103 t104 t105
happyIn9
		 (forall (f :: * -> *) vn.
Maybe DocComment -> [DecBase f vn] -> ProgBase f vn
Prog (forall a. a -> Maybe a
Just DocComment
happy_var_1) (UncheckedDec
happy_var_2 forall a. a -> [a] -> [a]
: [UncheckedDec]
happy_var_3)
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_8 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_8 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_8 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
1# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_8
happyReduction_8 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_8 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap12
happyOut12 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap12 UncheckedDec
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap11
happyOut11 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap11 [UncheckedDec]
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedProg -> HappyAbsSyn t102 t103 t104 t105
happyIn9
		 (forall (f :: * -> *) vn.
Maybe DocComment -> [DecBase f vn] -> ProgBase f vn
Prog forall a. Maybe a
Nothing (UncheckedDec
happy_var_1 forall a. a -> [a] -> [a]
: [UncheckedDec]
happy_var_2)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_9 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_9 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_9 = Int#
-> HappyAbsSyn
     (Maybe UncheckedSigExp)
     (Maybe UncheckedSigExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
1# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
happyReduction_9
happyReduction_9 :: HappyAbsSyn t102 t103 t104 t105
happyReduction_9  =  forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedProg -> HappyAbsSyn t102 t103 t104 t105
happyIn9
		 (forall (f :: * -> *) vn.
Maybe DocComment -> [DecBase f vn] -> ProgBase f vn
Prog forall a. Maybe a
Nothing []
	)

#if __GLASGOW_HASKELL__ >= 710
happyReduce_10 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_10 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_10 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
2# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_10
happyReduction_10 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_10 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap12
happyOut12 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap12 UncheckedDec
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedDec -> HappyAbsSyn t102 t103 t104 t105
happyIn10
		 (UncheckedDec
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_11 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_11 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_11 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
2# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_11
happyReduction_11 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_11 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap8
happyOut8 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap8 DocComment
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap12
happyOut12 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap12 UncheckedDec
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedDec -> HappyAbsSyn t102 t103 t104 t105
happyIn10
		 (DocComment -> UncheckedDec -> UncheckedDec
addDoc DocComment
happy_var_1 UncheckedDec
happy_var_2
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_12 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_12 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_12 = Int#
-> HappyAbsSyn
     (Maybe UncheckedSigExp)
     (Maybe UncheckedSigExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
3# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
happyReduction_12
happyReduction_12 :: HappyAbsSyn t102 t103 t104 t105
happyReduction_12  =  forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[UncheckedDec] -> HappyAbsSyn t102 t103 t104 t105
happyIn11
		 ([]
	)

#if __GLASGOW_HASKELL__ >= 710
happyReduce_13 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_13 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_13 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
3# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_13
happyReduction_13 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_13 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap10
happyOut10 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap10 UncheckedDec
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap11
happyOut11 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap11 [UncheckedDec]
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[UncheckedDec] -> HappyAbsSyn t102 t103 t104 t105
happyIn11
		 (UncheckedDec
happy_var_1 forall a. a -> [a] -> [a]
: [UncheckedDec]
happy_var_2
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_14 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_14 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_14 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
4# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_14
happyReduction_14 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_14 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap33
happyOut33 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap33 ValBindBase NoInfo Name
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedDec -> HappyAbsSyn t102 t103 t104 t105
happyIn12
		 (forall (f :: * -> *) vn. ValBindBase f vn -> DecBase f vn
ValDec ValBindBase NoInfo Name
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_15 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_15 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_15 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
4# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_15
happyReduction_15 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_15 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap34
happyOut34 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap34 TypeBindBase NoInfo Name
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedDec -> HappyAbsSyn t102 t103 t104 t105
happyIn12
		 (forall (f :: * -> *) vn. TypeBindBase f vn -> DecBase f vn
TypeDec TypeBindBase NoInfo Name
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_16 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_16 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_16 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
4# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_16
happyReduction_16 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_16 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap15
happyOut15 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap15 SigBindBase NoInfo Name
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedDec -> HappyAbsSyn t102 t103 t104 t105
happyIn12
		 (forall (f :: * -> *) vn. SigBindBase f vn -> DecBase f vn
SigDec SigBindBase NoInfo Name
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_17 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_17 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_17 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
4# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_17
happyReduction_17 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_17 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap20
happyOut20 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap20 ModBindBase NoInfo Name
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedDec -> HappyAbsSyn t102 t103 t104 t105
happyIn12
		 (forall (f :: * -> *) vn. ModBindBase f vn -> DecBase f vn
ModDec ModBindBase NoInfo Name
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_18 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_18 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_18 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
4# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_18
happyReduction_18 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_18 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
OPEN) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap16
happyOut16 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap16 UncheckedModExp
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedDec -> HappyAbsSyn t102 t103 t104 t105
happyIn12
		 (forall (f :: * -> *) vn. ModExpBase f vn -> SrcLoc -> DecBase f vn
OpenDec UncheckedModExp
happy_var_2 (forall a. Located a => a -> SrcLoc
srclocOf Loc
happy_var_1)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_19 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_19 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_19 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
4# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_19
happyReduction_19 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_19 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
IMPORT) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedDec -> HappyAbsSyn t102 t103 t104 t105
happyIn12
		 (let L Loc
_ (STRINGLIT Text
s) = L Token
happy_var_2 in forall (f :: * -> *) vn.
String -> f String -> SrcLoc -> DecBase f vn
ImportDec (Text -> String
T.unpack Text
s) forall {k} (a :: k). NoInfo a
NoInfo (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 L Token
happy_var_2)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_20 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_20 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_20 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
4# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_20
happyReduction_20 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_20 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LOCAL) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap10
happyOut10 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap10 UncheckedDec
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedDec -> HappyAbsSyn t102 t103 t104 t105
happyIn12
		 (forall (f :: * -> *) vn. DecBase f vn -> SrcLoc -> DecBase f vn
LocalDec UncheckedDec
happy_var_2 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedDec
happy_var_2)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_21 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_21 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_21 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
4# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_21
happyReduction_21 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_21 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap100
happyOut100 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap100 AttrInfo Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap12
happyOut12 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap12 UncheckedDec
happy_var_4) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedDec -> HappyAbsSyn t102 t103 t104 t105
happyIn12
		 (AttrInfo Name -> UncheckedDec -> UncheckedDec
addAttr AttrInfo Name
happy_var_2 UncheckedDec
happy_var_4
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_22 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_22 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_22 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
5# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_22
happyReduction_22 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_22 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap52
happyOut52 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap52 (QualName Name, Loc)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedSigExp -> HappyAbsSyn t102 t103 t104 t105
happyIn13
		 (let (QualName Name
v, Loc
loc) = (QualName Name, Loc)
happy_var_1 in forall (f :: * -> *) vn.
QualName vn -> f (Map VName VName) -> SrcLoc -> SigExpBase f vn
SigVar QualName Name
v forall {k} (a :: k). NoInfo a
NoInfo (forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_23 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_23 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_23 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
5# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_23
happyReduction_23 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_23 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LCURLY) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap25
happyOut25 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap25 [SpecBase NoInfo Name]
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RCURLY) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedSigExp -> HappyAbsSyn t102 t103 t104 t105
happyIn13
		 (forall (f :: * -> *) vn.
[SpecBase f vn] -> SrcLoc -> SigExpBase f vn
SigSpecs [SpecBase NoInfo Name]
happy_var_2 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_24 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_24 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_24 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
5# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_24
happyReduction_24 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_24 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap13
happyOut13 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap13 UncheckedSigExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap14
happyOut14 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap14 TypeRefBase Name
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedSigExp -> HappyAbsSyn t102 t103 t104 t105
happyIn13
		 (forall (f :: * -> *) vn.
SigExpBase f vn -> TypeRefBase vn -> SrcLoc -> SigExpBase f vn
SigWith UncheckedSigExp
happy_var_1 TypeRefBase Name
happy_var_3 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedSigExp
happy_var_1 TypeRefBase Name
happy_var_3)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_25 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_25 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_25 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
5# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_25
happyReduction_25 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_25 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap13
happyOut13 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap13 UncheckedSigExp
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedSigExp -> HappyAbsSyn t102 t103 t104 t105
happyIn13
		 (forall (f :: * -> *) vn.
SigExpBase f vn -> SrcLoc -> SigExpBase f vn
SigParens UncheckedSigExp
happy_var_2 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_26 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_26 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_26 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
7# Int#
5# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_26
happyReduction_26 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_26 (HappyAbsSyn t102 t103 t104 t105
happy_x_7 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_6 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap13
happyOut13 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap13 UncheckedSigExp
happy_var_4) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap13
happyOut13 HappyAbsSyn t102 t103 t104 t105
happy_x_7 of { (HappyWrap13 UncheckedSigExp
happy_var_7) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedSigExp -> HappyAbsSyn t102 t103 t104 t105
happyIn13
		 (let L Loc
_ (ID Name
name) = L Token
happy_var_2
                                in forall (f :: * -> *) vn.
Maybe vn
-> SigExpBase f vn -> SigExpBase f vn -> SrcLoc -> SigExpBase f vn
SigArrow (forall a. a -> Maybe a
Just Name
name) UncheckedSigExp
happy_var_4 UncheckedSigExp
happy_var_7 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedSigExp
happy_var_7)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_27 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_27 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_27 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
5# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_27
happyReduction_27 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_27 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap13
happyOut13 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap13 UncheckedSigExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap13
happyOut13 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap13 UncheckedSigExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedSigExp -> HappyAbsSyn t102 t103 t104 t105
happyIn13
		 (forall (f :: * -> *) vn.
Maybe vn
-> SigExpBase f vn -> SigExpBase f vn -> SrcLoc -> SigExpBase f vn
SigArrow forall a. Maybe a
Nothing UncheckedSigExp
happy_var_1 UncheckedSigExp
happy_var_3 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedSigExp
happy_var_1 UncheckedSigExp
happy_var_3)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_28 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_28 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_28 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
6# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_28
happyReduction_28 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_28 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap52
happyOut52 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap52 (QualName Name, Loc)
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap29
happyOut29 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap29 [TypeParamBase Name]
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap37
happyOut37 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap37 UncheckedTypeExp
happy_var_4) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
TypeRefBase Name -> HappyAbsSyn t102 t103 t104 t105
happyIn14
		 (forall vn.
QualName vn
-> [TypeParamBase vn] -> TypeExp vn -> SrcLoc -> TypeRefBase vn
TypeRef (forall a b. (a, b) -> a
fst (QualName Name, Loc)
happy_var_1) [TypeParamBase Name]
happy_var_2 UncheckedTypeExp
happy_var_4 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan (forall a b. (a, b) -> b
snd (QualName Name, Loc)
happy_var_1) UncheckedTypeExp
happy_var_4)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_29 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_29 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_29 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
7# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_29
happyReduction_29 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_29 (HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
MODULE) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { L Token
happy_var_3 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap13
happyOut13 HappyAbsSyn t102 t103 t104 t105
happy_x_5 of { (HappyWrap13 UncheckedSigExp
happy_var_5) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
SigBindBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn15
		 (let L Loc
_ (ID Name
name) = L Token
happy_var_3
            in forall (f :: * -> *) vn.
vn
-> SigExpBase f vn
-> Maybe DocComment
-> SrcLoc
-> SigBindBase f vn
SigBind Name
name UncheckedSigExp
happy_var_5 forall a. Maybe a
Nothing (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedSigExp
happy_var_5)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_30 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_30 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_30 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
8# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_30
happyReduction_30 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_30 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap16
happyOut16 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap16 UncheckedModExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap13
happyOut13 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap13 UncheckedSigExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedModExp -> HappyAbsSyn t102 t103 t104 t105
happyIn16
		 (forall (f :: * -> *) vn.
ModExpBase f vn
-> SigExpBase f vn
-> f (Map VName VName)
-> SrcLoc
-> ModExpBase f vn
ModAscript UncheckedModExp
happy_var_1 UncheckedSigExp
happy_var_3 forall {k} (a :: k). NoInfo a
NoInfo (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedModExp
happy_var_1 UncheckedSigExp
happy_var_3)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_31 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_31 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_31 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
8# forall {k} {k} {k} {t102 :: k} {t104 :: k} {t105 :: k}.
HappyStk (HappyAbsSyn t102 (Maybe UncheckedSigExp) t104 t105)
-> HappyStk (HappyAbsSyn t102 (Maybe UncheckedSigExp) t104 t105)
happyReduction_31
happyReduction_31 :: HappyStk (HappyAbsSyn t102 (Maybe UncheckedSigExp) t104 t105)
-> HappyStk (HappyAbsSyn t102 (Maybe UncheckedSigExp) t104 t105)
happyReduction_31 (HappyAbsSyn t102 (Maybe UncheckedSigExp) t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 (Maybe UncheckedSigExp) t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 (Maybe UncheckedSigExp) t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 (Maybe UncheckedSigExp) t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 (Maybe UncheckedSigExp) t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 (Maybe UncheckedSigExp) t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 (Maybe UncheckedSigExp) t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
BACKSLASH) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap21
happyOut21 HappyAbsSyn t102 (Maybe UncheckedSigExp) t104 t105
happy_x_2 of { (HappyWrap21 ModParamBase NoInfo Name
happy_var_2) -> 
	case forall {k} {k} {k} (t102 :: k) t103 (t104 :: k) (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> t103
happyOut103 HappyAbsSyn t102 (Maybe UncheckedSigExp) t104 t105
happy_x_3 of { Maybe UncheckedSigExp
happy_var_3 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap16
happyOut16 HappyAbsSyn t102 (Maybe UncheckedSigExp) t104 t105
happy_x_5 of { (HappyWrap16 UncheckedModExp
happy_var_5) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedModExp -> HappyAbsSyn t102 t103 t104 t105
happyIn16
		 (forall (f :: * -> *) vn.
ModParamBase f vn
-> Maybe (SigExpBase f vn, f (Map VName VName))
-> ModExpBase f vn
-> SrcLoc
-> ModExpBase f vn
ModLambda ModParamBase NoInfo Name
happy_var_2 (forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (,forall {k} (a :: k). NoInfo a
NoInfo) Maybe UncheckedSigExp
happy_var_3) UncheckedModExp
happy_var_5 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedModExp
happy_var_5)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 (Maybe UncheckedSigExp) t104 t105)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_32 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_32 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_32 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
8# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_32
happyReduction_32 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_32 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
IMPORT) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedModExp -> HappyAbsSyn t102 t103 t104 t105
happyIn16
		 (let L Loc
_ (STRINGLIT Text
s) = L Token
happy_var_2 in forall (f :: * -> *) vn.
String -> f String -> SrcLoc -> ModExpBase f vn
ModImport (Text -> String
T.unpack Text
s) forall {k} (a :: k). NoInfo a
NoInfo (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 L Token
happy_var_2)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_33 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_33 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_33 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
8# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_33
happyReduction_33 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_33 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap17
happyOut17 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap17 UncheckedModExp
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedModExp -> HappyAbsSyn t102 t103 t104 t105
happyIn16
		 (UncheckedModExp
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_34 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_34 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_34 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
8# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_34
happyReduction_34 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_34 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap18
happyOut18 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap18 UncheckedModExp
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedModExp -> HappyAbsSyn t102 t103 t104 t105
happyIn16
		 (UncheckedModExp
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_35 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_35 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_35 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
9# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_35
happyReduction_35 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_35 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap18
happyOut18 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap18 UncheckedModExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap18
happyOut18 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap18 UncheckedModExp
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedModExp -> HappyAbsSyn t102 t103 t104 t105
happyIn17
		 (forall (f :: * -> *) vn.
ModExpBase f vn
-> ModExpBase f vn
-> f (Map VName VName)
-> f (Map VName VName)
-> SrcLoc
-> ModExpBase f vn
ModApply UncheckedModExp
happy_var_1 UncheckedModExp
happy_var_2 forall {k} (a :: k). NoInfo a
NoInfo forall {k} (a :: k). NoInfo a
NoInfo (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedModExp
happy_var_1 UncheckedModExp
happy_var_2)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_36 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_36 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_36 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
9# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_36
happyReduction_36 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_36 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap17
happyOut17 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap17 UncheckedModExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap18
happyOut18 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap18 UncheckedModExp
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedModExp -> HappyAbsSyn t102 t103 t104 t105
happyIn17
		 (forall (f :: * -> *) vn.
ModExpBase f vn
-> ModExpBase f vn
-> f (Map VName VName)
-> f (Map VName VName)
-> SrcLoc
-> ModExpBase f vn
ModApply UncheckedModExp
happy_var_1 UncheckedModExp
happy_var_2 forall {k} (a :: k). NoInfo a
NoInfo forall {k} (a :: k). NoInfo a
NoInfo (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedModExp
happy_var_1 UncheckedModExp
happy_var_2)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_37 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_37 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_37 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
10# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_37
happyReduction_37 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_37 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap16
happyOut16 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap16 UncheckedModExp
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedModExp -> HappyAbsSyn t102 t103 t104 t105
happyIn18
		 (forall (f :: * -> *) vn.
ModExpBase f vn -> SrcLoc -> ModExpBase f vn
ModParens UncheckedModExp
happy_var_2 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_38 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_38 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_38 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
10# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_38
happyReduction_38 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_38 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap52
happyOut52 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap52 (QualName Name, Loc)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedModExp -> HappyAbsSyn t102 t103 t104 t105
happyIn18
		 (let (QualName Name
v, Loc
loc) = (QualName Name, Loc)
happy_var_1 in forall (f :: * -> *) vn. QualName vn -> SrcLoc -> ModExpBase f vn
ModVar QualName Name
v (forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_39 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_39 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_39 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
10# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_39
happyReduction_39 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_39 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LCURLY) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap11
happyOut11 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap11 [UncheckedDec]
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RCURLY) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedModExp -> HappyAbsSyn t102 t103 t104 t105
happyIn18
		 (forall (f :: * -> *) vn.
[DecBase f vn] -> SrcLoc -> ModExpBase f vn
ModDecs [UncheckedDec]
happy_var_2 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_40 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_40 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_40 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
11# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_40
happyReduction_40 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_40 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap52
happyOut52 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap52 (QualName Name, Loc)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedSigExp -> HappyAbsSyn t102 t103 t104 t105
happyIn19
		 (let (QualName Name
v, Loc
loc) = (QualName Name, Loc)
happy_var_1 in forall (f :: * -> *) vn.
QualName vn -> f (Map VName VName) -> SrcLoc -> SigExpBase f vn
SigVar QualName Name
v forall {k} (a :: k). NoInfo a
NoInfo (forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_41 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_41 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_41 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
11# forall {k} {k} {k} {k} {k} {k} {k} {k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
p
-> HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_41
happyReduction_41 :: p
-> HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_41 p
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	p
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap13
happyOut13 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap13 UncheckedSigExp
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedSigExp -> HappyAbsSyn t102 t103 t104 t105
happyIn19
		 (UncheckedSigExp
happy_var_2
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_42 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_42 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_42 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
6# Int#
12# forall {k} {k} {k} {t103 :: k} {t104 :: k} {t105 :: k}.
HappyStk (HappyAbsSyn (Maybe UncheckedSigExp) t103 t104 t105)
-> HappyStk (HappyAbsSyn (Maybe UncheckedSigExp) t103 t104 t105)
happyReduction_42
happyReduction_42 :: HappyStk (HappyAbsSyn (Maybe UncheckedSigExp) t103 t104 t105)
-> HappyStk (HappyAbsSyn (Maybe UncheckedSigExp) t103 t104 t105)
happyReduction_42 (HappyAbsSyn (Maybe UncheckedSigExp) t103 t104 t105
happy_x_6 `HappyStk`
	HappyAbsSyn (Maybe UncheckedSigExp) t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn (Maybe UncheckedSigExp) t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn (Maybe UncheckedSigExp) t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn (Maybe UncheckedSigExp) t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn (Maybe UncheckedSigExp) t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn (Maybe UncheckedSigExp) t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn (Maybe UncheckedSigExp) t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
MODULE) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn (Maybe UncheckedSigExp) t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap22
happyOut22 HappyAbsSyn (Maybe UncheckedSigExp) t103 t104 t105
happy_x_3 of { (HappyWrap22 [ModParamBase NoInfo Name]
happy_var_3) -> 
	case forall {k} {k} {k} t102 (t103 :: k) (t104 :: k) (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> t102
happyOut102 HappyAbsSyn (Maybe UncheckedSigExp) t103 t104 t105
happy_x_4 of { Maybe UncheckedSigExp
happy_var_4 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap16
happyOut16 HappyAbsSyn (Maybe UncheckedSigExp) t103 t104 t105
happy_x_6 of { (HappyWrap16 UncheckedModExp
happy_var_6) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
ModBindBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn20
		 (let L Loc
floc (ID Name
fname) = L Token
happy_var_2;
             in forall (f :: * -> *) vn.
vn
-> [ModParamBase f vn]
-> Maybe (SigExpBase f vn, f (Map VName VName))
-> ModExpBase f vn
-> Maybe DocComment
-> SrcLoc
-> ModBindBase f vn
ModBind Name
fname [ModParamBase NoInfo Name]
happy_var_3 (forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (,forall {k} (a :: k). NoInfo a
NoInfo) Maybe UncheckedSigExp
happy_var_4) UncheckedModExp
happy_var_6 forall a. Maybe a
Nothing (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedModExp
happy_var_6)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn (Maybe UncheckedSigExp) t103 t104 t105)
happyRest}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_43 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_43 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_43 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
13# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_43
happyReduction_43 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_43 (HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap13
happyOut13 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap13 UncheckedSigExp
happy_var_4) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_5 of { (L Loc
happy_var_5 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
ModParamBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn21
		 (let L Loc
_ (ID Name
name) = L Token
happy_var_2 in forall (f :: * -> *) vn.
vn -> SigExpBase f vn -> f [VName] -> SrcLoc -> ModParamBase f vn
ModParam Name
name UncheckedSigExp
happy_var_4 forall {k} (a :: k). NoInfo a
NoInfo (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_5)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_44 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_44 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_44 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
14# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_44
happyReduction_44 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_44 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap21
happyOut21 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap21 ModParamBase NoInfo Name
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap22
happyOut22 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap22 [ModParamBase NoInfo Name]
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[ModParamBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn22
		 (ModParamBase NoInfo Name
happy_var_1 forall a. a -> [a] -> [a]
: [ModParamBase NoInfo Name]
happy_var_2
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_45 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_45 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_45 = Int#
-> HappyAbsSyn
     (Maybe UncheckedSigExp)
     (Maybe UncheckedSigExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
14# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
happyReduction_45
happyReduction_45 :: HappyAbsSyn t102 t103 t104 t105
happyReduction_45  =  forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[ModParamBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn22
		 ([]
	)

#if __GLASGOW_HASKELL__ >= 710
happyReduce_46 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_46 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_46 = Int#
-> HappyAbsSyn
     (Maybe UncheckedSigExp)
     (Maybe UncheckedSigExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
15# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
happyReduction_46
happyReduction_46 :: HappyAbsSyn t102 t103 t104 t105
happyReduction_46  =  forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
Liftedness -> HappyAbsSyn t102 t103 t104 t105
happyIn23
		 (Liftedness
Unlifted
	)

#if __GLASGOW_HASKELL__ >= 710
happyReduce_47 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_47 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_47 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
15# forall {k} {k} {k} {k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_47
happyReduction_47 :: p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_47 p
happy_x_1
	 =  forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
Liftedness -> HappyAbsSyn t102 t103 t104 t105
happyIn23
		 (Liftedness
SizeLifted
	)

#if __GLASGOW_HASKELL__ >= 710
happyReduce_48 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_48 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_48 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
15# forall {k} {k} {k} {k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_48
happyReduction_48 :: p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_48 p
happy_x_1
	 =  forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
Liftedness -> HappyAbsSyn t102 t103 t104 t105
happyIn23
		 (Liftedness
Lifted
	)

#if __GLASGOW_HASKELL__ >= 710
happyReduce_49 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_49 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_49 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
16# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_49
happyReduction_49 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_49 (HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
VAL) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap29
happyOut29 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap29 [TypeParamBase Name]
happy_var_3) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap35
happyOut35 HappyAbsSyn t102 t103 t104 t105
happy_x_5 of { (HappyWrap35 UncheckedTypeExp
happy_var_5) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
SpecBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn24
		 (let L Loc
loc (ID Name
name) = L Token
happy_var_2
          in forall (f :: * -> *) vn.
vn
-> [TypeParamBase vn]
-> TypeExp vn
-> f StructType
-> Maybe DocComment
-> SrcLoc
-> SpecBase f vn
ValSpec Name
name [TypeParamBase Name]
happy_var_3 UncheckedTypeExp
happy_var_5 forall {k} (a :: k). NoInfo a
NoInfo forall a. Maybe a
Nothing (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedTypeExp
happy_var_5)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_50 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_50 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_50 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
16# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_50
happyReduction_50 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_50 (HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
VAL) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap31
happyOut31 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap31 Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap29
happyOut29 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap29 [TypeParamBase Name]
happy_var_3) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap35
happyOut35 HappyAbsSyn t102 t103 t104 t105
happy_x_5 of { (HappyWrap35 UncheckedTypeExp
happy_var_5) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
SpecBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn24
		 (forall (f :: * -> *) vn.
vn
-> [TypeParamBase vn]
-> TypeExp vn
-> f StructType
-> Maybe DocComment
-> SrcLoc
-> SpecBase f vn
ValSpec Name
happy_var_2 [TypeParamBase Name]
happy_var_3 UncheckedTypeExp
happy_var_5 forall {k} (a :: k). NoInfo a
NoInfo forall a. Maybe a
Nothing (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedTypeExp
happy_var_5)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_51 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_51 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_51 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
16# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_51
happyReduction_51 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_51 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap34
happyOut34 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap34 TypeBindBase NoInfo Name
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
SpecBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn24
		 (forall (f :: * -> *) vn. TypeBindBase f vn -> SpecBase f vn
TypeAbbrSpec TypeBindBase NoInfo Name
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_52 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_52 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_52 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
16# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_52
happyReduction_52 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_52 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
TYPE) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap23
happyOut23 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap23 Liftedness
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { L Token
happy_var_3 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap29
happyOut29 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap29 [TypeParamBase Name]
happy_var_4) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
SpecBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn24
		 (let L Loc
_ (ID Name
name) = L Token
happy_var_3
          in forall (f :: * -> *) vn.
Liftedness
-> vn
-> [TypeParamBase vn]
-> Maybe DocComment
-> SrcLoc
-> SpecBase f vn
TypeSpec Liftedness
happy_var_2 Name
name [TypeParamBase Name]
happy_var_4 forall a. Maybe a
Nothing (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 [TypeParamBase Name]
happy_var_4)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_53 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_53 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_53 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
6# Int#
16# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_53
happyReduction_53 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_53 (HappyAbsSyn t102 t103 t104 t105
happy_x_6 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
TYPE) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap23
happyOut23 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap23 Liftedness
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { L Token
happy_var_3 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { L Token
happy_var_4 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap29
happyOut29 HappyAbsSyn t102 t103 t104 t105
happy_x_6 of { (HappyWrap29 [TypeParamBase Name]
happy_var_6) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
SpecBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn24
		 (let L Loc
_ (INDEXING Name
name) = L Token
happy_var_3; L Loc
ploc (ID Name
pname) = L Token
happy_var_4
          in forall (f :: * -> *) vn.
Liftedness
-> vn
-> [TypeParamBase vn]
-> Maybe DocComment
-> SrcLoc
-> SpecBase f vn
TypeSpec Liftedness
happy_var_2 Name
name (forall vn. vn -> SrcLoc -> TypeParamBase vn
TypeParamDim Name
pname (forall a. Located a => a -> SrcLoc
srclocOf Loc
ploc) forall a. a -> [a] -> [a]
: [TypeParamBase Name]
happy_var_6) forall a. Maybe a
Nothing (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 [TypeParamBase Name]
happy_var_6)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_54 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_54 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_54 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
16# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_54
happyReduction_54 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_54 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
MODULE) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap13
happyOut13 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap13 UncheckedSigExp
happy_var_4) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
SpecBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn24
		 (let L Loc
_ (ID Name
name) = L Token
happy_var_2
          in forall (f :: * -> *) vn.
vn
-> SigExpBase f vn -> Maybe DocComment -> SrcLoc -> SpecBase f vn
ModSpec Name
name UncheckedSigExp
happy_var_4 forall a. Maybe a
Nothing (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedSigExp
happy_var_4)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_55 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_55 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_55 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
16# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_55
happyReduction_55 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_55 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
INCLUDE) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap13
happyOut13 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap13 UncheckedSigExp
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
SpecBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn24
		 (forall (f :: * -> *) vn. SigExpBase f vn -> SrcLoc -> SpecBase f vn
IncludeSpec UncheckedSigExp
happy_var_2 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedSigExp
happy_var_2)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_56 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_56 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_56 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
16# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_56
happyReduction_56 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_56 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap8
happyOut8 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap8 DocComment
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap24
happyOut24 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap24 SpecBase NoInfo Name
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
SpecBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn24
		 (DocComment -> SpecBase NoInfo Name -> SpecBase NoInfo Name
addDocSpec DocComment
happy_var_1 SpecBase NoInfo Name
happy_var_2
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_57 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_57 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_57 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
16# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_57
happyReduction_57 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_57 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap100
happyOut100 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap100 AttrInfo Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap24
happyOut24 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap24 SpecBase NoInfo Name
happy_var_4) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
SpecBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn24
		 (AttrInfo Name -> SpecBase NoInfo Name -> SpecBase NoInfo Name
addAttrSpec AttrInfo Name
happy_var_2 SpecBase NoInfo Name
happy_var_4
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_58 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_58 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_58 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
17# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_58
happyReduction_58 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_58 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap24
happyOut24 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap24 SpecBase NoInfo Name
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap25
happyOut25 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap25 [SpecBase NoInfo Name]
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[SpecBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn25
		 (SpecBase NoInfo Name
happy_var_1 forall a. a -> [a] -> [a]
: [SpecBase NoInfo Name]
happy_var_2
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_59 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_59 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_59 = Int#
-> HappyAbsSyn
     (Maybe UncheckedSigExp)
     (Maybe UncheckedSigExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
17# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
happyReduction_59
happyReduction_59 :: HappyAbsSyn t102 t103 t104 t105
happyReduction_59  =  forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[SpecBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn25
		 ([]
	)

#if __GLASGOW_HASKELL__ >= 710
happyReduce_60 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_60 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_60 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
18# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_60
happyReduction_60 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_60 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LBRACKET) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RBRACKET) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
SizeBinder Name -> HappyAbsSyn t102 t103 t104 t105
happyIn26
		 (let L Loc
_ (ID Name
name) = L Token
happy_var_2 in forall vn. vn -> SrcLoc -> SizeBinder vn
SizeBinder Name
name (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_61 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_61 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_61 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
19# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_61
happyReduction_61 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_61 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap26
happyOut26 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap26 SizeBinder Name
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap27
happyOut27 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap27 [SizeBinder Name]
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[SizeBinder Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn27
		 (SizeBinder Name
happy_var_1 forall a. a -> [a] -> [a]
: [SizeBinder Name]
happy_var_2
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_62 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_62 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_62 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
19# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_62
happyReduction_62 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_62 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap26
happyOut26 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap26 SizeBinder Name
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[SizeBinder Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn27
		 ([SizeBinder Name
happy_var_1]
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_63 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_63 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_63 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
20# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_63
happyReduction_63 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_63 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LBRACKET) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RBRACKET) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
TypeParamBase Name -> HappyAbsSyn t102 t103 t104 t105
happyIn28
		 (let L Loc
_ (ID Name
name) = L Token
happy_var_2 in forall vn. vn -> SrcLoc -> TypeParamBase vn
TypeParamDim Name
name (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_64 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_64 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_64 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
20# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_64
happyReduction_64 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_64 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
APOSTROPHE) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
TypeParamBase Name -> HappyAbsSyn t102 t103 t104 t105
happyIn28
		 (let L Loc
_ (ID Name
name) = L Token
happy_var_2 in forall vn. Liftedness -> vn -> SrcLoc -> TypeParamBase vn
TypeParamType Liftedness
Unlifted Name
name (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 L Token
happy_var_2)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_65 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_65 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_65 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
20# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_65
happyReduction_65 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_65 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
APOSTROPHE_THEN_TILDE) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
TypeParamBase Name -> HappyAbsSyn t102 t103 t104 t105
happyIn28
		 (let L Loc
_ (ID Name
name) = L Token
happy_var_2 in forall vn. Liftedness -> vn -> SrcLoc -> TypeParamBase vn
TypeParamType Liftedness
SizeLifted Name
name (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 L Token
happy_var_2)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_66 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_66 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_66 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
20# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_66
happyReduction_66 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_66 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
APOSTROPHE_THEN_HAT) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
TypeParamBase Name -> HappyAbsSyn t102 t103 t104 t105
happyIn28
		 (let L Loc
_ (ID Name
name) = L Token
happy_var_2 in forall vn. Liftedness -> vn -> SrcLoc -> TypeParamBase vn
TypeParamType Liftedness
Lifted Name
name (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 L Token
happy_var_2)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_67 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_67 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_67 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
21# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_67
happyReduction_67 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_67 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap28
happyOut28 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap28 TypeParamBase Name
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap29
happyOut29 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap29 [TypeParamBase Name]
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[TypeParamBase Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn29
		 (TypeParamBase Name
happy_var_1 forall a. a -> [a] -> [a]
: [TypeParamBase Name]
happy_var_2
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_68 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_68 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_68 = Int#
-> HappyAbsSyn
     (Maybe UncheckedSigExp)
     (Maybe UncheckedSigExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
21# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
happyReduction_68
happyReduction_68 :: HappyAbsSyn t102 t103 t104 t105
happyReduction_68  =  forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[TypeParamBase Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn29
		 ([]
	)

#if __GLASGOW_HASKELL__ >= 710
happyReduce_69 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_69 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_69 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_69
happyReduction_69 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_69 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_70 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_70 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_70 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_70
happyReduction_70 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_70 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_71 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_71 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_71 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_71
happyReduction_71 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_71 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_72 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_72 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_72 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_72
happyReduction_72 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_72 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
ASTERISK) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 ((forall v. v -> QualName v
qualName (String -> Name
nameFromString String
"*"), Loc
happy_var_1)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_73 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_73 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_73 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_73
happyReduction_73 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_73 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_74 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_74 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_74 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_74
happyReduction_74 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_74 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_75 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_75 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_75 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_75
happyReduction_75 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_75 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_76 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_76 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_76 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_76
happyReduction_76 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_76 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_77 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_77 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_77 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_77
happyReduction_77 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_77 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_78 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_78 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_78 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_78
happyReduction_78 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_78 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_79 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_79 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_79 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_79
happyReduction_79 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_79 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_80 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_80 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_80 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_80
happyReduction_80 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_80 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_81 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_81 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_81 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_81
happyReduction_81 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_81 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_82 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_82 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_82 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_82
happyReduction_82 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_82 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_83 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_83 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_83 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_83
happyReduction_83 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_83 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_84 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_84 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_84 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_84
happyReduction_84 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_84 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_85 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_85 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_85 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_85
happyReduction_85 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_85 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_86 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_86 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_86 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_86
happyReduction_86 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_86 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_87 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_87 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_87 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_87
happyReduction_87 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_87 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
HAT) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 ((forall v. v -> QualName v
qualName (String -> Name
nameFromString String
"^"), Loc
happy_var_1)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_88 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_88 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_88 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_88
happyReduction_88 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_88 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_89 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_89 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_89 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_89
happyReduction_89 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_89 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_90 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_90 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_90 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_90
happyReduction_90 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_90 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
PIPE) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 ((forall v. v -> QualName v
qualName (String -> Name
nameFromString String
"|"), Loc
happy_var_1)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_91 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_91 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_91 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_91
happyReduction_91 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_91 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_92 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_92 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_92 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_92
happyReduction_92 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_92 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_93 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_93 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_93 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_93
happyReduction_93 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_93 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_94 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_94 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_94 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_94
happyReduction_94 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_94 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 (L Token -> (QualName Name, Loc)
binOpName L Token
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_95 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_95 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_95 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_95
happyReduction_95 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_95 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LTH) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 ((forall v. v -> QualName v
qualName (String -> Name
nameFromString String
"<"), Loc
happy_var_1)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_96 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_96 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_96 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
22# forall {k} {k} {k} {k} {k} {k} {k} {k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
p
-> HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_96
happyReduction_96 :: p
-> HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_96 p
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	p
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap52
happyOut52 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap52 (QualName Name, Loc)
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn30
		 ((QualName Name, Loc)
happy_var_2
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_97 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_97 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_97 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
1# Int#
23# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> p -> ParserMonad (HappyAbsSyn t102 t103 t104 t105)
happyReduction_97
happyReduction_97 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> p -> ParserMonad (HappyAbsSyn t102 t103 t104 t105)
happyReduction_97 (HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest) p
tk
	 = forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ((case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap30
happyOut30 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap30 (QualName Name, Loc)
happy_var_1) -> 
	( let (QualName [Name]
qs Name
name, Loc
loc) = (QualName Name, Loc)
happy_var_1 in do
                   forall (f :: * -> *). Applicative f => Bool -> f () -> f ()
unless (forall (t :: * -> *) a. Foldable t => t a -> Bool
null [Name]
qs) forall a b. (a -> b) -> a -> b
$ forall loc a. Located loc => loc -> Maybe Text -> ParserMonad a
parseErrorAt Loc
loc forall a b. (a -> b) -> a -> b
$
                     forall a. a -> Maybe a
Just Text
"Cannot use a qualified name in binding position."
                   forall (f :: * -> *) a. Applicative f => a -> f a
pure Name
name)})
	) (\Name
r -> forall a. a -> ParserMonad a
happyReturn (forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
Name -> HappyAbsSyn t102 t103 t104 t105
happyIn31 Name
r))

#if __GLASGOW_HASKELL__ >= 710
happyReduce_98 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_98 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_98 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
23# forall {k} {k} {k} {k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_98
happyReduction_98 :: p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_98 p
happy_x_1
	 =  forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
Name -> HappyAbsSyn t102 t103 t104 t105
happyIn31
		 (String -> Name
nameFromString String
"-"
	)

#if __GLASGOW_HASKELL__ >= 710
happyReduce_99 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_99 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_99 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
24# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_99
happyReduction_99 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_99 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn32
		 (let L Loc
loc (ID Name
name) = L Token
happy_var_1 in (Name
name, Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_100 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_100 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_100 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
24# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {p}
       {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k}.
p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_100
happyReduction_100 :: p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_100 p
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap31
happyOut31 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap31 Name
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn32
		 ((Name
happy_var_2, Loc
happy_var_1)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_101 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_101 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_101 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
7# Int#
25# forall {k} {k} {k} {t102 :: k} {t103 :: k} {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
-> HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyReduction_101
happyReduction_101 :: HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
-> HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyReduction_101 (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_7 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_6 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_1 of { (L Loc
happy_var_1 Token
DEF) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap32
happyOut32 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_2 of { (HappyWrap32 (Name, Loc)
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap29
happyOut29 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_3 of { (HappyWrap29 [TypeParamBase Name]
happy_var_3) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap51
happyOut51 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_4 of { (HappyWrap51 [PatBase NoInfo Name]
happy_var_4) -> 
	case forall {k} {k} {k} (t102 :: k) (t103 :: k) t104 (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> t104
happyOut104 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_5 of { Maybe UncheckedTypeExp
happy_var_5 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_7 of { (HappyWrap53 UncheckedExp
happy_var_7) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
ValBindBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn33
		 (let (Name
name, Loc
_) = (Name, Loc)
happy_var_2
            in forall (f :: * -> *) vn.
Maybe (f EntryPoint)
-> vn
-> Maybe (TypeExp vn)
-> f StructRetType
-> [TypeParamBase vn]
-> [PatBase f vn]
-> ExpBase f vn
-> Maybe DocComment
-> [AttrInfo vn]
-> SrcLoc
-> ValBindBase f vn
ValBind forall a. Maybe a
Nothing Name
name Maybe UncheckedTypeExp
happy_var_5 forall {k} (a :: k). NoInfo a
NoInfo
               [TypeParamBase Name]
happy_var_3 [PatBase NoInfo Name]
happy_var_4 UncheckedExp
happy_var_7 forall a. Maybe a
Nothing forall a. Monoid a => a
mempty (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_7)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyRest}}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_102 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_102 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_102 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
7# Int#
25# forall {k} {k} {k} {t102 :: k} {t103 :: k} {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
-> HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyReduction_102
happyReduction_102 :: HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
-> HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyReduction_102 (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_7 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_6 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_1 of { (L Loc
happy_var_1 Token
ENTRY) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap32
happyOut32 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_2 of { (HappyWrap32 (Name, Loc)
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap29
happyOut29 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_3 of { (HappyWrap29 [TypeParamBase Name]
happy_var_3) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap51
happyOut51 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_4 of { (HappyWrap51 [PatBase NoInfo Name]
happy_var_4) -> 
	case forall {k} {k} {k} (t102 :: k) (t103 :: k) t104 (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> t104
happyOut104 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_5 of { Maybe UncheckedTypeExp
happy_var_5 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_7 of { (HappyWrap53 UncheckedExp
happy_var_7) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
ValBindBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn33
		 (let (Name
name, Loc
loc) = (Name, Loc)
happy_var_2
            in forall (f :: * -> *) vn.
Maybe (f EntryPoint)
-> vn
-> Maybe (TypeExp vn)
-> f StructRetType
-> [TypeParamBase vn]
-> [PatBase f vn]
-> ExpBase f vn
-> Maybe DocComment
-> [AttrInfo vn]
-> SrcLoc
-> ValBindBase f vn
ValBind (forall a. a -> Maybe a
Just forall {k} (a :: k). NoInfo a
NoInfo) Name
name Maybe UncheckedTypeExp
happy_var_5 forall {k} (a :: k). NoInfo a
NoInfo
               [TypeParamBase Name]
happy_var_3 [PatBase NoInfo Name]
happy_var_4 UncheckedExp
happy_var_7 forall a. Maybe a
Nothing forall a. Monoid a => a
mempty (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_7)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyRest}}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_103 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_103 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_103 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
7# Int#
25# forall {k} {k} {k} {t102 :: k} {t103 :: k} {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
-> HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyReduction_103
happyReduction_103 :: HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
-> HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyReduction_103 (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_7 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_6 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_1 of { (L Loc
happy_var_1 Token
DEF) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap49
happyOut49 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_2 of { (HappyWrap49 PatBase NoInfo Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap31
happyOut31 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_3 of { (HappyWrap31 Name
happy_var_3) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap49
happyOut49 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_4 of { (HappyWrap49 PatBase NoInfo Name
happy_var_4) -> 
	case forall {k} {k} {k} (t102 :: k) (t103 :: k) t104 (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> t104
happyOut104 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_5 of { Maybe UncheckedTypeExp
happy_var_5 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_7 of { (HappyWrap53 UncheckedExp
happy_var_7) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
ValBindBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn33
		 (forall (f :: * -> *) vn.
Maybe (f EntryPoint)
-> vn
-> Maybe (TypeExp vn)
-> f StructRetType
-> [TypeParamBase vn]
-> [PatBase f vn]
-> ExpBase f vn
-> Maybe DocComment
-> [AttrInfo vn]
-> SrcLoc
-> ValBindBase f vn
ValBind forall a. Maybe a
Nothing Name
happy_var_3 Maybe UncheckedTypeExp
happy_var_5 forall {k} (a :: k). NoInfo a
NoInfo [] [PatBase NoInfo Name
happy_var_2,PatBase NoInfo Name
happy_var_4] UncheckedExp
happy_var_7
            forall a. Maybe a
Nothing forall a. Monoid a => a
mempty (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_7)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyRest}}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_104 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_104 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_104 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
7# Int#
25# forall {k} {k} {k} {t102 :: k} {t103 :: k} {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
-> HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyReduction_104
happyReduction_104 :: HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
-> HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyReduction_104 (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_7 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_6 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_1 of { (L Loc
happy_var_1 Token
LET) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap32
happyOut32 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_2 of { (HappyWrap32 (Name, Loc)
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap29
happyOut29 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_3 of { (HappyWrap29 [TypeParamBase Name]
happy_var_3) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap51
happyOut51 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_4 of { (HappyWrap51 [PatBase NoInfo Name]
happy_var_4) -> 
	case forall {k} {k} {k} (t102 :: k) (t103 :: k) t104 (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> t104
happyOut104 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_5 of { Maybe UncheckedTypeExp
happy_var_5 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_7 of { (HappyWrap53 UncheckedExp
happy_var_7) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
ValBindBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn33
		 (let (Name
name, Loc
_) = (Name, Loc)
happy_var_2
            in forall (f :: * -> *) vn.
Maybe (f EntryPoint)
-> vn
-> Maybe (TypeExp vn)
-> f StructRetType
-> [TypeParamBase vn]
-> [PatBase f vn]
-> ExpBase f vn
-> Maybe DocComment
-> [AttrInfo vn]
-> SrcLoc
-> ValBindBase f vn
ValBind forall a. Maybe a
Nothing Name
name Maybe UncheckedTypeExp
happy_var_5 forall {k} (a :: k). NoInfo a
NoInfo
               [TypeParamBase Name]
happy_var_3 [PatBase NoInfo Name]
happy_var_4 UncheckedExp
happy_var_7 forall a. Maybe a
Nothing forall a. Monoid a => a
mempty (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_7)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyRest}}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_105 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_105 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_105 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
7# Int#
25# forall {k} {k} {k} {t102 :: k} {t103 :: k} {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
-> HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyReduction_105
happyReduction_105 :: HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
-> HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyReduction_105 (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_7 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_6 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_1 of { (L Loc
happy_var_1 Token
LET) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap49
happyOut49 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_2 of { (HappyWrap49 PatBase NoInfo Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap31
happyOut31 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_3 of { (HappyWrap31 Name
happy_var_3) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap49
happyOut49 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_4 of { (HappyWrap49 PatBase NoInfo Name
happy_var_4) -> 
	case forall {k} {k} {k} (t102 :: k) (t103 :: k) t104 (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> t104
happyOut104 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_5 of { Maybe UncheckedTypeExp
happy_var_5 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_7 of { (HappyWrap53 UncheckedExp
happy_var_7) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
ValBindBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn33
		 (forall (f :: * -> *) vn.
Maybe (f EntryPoint)
-> vn
-> Maybe (TypeExp vn)
-> f StructRetType
-> [TypeParamBase vn]
-> [PatBase f vn]
-> ExpBase f vn
-> Maybe DocComment
-> [AttrInfo vn]
-> SrcLoc
-> ValBindBase f vn
ValBind forall a. Maybe a
Nothing Name
happy_var_3 Maybe UncheckedTypeExp
happy_var_5 forall {k} (a :: k). NoInfo a
NoInfo [] [PatBase NoInfo Name
happy_var_2,PatBase NoInfo Name
happy_var_4] UncheckedExp
happy_var_7
            forall a. Maybe a
Nothing forall a. Monoid a => a
mempty (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_7)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyRest}}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_106 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_106 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_106 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
8# Int#
25# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> p -> ParserMonad (HappyAbsSyn t102 t103 t104 t105)
happyReduction_106
happyReduction_106 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> p -> ParserMonad (HappyAbsSyn t102 t103 t104 t105)
happyReduction_106 (HappyAbsSyn t102 t103 t104 t105
happy_x_8 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_7 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_6 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest) p
tk
	 = forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ((case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (L Loc
happy_var_2 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_6 of { (L Loc
happy_var_6 Token
RPAR) -> 
	( forall loc a. Located loc => loc -> Maybe Text -> ParserMonad a
parseErrorAt (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_2 Loc
happy_var_6) forall a b. (a -> b) -> a -> b
$ forall a. a -> Maybe a
Just forall a b. (a -> b) -> a -> b
$
             [Text] -> Text
T.unlines [Text
"Cannot bind patterns at top level.",
                        Text
"Bind a single name instead."])}})
	) (\ValBindBase NoInfo Name
r -> forall a. a -> ParserMonad a
happyReturn (forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
ValBindBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn33 ValBindBase NoInfo Name
r))

#if __GLASGOW_HASKELL__ >= 710
happyReduce_107 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_107 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_107 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
8# Int#
25# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> p -> ParserMonad (HappyAbsSyn t102 t103 t104 t105)
happyReduction_107
happyReduction_107 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> p -> ParserMonad (HappyAbsSyn t102 t103 t104 t105)
happyReduction_107 (HappyAbsSyn t102 t103 t104 t105
happy_x_8 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_7 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_6 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest) p
tk
	 = forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ((case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (L Loc
happy_var_2 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_6 of { (L Loc
happy_var_6 Token
RPAR) -> 
	( forall loc a. Located loc => loc -> Maybe Text -> ParserMonad a
parseErrorAt (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_2 Loc
happy_var_6) forall a b. (a -> b) -> a -> b
$ forall a. a -> Maybe a
Just forall a b. (a -> b) -> a -> b
$
             [Text] -> Text
T.unlines [Text
"Cannot bind patterns at top level.",
                        Text
"Bind a single name instead."])}})
	) (\ValBindBase NoInfo Name
r -> forall a. a -> ParserMonad a
happyReturn (forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
ValBindBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn33 ValBindBase NoInfo Name
r))

#if __GLASGOW_HASKELL__ >= 710
happyReduce_108 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_108 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_108 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
6# Int#
26# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_108
happyReduction_108 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_108 (HappyAbsSyn t102 t103 t104 t105
happy_x_6 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
TYPE) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap23
happyOut23 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap23 Liftedness
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { L Token
happy_var_3 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap29
happyOut29 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap29 [TypeParamBase Name]
happy_var_4) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap35
happyOut35 HappyAbsSyn t102 t103 t104 t105
happy_x_6 of { (HappyWrap35 UncheckedTypeExp
happy_var_6) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
TypeBindBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn34
		 (let L Loc
_ (ID Name
name) = L Token
happy_var_3
              in forall (f :: * -> *) vn.
vn
-> Liftedness
-> [TypeParamBase vn]
-> TypeExp vn
-> f StructRetType
-> Maybe DocComment
-> SrcLoc
-> TypeBindBase f vn
TypeBind Name
name Liftedness
happy_var_2 [TypeParamBase Name]
happy_var_4 UncheckedTypeExp
happy_var_6 forall {k} (a :: k). NoInfo a
NoInfo forall a. Maybe a
Nothing (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedTypeExp
happy_var_6)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_109 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_109 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_109 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
8# Int#
26# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_109
happyReduction_109 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_109 (HappyAbsSyn t102 t103 t104 t105
happy_x_8 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_7 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_6 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
TYPE) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap23
happyOut23 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap23 Liftedness
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { L Token
happy_var_3 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { L Token
happy_var_4 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap29
happyOut29 HappyAbsSyn t102 t103 t104 t105
happy_x_6 of { (HappyWrap29 [TypeParamBase Name]
happy_var_6) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap35
happyOut35 HappyAbsSyn t102 t103 t104 t105
happy_x_8 of { (HappyWrap35 UncheckedTypeExp
happy_var_8) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
TypeBindBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn34
		 (let L Loc
loc (INDEXING Name
name) = L Token
happy_var_3; L Loc
ploc (ID Name
pname) = L Token
happy_var_4
             in forall (f :: * -> *) vn.
vn
-> Liftedness
-> [TypeParamBase vn]
-> TypeExp vn
-> f StructRetType
-> Maybe DocComment
-> SrcLoc
-> TypeBindBase f vn
TypeBind Name
name Liftedness
happy_var_2 (forall vn. vn -> SrcLoc -> TypeParamBase vn
TypeParamDim Name
pname (forall a. Located a => a -> SrcLoc
srclocOf Loc
ploc)forall a. a -> [a] -> [a]
:[TypeParamBase Name]
happy_var_6) UncheckedTypeExp
happy_var_8 forall {k} (a :: k). NoInfo a
NoInfo forall a. Maybe a
Nothing (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedTypeExp
happy_var_8)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_110 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_110 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_110 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
7# Int#
27# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_110
happyReduction_110 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_110 (HappyAbsSyn t102 t103 t104 t105
happy_x_7 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_6 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap35
happyOut35 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap35 UncheckedTypeExp
happy_var_4) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap35
happyOut35 HappyAbsSyn t102 t103 t104 t105
happy_x_7 of { (HappyWrap35 UncheckedTypeExp
happy_var_7) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn35
		 (let L Loc
_ (ID Name
v) = L Token
happy_var_2 in forall vn.
Maybe vn -> TypeExp vn -> TypeExp vn -> SrcLoc -> TypeExp vn
TEArrow (forall a. a -> Maybe a
Just Name
v) UncheckedTypeExp
happy_var_4 UncheckedTypeExp
happy_var_7 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedTypeExp
happy_var_7)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_111 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_111 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_111 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
27# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_111
happyReduction_111 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_111 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap37
happyOut37 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap37 UncheckedTypeExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap35
happyOut35 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap35 UncheckedTypeExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn35
		 (forall vn.
Maybe vn -> TypeExp vn -> TypeExp vn -> SrcLoc -> TypeExp vn
TEArrow forall a. Maybe a
Nothing UncheckedTypeExp
happy_var_1 UncheckedTypeExp
happy_var_3 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedTypeExp
happy_var_1 UncheckedTypeExp
happy_var_3)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_112 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_112 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_112 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
27# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_112
happyReduction_112 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_112 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
QUESTION_MARK) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap36
happyOut36 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap36 [Name]
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap35
happyOut35 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap35 UncheckedTypeExp
happy_var_4) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn35
		 (forall vn. [vn] -> TypeExp vn -> SrcLoc -> TypeExp vn
TEDim [Name]
happy_var_2 UncheckedTypeExp
happy_var_4 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedTypeExp
happy_var_4)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_113 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_113 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_113 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
27# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_113
happyReduction_113 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_113 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap37
happyOut37 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap37 UncheckedTypeExp
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn35
		 (UncheckedTypeExp
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_114 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_114 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_114 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
28# forall {k} {k} {k} {k} {k} {k} {k} {k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
p
-> HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_114
happyReduction_114 :: p
-> HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_114 p
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	p
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn36
		 (let L Loc
_ (ID Name
v) = L Token
happy_var_2 in [Name
v]
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_115 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_115 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_115 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
28# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_115
happyReduction_115 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_115 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap36
happyOut36 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap36 [Name]
happy_var_4) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn36
		 (let L Loc
_ (ID Name
v) = L Token
happy_var_2 in Name
v forall a. a -> [a] -> [a]
: [Name]
happy_var_4
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_116 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_116 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_116 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
29# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_116
happyReduction_116 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_116 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
ASTERISK) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap37
happyOut37 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap37 UncheckedTypeExp
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn37
		 (forall vn. TypeExp vn -> SrcLoc -> TypeExp vn
TEUnique UncheckedTypeExp
happy_var_2 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedTypeExp
happy_var_2)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_117 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_117 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_117 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
29# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_117
happyReduction_117 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_117 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LBRACKET) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap48
happyOut48 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap48 SizeExp Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap37
happyOut37 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap37 UncheckedTypeExp
happy_var_4) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn37
		 (forall vn. SizeExp vn -> TypeExp vn -> SrcLoc -> TypeExp vn
TEArray SizeExp Name
happy_var_2 UncheckedTypeExp
happy_var_4 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedTypeExp
happy_var_4)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_118 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_118 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_118 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
29# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_118
happyReduction_118 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_118 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap41
happyOut41 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap41 UncheckedTypeExp
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn37
		 (UncheckedTypeExp
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_119 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_119 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_119 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
3# Int#
29# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> p -> ParserMonad (HappyAbsSyn t102 t103 t104 t105)
happyReduction_119
happyReduction_119 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> p -> ParserMonad (HappyAbsSyn t102 t103 t104 t105)
happyReduction_119 (HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest) p
tk
	 = forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ((case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LBRACKET) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap48
happyOut48 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap48 SizeExp Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RBRACKET) -> 
	( forall loc a. Located loc => loc -> Maybe Text -> ParserMonad a
parseErrorAt (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3) forall a b. (a -> b) -> a -> b
$ forall a. a -> Maybe a
Just forall a b. (a -> b) -> a -> b
$
                [Text] -> Text
T.unlines [Text
"missing array row type.",
                           Text
"Did you mean []"  forall a. Semigroup a => a -> a -> a
<> forall a. Pretty a => a -> Text
prettyText SizeExp Name
happy_var_2 forall a. Semigroup a => a -> a -> a
<> Text
"?"])}}})
	) (\UncheckedTypeExp
r -> forall a. a -> ParserMonad a
happyReturn (forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn37 UncheckedTypeExp
r))

#if __GLASGOW_HASKELL__ >= 710
happyReduce_120 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_120 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_120 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
30# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_120
happyReduction_120 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_120 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap39
happyOut39 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap39 ([(Name, [UncheckedTypeExp])], Loc)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn38
		 (let ([(Name, [UncheckedTypeExp])]
cs, Loc
loc) = ([(Name, [UncheckedTypeExp])], Loc)
happy_var_1 in forall vn. [(Name, [TypeExp vn])] -> SrcLoc -> TypeExp vn
TESum [(Name, [UncheckedTypeExp])]
cs (forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_121 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_121 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_121 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
31# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_121
happyReduction_121 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_121 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap39
happyOut39 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap39 ([(Name, [UncheckedTypeExp])], Loc)
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap40
happyOut40 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap40 (Name, [UncheckedTypeExp], Loc)
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
([(Name, [UncheckedTypeExp])], Loc)
-> HappyAbsSyn t102 t103 t104 t105
happyIn39
		 (let ([(Name, [UncheckedTypeExp])]
cs, Loc
loc1) = ([(Name, [UncheckedTypeExp])], Loc)
happy_var_1; (Name
c, [UncheckedTypeExp]
ts, Loc
loc2) = (Name, [UncheckedTypeExp], Loc)
happy_var_3
                in ([(Name, [UncheckedTypeExp])]
csforall a. [a] -> [a] -> [a]
++[(Name
c, [UncheckedTypeExp]
ts)], forall a. Located a => a -> Loc
locOf (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
loc1 Loc
loc2))
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_122 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_122 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_122 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
31# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_122
happyReduction_122 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_122 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap40
happyOut40 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap40 (Name, [UncheckedTypeExp], Loc)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
([(Name, [UncheckedTypeExp])], Loc)
-> HappyAbsSyn t102 t103 t104 t105
happyIn39
		 (let (Name
n, [UncheckedTypeExp]
ts, Loc
loc) = (Name, [UncheckedTypeExp], Loc)
happy_var_1 in ([(Name
n, [UncheckedTypeExp]
ts)], Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_123 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_123 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_123 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
32# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_123
happyReduction_123 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_123 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap40
happyOut40 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap40 (Name, [UncheckedTypeExp], Loc)
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap42
happyOut42 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap42 UncheckedTypeExp
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, [UncheckedTypeExp], Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn40
		 (let (Name
n, [UncheckedTypeExp]
ts, Loc
loc) = (Name, [UncheckedTypeExp], Loc)
happy_var_1 in (Name
n, [UncheckedTypeExp]
ts forall a. [a] -> [a] -> [a]
++ [UncheckedTypeExp
happy_var_2], forall a. Located a => a -> Loc
locOf (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
loc UncheckedTypeExp
happy_var_2))
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_124 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_124 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_124 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
32# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_124
happyReduction_124 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_124 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap43
happyOut43 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap43 (Name, Loc)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, [UncheckedTypeExp], Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn40
		 ((forall a b. (a, b) -> a
fst (Name, Loc)
happy_var_1, [], forall a b. (a, b) -> b
snd (Name, Loc)
happy_var_1)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_125 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_125 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_125 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
33# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_125
happyReduction_125 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_125 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap41
happyOut41 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap41 UncheckedTypeExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap44
happyOut44 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap44 TypeArgExp Name
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn41
		 (forall vn. TypeExp vn -> TypeArgExp vn -> SrcLoc -> TypeExp vn
TEApply UncheckedTypeExp
happy_var_1 TypeArgExp Name
happy_var_2 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedTypeExp
happy_var_1 TypeArgExp Name
happy_var_2)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_126 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_126 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_126 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
33# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_126
happyReduction_126 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_126 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap48
happyOut48 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap48 SizeExp Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RBRACKET) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn41
		 (let L Loc
loc (INDEXING Name
v) = L Token
happy_var_1
                  in forall vn. TypeExp vn -> TypeArgExp vn -> SrcLoc -> TypeExp vn
TEApply (forall vn. QualName vn -> SrcLoc -> TypeExp vn
TEVar (forall v. v -> QualName v
qualName Name
v) (forall a. Located a => a -> SrcLoc
srclocOf (Loc -> Loc
backOneCol Loc
loc)))
                             (forall vn. SizeExp vn -> SrcLoc -> TypeArgExp vn
TypeArgExpDim SizeExp Name
happy_var_2 (forall a. Located a => a -> SrcLoc
srclocOf Loc
loc))
                             (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan L Token
happy_var_1 Loc
happy_var_3)
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_127 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_127 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_127 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
33# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_127
happyReduction_127 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_127 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap48
happyOut48 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap48 SizeExp Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RBRACKET) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn41
		 (let L Loc
loc (QUALINDEXING [Name]
qs Name
v) = L Token
happy_var_1
                  in forall vn. TypeExp vn -> TypeArgExp vn -> SrcLoc -> TypeExp vn
TEApply (forall vn. QualName vn -> SrcLoc -> TypeExp vn
TEVar (forall vn. [vn] -> vn -> QualName vn
QualName [Name]
qs Name
v) (forall a. Located a => a -> SrcLoc
srclocOf (Loc -> Loc
backOneCol Loc
loc)))
                             (forall vn. SizeExp vn -> SrcLoc -> TypeArgExp vn
TypeArgExpDim SizeExp Name
happy_var_2 (forall a. Located a => a -> SrcLoc
srclocOf Loc
loc))
                             (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan L Token
happy_var_1 Loc
happy_var_3)
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_128 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_128 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_128 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
33# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_128
happyReduction_128 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_128 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap42
happyOut42 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap42 UncheckedTypeExp
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn41
		 (UncheckedTypeExp
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_129 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_129 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_129 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
34# forall {k} {k} {k} {k} {k} {k} {k} {k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
p
-> HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_129
happyReduction_129 :: p
-> HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_129 p
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	p
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap35
happyOut35 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap35 UncheckedTypeExp
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn42
		 (UncheckedTypeExp
happy_var_2
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_130 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_130 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_130 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
34# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_130
happyReduction_130 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_130 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (L Loc
happy_var_2 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn42
		 (forall vn. [TypeExp vn] -> SrcLoc -> TypeExp vn
TETuple [] (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_2)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_131 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_131 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_131 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
34# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_131
happyReduction_131 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_131 (HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap35
happyOut35 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap35 UncheckedTypeExp
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap47
happyOut47 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap47 [UncheckedTypeExp]
happy_var_4) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_5 of { (L Loc
happy_var_5 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn42
		 (forall vn. [TypeExp vn] -> SrcLoc -> TypeExp vn
TETuple (UncheckedTypeExp
happy_var_2forall a. a -> [a] -> [a]
:[UncheckedTypeExp]
happy_var_4) (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_5)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_132 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_132 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_132 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
34# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_132
happyReduction_132 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_132 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LCURLY) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (L Loc
happy_var_2 Token
RCURLY) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn42
		 (forall vn. [(Name, TypeExp vn)] -> SrcLoc -> TypeExp vn
TERecord [] (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_2)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_133 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_133 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_133 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
34# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_133
happyReduction_133 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_133 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LCURLY) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap46
happyOut46 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap46 [(Name, UncheckedTypeExp)]
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RCURLY) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn42
		 (forall vn. [(Name, TypeExp vn)] -> SrcLoc -> TypeExp vn
TERecord [(Name, UncheckedTypeExp)]
happy_var_2 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_134 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_134 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_134 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
34# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_134
happyReduction_134 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_134 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap52
happyOut52 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap52 (QualName Name, Loc)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn42
		 (forall vn. QualName vn -> SrcLoc -> TypeExp vn
TEVar (forall a b. (a, b) -> a
fst (QualName Name, Loc)
happy_var_1) (forall a. Located a => a -> SrcLoc
srclocOf (forall a b. (a, b) -> b
snd (QualName Name, Loc)
happy_var_1))
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_135 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_135 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_135 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
34# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_135
happyReduction_135 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_135 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap38
happyOut38 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap38 UncheckedTypeExp
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedTypeExp -> HappyAbsSyn t102 t103 t104 t105
happyIn42
		 (UncheckedTypeExp
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_136 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_136 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_136 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
35# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_136
happyReduction_136 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_136 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn43
		 (let L Loc
_ (CONSTRUCTOR Name
c) = L Token
happy_var_1 in (Name
c, forall a. Located a => a -> Loc
locOf L Token
happy_var_1)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_137 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_137 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_137 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
36# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_137
happyReduction_137 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_137 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LBRACKET) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap48
happyOut48 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap48 SizeExp Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RBRACKET) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
TypeArgExp Name -> HappyAbsSyn t102 t103 t104 t105
happyIn44
		 (forall vn. SizeExp vn -> SrcLoc -> TypeArgExp vn
TypeArgExpDim SizeExp Name
happy_var_2 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_138 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_138 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_138 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
36# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_138
happyReduction_138 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_138 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap42
happyOut42 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap42 UncheckedTypeExp
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
TypeArgExp Name -> HappyAbsSyn t102 t103 t104 t105
happyIn44
		 (forall vn. TypeExp vn -> TypeArgExp vn
TypeArgExpType UncheckedTypeExp
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_139 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_139 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_139 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
37# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_139
happyReduction_139 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_139 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap92
happyOut92 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap92 (Name, Loc)
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap35
happyOut35 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap35 UncheckedTypeExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, UncheckedTypeExp) -> HappyAbsSyn t102 t103 t104 t105
happyIn45
		 ((forall a b. (a, b) -> a
fst (Name, Loc)
happy_var_1, UncheckedTypeExp
happy_var_3)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_140 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_140 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_140 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
38# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_140
happyReduction_140 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_140 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap45
happyOut45 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap45 (Name, UncheckedTypeExp)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[(Name, UncheckedTypeExp)] -> HappyAbsSyn t102 t103 t104 t105
happyIn46
		 ([(Name, UncheckedTypeExp)
happy_var_1]
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_141 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_141 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_141 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
38# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_141
happyReduction_141 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_141 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap45
happyOut45 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap45 (Name, UncheckedTypeExp)
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap46
happyOut46 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap46 [(Name, UncheckedTypeExp)]
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[(Name, UncheckedTypeExp)] -> HappyAbsSyn t102 t103 t104 t105
happyIn46
		 ((Name, UncheckedTypeExp)
happy_var_1 forall a. a -> [a] -> [a]
: [(Name, UncheckedTypeExp)]
happy_var_3
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_142 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_142 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_142 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
39# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_142
happyReduction_142 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_142 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap35
happyOut35 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap35 UncheckedTypeExp
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[UncheckedTypeExp] -> HappyAbsSyn t102 t103 t104 t105
happyIn47
		 ([UncheckedTypeExp
happy_var_1]
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_143 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_143 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_143 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
39# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_143
happyReduction_143 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_143 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap35
happyOut35 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap35 UncheckedTypeExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap47
happyOut47 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap47 [UncheckedTypeExp]
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[UncheckedTypeExp] -> HappyAbsSyn t102 t103 t104 t105
happyIn47
		 (UncheckedTypeExp
happy_var_1 forall a. a -> [a] -> [a]
: [UncheckedTypeExp]
happy_var_3
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_144 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_144 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_144 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
40# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_144
happyReduction_144 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_144 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap52
happyOut52 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap52 (QualName Name, Loc)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
SizeExp Name -> HappyAbsSyn t102 t103 t104 t105
happyIn48
		 (forall vn. QualName vn -> SrcLoc -> SizeExp vn
SizeExpNamed (forall a b. (a, b) -> a
fst (QualName Name, Loc)
happy_var_1) (forall a. Located a => a -> SrcLoc
srclocOf (forall a b. (a, b) -> b
snd (QualName Name, Loc)
happy_var_1))
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_145 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_145 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_145 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
40# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_145
happyReduction_145 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_145 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
SizeExp Name -> HappyAbsSyn t102 t103 t104 t105
happyIn48
		 (let L Loc
loc (INTLIT Integer
n) = L Token
happy_var_1
            in forall vn. Int -> SrcLoc -> SizeExp vn
SizeExpConst (forall a b. (Integral a, Num b) => a -> b
fromIntegral Integer
n) (forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_146 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_146 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_146 = Int#
-> HappyAbsSyn
     (Maybe UncheckedSigExp)
     (Maybe UncheckedSigExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
40# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
happyReduction_146
happyReduction_146 :: HappyAbsSyn t102 t103 t104 t105
happyReduction_146  =  forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
SizeExp Name -> HappyAbsSyn t102 t103 t104 t105
happyIn48
		 (forall vn. SizeExp vn
SizeExpAny
	)

#if __GLASGOW_HASKELL__ >= 710
happyReduce_147 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_147 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_147 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
41# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_147
happyReduction_147 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_147 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap95
happyOut95 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap95 PatBase NoInfo Name
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn49
		 (PatBase NoInfo Name
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_148 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_148 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_148 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
42# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_148
happyReduction_148 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_148 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap49
happyOut49 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap49 PatBase NoInfo Name
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PatBase NoInfo Name, [PatBase NoInfo Name])
-> HappyAbsSyn t102 t103 t104 t105
happyIn50
		 ((PatBase NoInfo Name
happy_var_1, [])
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_149 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_149 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_149 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
42# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_149
happyReduction_149 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_149 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap49
happyOut49 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap49 PatBase NoInfo Name
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap50
happyOut50 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap50 (PatBase NoInfo Name, [PatBase NoInfo Name])
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PatBase NoInfo Name, [PatBase NoInfo Name])
-> HappyAbsSyn t102 t103 t104 t105
happyIn50
		 ((PatBase NoInfo Name
happy_var_1, forall a b. (a, b) -> a
fst (PatBase NoInfo Name, [PatBase NoInfo Name])
happy_var_2 forall a. a -> [a] -> [a]
: forall a b. (a, b) -> b
snd (PatBase NoInfo Name, [PatBase NoInfo Name])
happy_var_2)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_150 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_150 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_150 = Int#
-> HappyAbsSyn
     (Maybe UncheckedSigExp)
     (Maybe UncheckedSigExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
43# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
happyReduction_150
happyReduction_150 :: HappyAbsSyn t102 t103 t104 t105
happyReduction_150  =  forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[PatBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn51
		 ([]
	)

#if __GLASGOW_HASKELL__ >= 710
happyReduce_151 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_151 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_151 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
43# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_151
happyReduction_151 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_151 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap49
happyOut49 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap49 PatBase NoInfo Name
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap51
happyOut51 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap51 [PatBase NoInfo Name]
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[PatBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn51
		 (PatBase NoInfo Name
happy_var_1 forall a. a -> [a] -> [a]
: [PatBase NoInfo Name]
happy_var_2
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_152 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_152 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_152 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
44# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_152
happyReduction_152 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_152 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap62
happyOut62 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap62 [(Name, Loc)]
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(QualName Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn52
		 (let L Loc
vloc (ID Name
v) = L Token
happy_var_1 in
              forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl (\(QualName [Name]
qs Name
v', Loc
loc) (Name
y, Loc
yloc) ->
                      (forall vn. [vn] -> vn -> QualName vn
QualName ([Name]
qs forall a. [a] -> [a] -> [a]
++ [Name
v']) Name
y, forall a. Located a => a -> Loc
locOf (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
loc Loc
yloc)))
                    (forall v. v -> QualName v
qualName Name
v, forall a. Located a => a -> Loc
locOf Loc
vloc) [(Name, Loc)]
happy_var_2
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_153 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_153 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_153 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
45# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_153
happyReduction_153 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_153 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap53 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap35
happyOut35 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap35 UncheckedTypeExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn53
		 (forall (f :: * -> *) vn.
ExpBase f vn -> TypeExp vn -> SrcLoc -> ExpBase f vn
Ascript UncheckedExp
happy_var_1 UncheckedTypeExp
happy_var_3 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedTypeExp
happy_var_3)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_154 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_154 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_154 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
45# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_154
happyReduction_154 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_154 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap53 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap35
happyOut35 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap35 UncheckedTypeExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn53
		 (forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (forall (f :: * -> *) vn.
ExpBase f vn -> TypeExp vn -> SrcLoc -> AppExpBase f vn
Coerce UncheckedExp
happy_var_1 UncheckedTypeExp
happy_var_3 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedTypeExp
happy_var_3)) forall {k} (a :: k). NoInfo a
NoInfo
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_155 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_155 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_155 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
45# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_155
happyReduction_155 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_155 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn53
		 (UncheckedExp
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_156 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_156 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_156 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
46# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_156
happyReduction_156 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_156 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap72
happyOut72 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap72 UncheckedExp
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn54
		 (UncheckedExp
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_157 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_157 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_157 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
46# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_157
happyReduction_157 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_157 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap73
happyOut73 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap73 UncheckedExp
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn54
		 (UncheckedExp
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_158 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_158 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_158 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
46# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_158
happyReduction_158 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_158 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap67
happyOut67 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap67 UncheckedExp
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn54
		 (UncheckedExp
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_159 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_159 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_159 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
46# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_159
happyReduction_159 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_159 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap74
happyOut74 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap74 UncheckedExp
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn54
		 (UncheckedExp
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_160 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_160 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_160 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
46# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_160
happyReduction_160 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_160 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
ASSERT) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap56
happyOut56 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap56 UncheckedExp
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap56
happyOut56 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap56 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn54
		 (forall (f :: * -> *) vn.
ExpBase f vn -> ExpBase f vn -> f Text -> SrcLoc -> ExpBase f vn
Assert UncheckedExp
happy_var_2 UncheckedExp
happy_var_3 forall {k} (a :: k). NoInfo a
NoInfo (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_3)
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_161 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_161 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_161 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
46# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_161
happyReduction_161 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_161 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
HASH_LBRACKET) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap100
happyOut100 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap100 AttrInfo Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap53 UncheckedExp
happy_var_4) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn54
		 (forall (f :: * -> *) vn.
AttrInfo vn -> ExpBase f vn -> SrcLoc -> ExpBase f vn
Attr AttrInfo Name
happy_var_2 UncheckedExp
happy_var_4 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_4)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_162 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_162 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_162 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
46# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_162
happyReduction_162 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_162 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap69
happyOut69 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap69 UncheckedExp
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn54
		 (UncheckedExp
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_163 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_163 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_163 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
46# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_163
happyReduction_163 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_163 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap71
happyOut71 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap71 UncheckedExp
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn54
		 (UncheckedExp
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_164 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_164 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_164 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
3# Int#
46# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> p -> ParserMonad (HappyAbsSyn t102 t103 t104 t105)
happyReduction_164
happyReduction_164 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> p -> ParserMonad (HappyAbsSyn t102 t103 t104 t105)
happyReduction_164 (HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest) p
tk
	 = forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ((case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (L Loc
happy_var_2 Token
TWO_DOTS) -> 
	( forall a. Loc -> ParserMonad a
twoDotsRange Loc
happy_var_2)})
	) (\UncheckedExp
r -> forall a. a -> ParserMonad a
happyReturn (forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn54 UncheckedExp
r))

#if __GLASGOW_HASKELL__ >= 710
happyReduce_165 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_165 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_165 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
3# Int#
46# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> p -> ParserMonad (HappyAbsSyn t102 t103 t104 t105)
happyReduction_165
happyReduction_165 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> p -> ParserMonad (HappyAbsSyn t102 t103 t104 t105)
happyReduction_165 (HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest) p
tk
	 = forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ((case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (L Loc
happy_var_2 Token
TWO_DOTS) -> 
	( forall a. Loc -> ParserMonad a
twoDotsRange Loc
happy_var_2)})
	) (\UncheckedExp
r -> forall a. a -> ParserMonad a
happyReturn (forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn54 UncheckedExp
r))

#if __GLASGOW_HASKELL__ >= 710
happyReduce_166 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_166 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_166 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
46# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_166
happyReduction_166 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_166 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
NEGATE) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap54 UncheckedExp
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn54
		 (forall (f :: * -> *) vn. ExpBase f vn -> SrcLoc -> ExpBase f vn
Negate UncheckedExp
happy_var_2 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_2)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_167 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_167 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_167 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
46# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_167
happyReduction_167 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_167 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
BANG) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap54 UncheckedExp
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn54
		 (forall (f :: * -> *) vn. ExpBase f vn -> SrcLoc -> ExpBase f vn
Not UncheckedExp
happy_var_2 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_2)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_168 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_168 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_168 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
7# Int#
46# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_168
happyReduction_168 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_168 (HappyAbsSyn t102 t103 t104 t105
happy_x_7 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_6 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap89
happyOut89 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap89 UncheckedSlice
happy_var_4) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_7 of { (HappyWrap54 UncheckedExp
happy_var_7) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn54
		 (forall (f :: * -> *) vn.
ExpBase f vn
-> SliceBase f vn -> ExpBase f vn -> SrcLoc -> ExpBase f vn
Update UncheckedExp
happy_var_1 UncheckedSlice
happy_var_4 UncheckedExp
happy_var_7 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedExp
happy_var_7)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_169 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_169 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_169 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
46# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_169
happyReduction_169 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_169 (HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap63
happyOut63 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap63 [(Name, Loc)]
happy_var_3) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_5 of { (HappyWrap54 UncheckedExp
happy_var_5) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn54
		 (forall (f :: * -> *) vn.
ExpBase f vn
-> [Name] -> ExpBase f vn -> f PatType -> SrcLoc -> ExpBase f vn
RecordUpdate UncheckedExp
happy_var_1 (forall a b. (a -> b) -> [a] -> [b]
map forall a b. (a, b) -> a
fst [(Name, Loc)]
happy_var_3) UncheckedExp
happy_var_5 forall {k} (a :: k). NoInfo a
NoInfo (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedExp
happy_var_5)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_170 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_170 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_170 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
46# forall {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 (Maybe UncheckedTypeExp))
-> HappyStk (HappyAbsSyn t102 t103 t104 (Maybe UncheckedTypeExp))
happyReduction_170
happyReduction_170 :: HappyStk (HappyAbsSyn t102 t103 t104 (Maybe UncheckedTypeExp))
-> HappyStk (HappyAbsSyn t102 t103 t104 (Maybe UncheckedTypeExp))
happyReduction_170 (HappyAbsSyn t102 t103 t104 (Maybe UncheckedTypeExp)
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 (Maybe UncheckedTypeExp)
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 (Maybe UncheckedTypeExp)
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 (Maybe UncheckedTypeExp)
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 (Maybe UncheckedTypeExp)
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 (Maybe UncheckedTypeExp))
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 (Maybe UncheckedTypeExp)
happy_x_1 of { (L Loc
happy_var_1 Token
BACKSLASH) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap50
happyOut50 HappyAbsSyn t102 t103 t104 (Maybe UncheckedTypeExp)
happy_x_2 of { (HappyWrap50 (PatBase NoInfo Name, [PatBase NoInfo Name])
happy_var_2) -> 
	case forall {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k) t105.
HappyAbsSyn t102 t103 t104 t105 -> t105
happyOut105 HappyAbsSyn t102 t103 t104 (Maybe UncheckedTypeExp)
happy_x_3 of { Maybe UncheckedTypeExp
happy_var_3 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 (Maybe UncheckedTypeExp)
happy_x_5 of { (HappyWrap53 UncheckedExp
happy_var_5) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn54
		 (forall (f :: * -> *) vn.
[PatBase f vn]
-> ExpBase f vn
-> Maybe (TypeExp vn)
-> f (Aliasing, StructRetType)
-> SrcLoc
-> ExpBase f vn
Lambda (forall a b. (a, b) -> a
fst (PatBase NoInfo Name, [PatBase NoInfo Name])
happy_var_2 forall a. a -> [a] -> [a]
: forall a b. (a, b) -> b
snd (PatBase NoInfo Name, [PatBase NoInfo Name])
happy_var_2) UncheckedExp
happy_var_5 Maybe UncheckedTypeExp
happy_var_3 forall {k} (a :: k). NoInfo a
NoInfo (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_5)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 (Maybe UncheckedTypeExp))
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_171 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_171 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_171 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
1# Int#
46# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> p -> ParserMonad (HappyAbsSyn t102 t103 t104 t105)
happyReduction_171
happyReduction_171 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> p -> ParserMonad (HappyAbsSyn t102 t103 t104 t105)
happyReduction_171 (HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest) p
tk
	 = forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ((case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap55
happyOut55 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap55 [UncheckedExp]
happy_var_1) -> 
	( [UncheckedExp] -> ParserMonad UncheckedExp
applyExp [UncheckedExp]
happy_var_1)})
	) (\UncheckedExp
r -> forall a. a -> ParserMonad a
happyReturn (forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn54 UncheckedExp
r))

#if __GLASGOW_HASKELL__ >= 710
happyReduce_172 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_172 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_172 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
47# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_172
happyReduction_172 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_172 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap55
happyOut55 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap55 [UncheckedExp]
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap56
happyOut56 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap56 UncheckedExp
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[UncheckedExp] -> HappyAbsSyn t102 t103 t104 t105
happyIn55
		 ([UncheckedExp]
happy_var_1 forall a. [a] -> [a] -> [a]
++ [UncheckedExp
happy_var_2]
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_173 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_173 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_173 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
47# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_173
happyReduction_173 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_173 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap56
happyOut56 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap56 UncheckedExp
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[UncheckedExp] -> HappyAbsSyn t102 t103 t104 t105
happyIn55
		 ([UncheckedExp
happy_var_1]
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_174 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_174 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_174 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
48# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_174
happyReduction_174 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_174 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap58
happyOut58 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap58 (PrimValue, Loc)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn56
		 (forall (f :: * -> *) vn. PrimValue -> SrcLoc -> ExpBase f vn
Literal (forall a b. (a, b) -> a
fst (PrimValue, Loc)
happy_var_1) (forall a. Located a => a -> SrcLoc
srclocOf (forall a b. (a, b) -> b
snd (PrimValue, Loc)
happy_var_1))
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_175 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_175 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_175 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
48# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_175
happyReduction_175 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_175 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap43
happyOut43 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap43 (Name, Loc)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn56
		 (forall (f :: * -> *) vn.
Name -> [ExpBase f vn] -> f PatType -> SrcLoc -> ExpBase f vn
Constr (forall a b. (a, b) -> a
fst (Name, Loc)
happy_var_1) [] forall {k} (a :: k). NoInfo a
NoInfo (forall a. Located a => a -> SrcLoc
srclocOf (forall a b. (a, b) -> b
snd (Name, Loc)
happy_var_1))
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_176 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_176 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_176 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
48# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_176
happyReduction_176 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_176 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn56
		 (let L Loc
loc (CHARLIT Char
x) = L Token
happy_var_1
                        in forall (f :: * -> *) vn.
Integer -> f PatType -> SrcLoc -> ExpBase f vn
IntLit (forall a. Integral a => a -> Integer
toInteger (Char -> Int
ord Char
x)) forall {k} (a :: k). NoInfo a
NoInfo (forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_177 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_177 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_177 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
48# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_177
happyReduction_177 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_177 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn56
		 (let L Loc
loc (INTLIT Integer
x) = L Token
happy_var_1 in forall (f :: * -> *) vn.
Integer -> f PatType -> SrcLoc -> ExpBase f vn
IntLit Integer
x forall {k} (a :: k). NoInfo a
NoInfo (forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_178 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_178 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_178 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
48# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_178
happyReduction_178 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_178 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn56
		 (let L Loc
loc (FLOATLIT Double
x) = L Token
happy_var_1 in forall (f :: * -> *) vn.
Double -> f PatType -> SrcLoc -> ExpBase f vn
FloatLit Double
x forall {k} (a :: k). NoInfo a
NoInfo (forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_179 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_179 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_179 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
48# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_179
happyReduction_179 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_179 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn56
		 (let L Loc
loc (STRINGLIT Text
s) = L Token
happy_var_1 in
                        forall (f :: * -> *) vn. [Word8] -> SrcLoc -> ExpBase f vn
StringLit (ByteString -> [Word8]
BS.unpack (Text -> ByteString
T.encodeUtf8 Text
s)) (forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_180 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_180 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_180 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
48# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_180
happyReduction_180 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_180 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
HOLE) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn56
		 (forall (f :: * -> *) vn. f PatType -> SrcLoc -> ExpBase f vn
Hole forall {k} (a :: k). NoInfo a
NoInfo (forall a. Located a => a -> SrcLoc
srclocOf Loc
happy_var_1)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_181 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_181 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_181 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
48# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_181
happyReduction_181 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_181 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap53 UncheckedExp
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap62
happyOut62 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap62 [(Name, Loc)]
happy_var_4) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn56
		 (forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl (\UncheckedExp
x (Name
y, Loc
_) -> forall (f :: * -> *) vn.
Name -> ExpBase f vn -> f PatType -> SrcLoc -> ExpBase f vn
Project Name
y UncheckedExp
x forall {k} (a :: k). NoInfo a
NoInfo (forall a. Located a => a -> SrcLoc
srclocOf UncheckedExp
x))
               (forall (f :: * -> *) vn. ExpBase f vn -> SrcLoc -> ExpBase f vn
Parens UncheckedExp
happy_var_2 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 (Loc
happy_var_3forall a. a -> [a] -> [a]
:forall a b. (a -> b) -> [a] -> [b]
map forall a b. (a, b) -> b
snd [(Name, Loc)]
happy_var_4)))
               [(Name, Loc)]
happy_var_4
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_182 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_182 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_182 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
48# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_182
happyReduction_182 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_182 (HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap53 UncheckedExp
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap89
happyOut89 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap89 UncheckedSlice
happy_var_4) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_5 of { (L Loc
happy_var_5 Token
RBRACKET) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn56
		 (forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (forall (f :: * -> *) vn.
ExpBase f vn -> SliceBase f vn -> SrcLoc -> AppExpBase f vn
Index (forall (f :: * -> *) vn. ExpBase f vn -> SrcLoc -> ExpBase f vn
Parens UncheckedExp
happy_var_2 (forall a. Located a => a -> SrcLoc
srclocOf Loc
happy_var_1)) UncheckedSlice
happy_var_4 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_5)) forall {k} (a :: k). NoInfo a
NoInfo
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_183 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_183 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_183 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
48# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_183
happyReduction_183 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_183 (HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap53 UncheckedExp
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap59
happyOut59 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap59 (UncheckedExp, [UncheckedExp])
happy_var_4) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_5 of { (L Loc
happy_var_5 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn56
		 (forall (f :: * -> *) vn. [ExpBase f vn] -> SrcLoc -> ExpBase f vn
TupLit (UncheckedExp
happy_var_2 forall a. a -> [a] -> [a]
: forall a b. (a, b) -> a
fst (UncheckedExp, [UncheckedExp])
happy_var_4 forall a. a -> [a] -> [a]
: forall a b. (a, b) -> b
snd (UncheckedExp, [UncheckedExp])
happy_var_4) (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_5)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_184 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_184 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_184 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
48# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_184
happyReduction_184 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_184 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (L Loc
happy_var_2 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn56
		 (forall (f :: * -> *) vn. [ExpBase f vn] -> SrcLoc -> ExpBase f vn
TupLit [] (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_2)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_185 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_185 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_185 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
48# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_185
happyReduction_185 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_185 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LBRACKET) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap59
happyOut59 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap59 (UncheckedExp, [UncheckedExp])
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RBRACKET) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn56
		 (forall (f :: * -> *) vn.
[ExpBase f vn] -> f PatType -> SrcLoc -> ExpBase f vn
ArrayLit (forall a b. (a, b) -> a
fst (UncheckedExp, [UncheckedExp])
happy_var_2forall a. a -> [a] -> [a]
:forall a b. (a, b) -> b
snd (UncheckedExp, [UncheckedExp])
happy_var_2) forall {k} (a :: k). NoInfo a
NoInfo (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_186 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_186 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_186 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
48# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_186
happyReduction_186 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_186 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LBRACKET) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (L Loc
happy_var_2 Token
RBRACKET) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn56
		 (forall (f :: * -> *) vn.
[ExpBase f vn] -> f PatType -> SrcLoc -> ExpBase f vn
ArrayLit [] forall {k} (a :: k). NoInfo a
NoInfo (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_2)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_187 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_187 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_187 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
48# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_187
happyReduction_187 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_187 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap87
happyOut87 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap87 ((QualName Name, Loc), UncheckedSlice, Loc)
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap62
happyOut62 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap62 [(Name, Loc)]
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn56
		 (let ((QualName Name
v, Loc
vloc),UncheckedSlice
slice,Loc
loc) = ((QualName Name, Loc), UncheckedSlice, Loc)
happy_var_1
         in forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl (\UncheckedExp
x (Name
y, Loc
_) -> forall (f :: * -> *) vn.
Name -> ExpBase f vn -> f PatType -> SrcLoc -> ExpBase f vn
Project Name
y UncheckedExp
x forall {k} (a :: k). NoInfo a
NoInfo (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
x (forall a. Located a => a -> SrcLoc
srclocOf UncheckedExp
x)))
                  (forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (forall (f :: * -> *) vn.
ExpBase f vn -> SliceBase f vn -> SrcLoc -> AppExpBase f vn
Index (forall (f :: * -> *) vn.
QualName vn -> f PatType -> SrcLoc -> ExpBase f vn
Var QualName Name
v forall {k} (a :: k). NoInfo a
NoInfo (forall a. Located a => a -> SrcLoc
srclocOf Loc
vloc)) UncheckedSlice
slice (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
vloc Loc
loc)) forall {k} (a :: k). NoInfo a
NoInfo)
                  [(Name, Loc)]
happy_var_2
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_188 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_188 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_188 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
48# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_188
happyReduction_188 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_188 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap52
happyOut52 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap52 (QualName Name, Loc)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn56
		 (forall (f :: * -> *) vn.
QualName vn -> f PatType -> SrcLoc -> ExpBase f vn
Var (forall a b. (a, b) -> a
fst (QualName Name, Loc)
happy_var_1) forall {k} (a :: k). NoInfo a
NoInfo (forall a. Located a => a -> SrcLoc
srclocOf (forall a b. (a, b) -> b
snd (QualName Name, Loc)
happy_var_1))
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_189 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_189 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_189 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
48# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_189
happyReduction_189 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_189 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LCURLY) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap65
happyOut65 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap65 [FieldBase NoInfo Name]
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RCURLY) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn56
		 (forall (f :: * -> *) vn. [FieldBase f vn] -> SrcLoc -> ExpBase f vn
RecordLit [FieldBase NoInfo Name]
happy_var_2 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_190 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_190 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_190 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
48# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_190
happyReduction_190 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_190 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap53 UncheckedExp
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn56
		 (let L Loc
loc (QUALPAREN [Name]
qs Name
name) = L Token
happy_var_1 in
         forall (f :: * -> *) vn.
(QualName vn, SrcLoc) -> ExpBase f vn -> SrcLoc -> ExpBase f vn
QualParens (forall vn. [vn] -> vn -> QualName vn
QualName [Name]
qs Name
name, forall a. Located a => a -> SrcLoc
srclocOf Loc
loc) UncheckedExp
happy_var_2 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan L Token
happy_var_1 Loc
happy_var_3)
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_191 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_191 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_191 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
48# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_191
happyReduction_191 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_191 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap70
happyOut70 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap70 UncheckedExp
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn56
		 (UncheckedExp
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_192 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_192 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_192 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
49# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_192
happyReduction_192 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_192 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PrimValue, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn57
		 (let L Loc
loc (I8LIT Int8
num)  = L Token
happy_var_1 in (IntValue -> PrimValue
SignedValue forall a b. (a -> b) -> a -> b
$ Int8 -> IntValue
Int8Value Int8
num, Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_193 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_193 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_193 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
49# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_193
happyReduction_193 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_193 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PrimValue, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn57
		 (let L Loc
loc (I16LIT Int16
num) = L Token
happy_var_1 in (IntValue -> PrimValue
SignedValue forall a b. (a -> b) -> a -> b
$ Int16 -> IntValue
Int16Value Int16
num, Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_194 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_194 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_194 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
49# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_194
happyReduction_194 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_194 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PrimValue, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn57
		 (let L Loc
loc (I32LIT Int32
num) = L Token
happy_var_1 in (IntValue -> PrimValue
SignedValue forall a b. (a -> b) -> a -> b
$ Int32 -> IntValue
Int32Value Int32
num, Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_195 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_195 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_195 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
49# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_195
happyReduction_195 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_195 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PrimValue, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn57
		 (let L Loc
loc (I64LIT Int64
num) = L Token
happy_var_1 in (IntValue -> PrimValue
SignedValue forall a b. (a -> b) -> a -> b
$ Int64 -> IntValue
Int64Value Int64
num, Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_196 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_196 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_196 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
49# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_196
happyReduction_196 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_196 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PrimValue, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn57
		 (let L Loc
loc (U8LIT Word8
num)  = L Token
happy_var_1 in (IntValue -> PrimValue
UnsignedValue forall a b. (a -> b) -> a -> b
$ Int8 -> IntValue
Int8Value forall a b. (a -> b) -> a -> b
$ forall a b. (Integral a, Num b) => a -> b
fromIntegral Word8
num, Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_197 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_197 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_197 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
49# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_197
happyReduction_197 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_197 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PrimValue, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn57
		 (let L Loc
loc (U16LIT Word16
num) = L Token
happy_var_1 in (IntValue -> PrimValue
UnsignedValue forall a b. (a -> b) -> a -> b
$ Int16 -> IntValue
Int16Value forall a b. (a -> b) -> a -> b
$ forall a b. (Integral a, Num b) => a -> b
fromIntegral Word16
num, Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_198 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_198 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_198 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
49# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_198
happyReduction_198 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_198 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PrimValue, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn57
		 (let L Loc
loc (U32LIT Word32
num) = L Token
happy_var_1 in (IntValue -> PrimValue
UnsignedValue forall a b. (a -> b) -> a -> b
$ Int32 -> IntValue
Int32Value forall a b. (a -> b) -> a -> b
$ forall a b. (Integral a, Num b) => a -> b
fromIntegral Word32
num, Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_199 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_199 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_199 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
49# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_199
happyReduction_199 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_199 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PrimValue, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn57
		 (let L Loc
loc (U64LIT Word64
num) = L Token
happy_var_1 in (IntValue -> PrimValue
UnsignedValue forall a b. (a -> b) -> a -> b
$ Int64 -> IntValue
Int64Value forall a b. (a -> b) -> a -> b
$ forall a b. (Integral a, Num b) => a -> b
fromIntegral Word64
num, Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_200 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_200 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_200 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
49# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_200
happyReduction_200 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_200 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PrimValue, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn57
		 (let L Loc
loc (F16LIT Half
num) = L Token
happy_var_1 in (FloatValue -> PrimValue
FloatValue forall a b. (a -> b) -> a -> b
$ Half -> FloatValue
Float16Value Half
num, Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_201 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_201 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_201 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
49# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_201
happyReduction_201 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_201 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PrimValue, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn57
		 (let L Loc
loc (F32LIT Float
num) = L Token
happy_var_1 in (FloatValue -> PrimValue
FloatValue forall a b. (a -> b) -> a -> b
$ Float -> FloatValue
Float32Value Float
num, Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_202 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_202 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_202 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
49# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_202
happyReduction_202 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_202 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PrimValue, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn57
		 (let L Loc
loc (F64LIT Double
num) = L Token
happy_var_1 in (FloatValue -> PrimValue
FloatValue forall a b. (a -> b) -> a -> b
$ Double -> FloatValue
Float64Value Double
num, Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_203 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_203 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_203 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
50# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_203
happyReduction_203 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_203 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
TRUE) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PrimValue, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn58
		 ((Bool -> PrimValue
BoolValue Bool
True, Loc
happy_var_1)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_204 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_204 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_204 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
50# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_204
happyReduction_204 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_204 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
FALSE) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PrimValue, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn58
		 ((Bool -> PrimValue
BoolValue Bool
False, Loc
happy_var_1)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_205 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_205 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_205 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
50# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_205
happyReduction_205 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_205 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap57
happyOut57 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap57 (PrimValue, Loc)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PrimValue, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn58
		 ((PrimValue, Loc)
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_206 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_206 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_206 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
51# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_206
happyReduction_206 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_206 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap60
happyOut60 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap60 ([UncheckedExp], UncheckedExp)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(UncheckedExp, [UncheckedExp]) -> HappyAbsSyn t102 t103 t104 t105
happyIn59
		 (case forall a. [a] -> [a]
reverse (forall a b. (a, b) -> b
snd ([UncheckedExp], UncheckedExp)
happy_var_1 forall a. a -> [a] -> [a]
: forall a b. (a, b) -> a
fst ([UncheckedExp], UncheckedExp)
happy_var_1) of
                    []   -> (forall a b. (a, b) -> b
snd ([UncheckedExp], UncheckedExp)
happy_var_1, [])
                    UncheckedExp
y:[UncheckedExp]
ys -> (UncheckedExp
y, [UncheckedExp]
ys)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_207 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_207 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_207 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
52# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_207
happyReduction_207 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_207 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap60
happyOut60 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap60 ([UncheckedExp], UncheckedExp)
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap53 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
([UncheckedExp], UncheckedExp) -> HappyAbsSyn t102 t103 t104 t105
happyIn60
		 ((forall a b. (a, b) -> b
snd ([UncheckedExp], UncheckedExp)
happy_var_1 forall a. a -> [a] -> [a]
: forall a b. (a, b) -> a
fst ([UncheckedExp], UncheckedExp)
happy_var_1, UncheckedExp
happy_var_3)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_208 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_208 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_208 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
52# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_208
happyReduction_208 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_208 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap53 UncheckedExp
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
([UncheckedExp], UncheckedExp) -> HappyAbsSyn t102 t103 t104 t105
happyIn60
		 (([], UncheckedExp
happy_var_1)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_209 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_209 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_209 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
53# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_209
happyReduction_209 :: HappyAbsSyn t102 t103 t104 t105
-> p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_209 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	p
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn61
		 (let L Loc
loc (ID Name
f) = L Token
happy_var_2 in (Name
f, Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_210 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_210 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_210 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
53# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_210
happyReduction_210 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_210 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn61
		 (let L Loc
loc (PROJ_INTFIELD Name
x) = L Token
happy_var_1 in (Name
x, Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_211 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_211 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_211 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
54# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_211
happyReduction_211 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_211 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap61
happyOut61 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap61 (Name, Loc)
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap62
happyOut62 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap62 [(Name, Loc)]
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[(Name, Loc)] -> HappyAbsSyn t102 t103 t104 t105
happyIn62
		 ((Name, Loc)
happy_var_1 forall a. a -> [a] -> [a]
: [(Name, Loc)]
happy_var_2
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_212 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_212 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_212 = Int#
-> HappyAbsSyn
     (Maybe UncheckedSigExp)
     (Maybe UncheckedSigExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
54# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
happyReduction_212
happyReduction_212 :: HappyAbsSyn t102 t103 t104 t105
happyReduction_212  =  forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[(Name, Loc)] -> HappyAbsSyn t102 t103 t104 t105
happyIn62
		 ([]
	)

#if __GLASGOW_HASKELL__ >= 710
happyReduce_213 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_213 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_213 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
55# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_213
happyReduction_213 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_213 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap92
happyOut92 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap92 (Name, Loc)
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap62
happyOut62 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap62 [(Name, Loc)]
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[(Name, Loc)] -> HappyAbsSyn t102 t103 t104 t105
happyIn63
		 ((forall a b. (a, b) -> a
fst (Name, Loc)
happy_var_1, forall a b. (a, b) -> b
snd (Name, Loc)
happy_var_1) forall a. a -> [a] -> [a]
: [(Name, Loc)]
happy_var_2
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_214 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_214 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_214 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
56# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_214
happyReduction_214 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_214 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap92
happyOut92 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap92 (Name, Loc)
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap53 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
FieldBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn64
		 (forall (f :: * -> *) vn.
Name -> ExpBase f vn -> SrcLoc -> FieldBase f vn
RecordFieldExplicit (forall a b. (a, b) -> a
fst (Name, Loc)
happy_var_1) UncheckedExp
happy_var_3 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan (forall a b. (a, b) -> b
snd (Name, Loc)
happy_var_1) UncheckedExp
happy_var_3)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_215 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_215 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_215 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
56# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_215
happyReduction_215 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_215 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
FieldBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn64
		 (let L Loc
loc (ID Name
s) = L Token
happy_var_1 in forall (f :: * -> *) vn.
vn -> f PatType -> SrcLoc -> FieldBase f vn
RecordFieldImplicit Name
s forall {k} (a :: k). NoInfo a
NoInfo (forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_216 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_216 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_216 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
57# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_216
happyReduction_216 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_216 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap66
happyOut66 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap66 [FieldBase NoInfo Name]
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[FieldBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn65
		 ([FieldBase NoInfo Name]
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_217 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_217 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_217 = Int#
-> HappyAbsSyn
     (Maybe UncheckedSigExp)
     (Maybe UncheckedSigExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
57# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
happyReduction_217
happyReduction_217 :: HappyAbsSyn t102 t103 t104 t105
happyReduction_217  =  forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[FieldBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn65
		 ([]
	)

#if __GLASGOW_HASKELL__ >= 710
happyReduce_218 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_218 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_218 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
58# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_218
happyReduction_218 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_218 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap64
happyOut64 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap64 FieldBase NoInfo Name
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap66
happyOut66 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap66 [FieldBase NoInfo Name]
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[FieldBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn66
		 (FieldBase NoInfo Name
happy_var_1 forall a. a -> [a] -> [a]
: [FieldBase NoInfo Name]
happy_var_3
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_219 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_219 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_219 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
58# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_219
happyReduction_219 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_219 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap64
happyOut64 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap64 FieldBase NoInfo Name
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[FieldBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn66
		 ([FieldBase NoInfo Name
happy_var_1]
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_220 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_220 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_220 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
6# Int#
59# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_220
happyReduction_220 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_220 (HappyAbsSyn t102 t103 t104 t105
happy_x_6 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LET) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap27
happyOut27 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap27 [SizeBinder Name]
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap93
happyOut93 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap93 PatBase NoInfo Name
happy_var_3) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_5 of { (HappyWrap53 UncheckedExp
happy_var_5) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap68
happyOut68 HappyAbsSyn t102 t103 t104 t105
happy_x_6 of { (HappyWrap68 UncheckedExp
happy_var_6) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn67
		 (forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (forall (f :: * -> *) vn.
[SizeBinder vn]
-> PatBase f vn
-> ExpBase f vn
-> ExpBase f vn
-> SrcLoc
-> AppExpBase f vn
LetPat [SizeBinder Name]
happy_var_2 PatBase NoInfo Name
happy_var_3 UncheckedExp
happy_var_5 UncheckedExp
happy_var_6 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_6)) forall {k} (a :: k). NoInfo a
NoInfo
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_221 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_221 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_221 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
59# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_221
happyReduction_221 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_221 (HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LET) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap93
happyOut93 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap93 PatBase NoInfo Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap53 UncheckedExp
happy_var_4) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap68
happyOut68 HappyAbsSyn t102 t103 t104 t105
happy_x_5 of { (HappyWrap68 UncheckedExp
happy_var_5) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn67
		 (forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (forall (f :: * -> *) vn.
[SizeBinder vn]
-> PatBase f vn
-> ExpBase f vn
-> ExpBase f vn
-> SrcLoc
-> AppExpBase f vn
LetPat [] PatBase NoInfo Name
happy_var_2 UncheckedExp
happy_var_4 UncheckedExp
happy_var_5 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_5)) forall {k} (a :: k). NoInfo a
NoInfo
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_222 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_222 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_222 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
8# Int#
59# forall {k} {k} {k} {t102 :: k} {t103 :: k} {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
-> HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyReduction_222
happyReduction_222 :: HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
-> HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyReduction_222 (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_8 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_7 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_6 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_1 of { (L Loc
happy_var_1 Token
LET) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap29
happyOut29 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_3 of { (HappyWrap29 [TypeParamBase Name]
happy_var_3) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap50
happyOut50 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_4 of { (HappyWrap50 (PatBase NoInfo Name, [PatBase NoInfo Name])
happy_var_4) -> 
	case forall {k} {k} {k} (t102 :: k) (t103 :: k) t104 (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> t104
happyOut104 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_5 of { Maybe UncheckedTypeExp
happy_var_5 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_7 of { (HappyWrap53 UncheckedExp
happy_var_7) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap68
happyOut68 HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happy_x_8 of { (HappyWrap68 UncheckedExp
happy_var_8) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn67
		 (let L Loc
_ (ID Name
name) = L Token
happy_var_2
         in forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (forall (f :: * -> *) vn.
vn
-> ([TypeParamBase vn], [PatBase f vn], Maybe (TypeExp vn),
    f StructRetType, ExpBase f vn)
-> ExpBase f vn
-> SrcLoc
-> AppExpBase f vn
LetFun Name
name ([TypeParamBase Name]
happy_var_3, forall a b. (a, b) -> a
fst (PatBase NoInfo Name, [PatBase NoInfo Name])
happy_var_4 forall a. a -> [a] -> [a]
: forall a b. (a, b) -> b
snd (PatBase NoInfo Name, [PatBase NoInfo Name])
happy_var_4, Maybe UncheckedTypeExp
happy_var_5, forall {k} (a :: k). NoInfo a
NoInfo, UncheckedExp
happy_var_7)
                    UncheckedExp
happy_var_8 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_8))
                   forall {k} (a :: k). NoInfo a
NoInfo
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105)
happyRest}}}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_223 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_223 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_223 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
59# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_223
happyReduction_223 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_223 (HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LET) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap86
happyOut86 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap86 ((Name, Loc), UncheckedSlice, Loc)
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap53 UncheckedExp
happy_var_4) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap68
happyOut68 HappyAbsSyn t102 t103 t104 t105
happy_x_5 of { (HappyWrap68 UncheckedExp
happy_var_5) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn67
		 (let ((Name
v,Loc
_),UncheckedSlice
slice,Loc
loc) = ((Name, Loc), UncheckedSlice, Loc)
happy_var_2; ident :: IdentBase NoInfo Name
ident = forall (f :: * -> *) vn.
vn -> f PatType -> SrcLoc -> IdentBase f vn
Ident Name
v forall {k} (a :: k). NoInfo a
NoInfo (forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
         in forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (forall (f :: * -> *) vn.
IdentBase f vn
-> IdentBase f vn
-> SliceBase f vn
-> ExpBase f vn
-> ExpBase f vn
-> SrcLoc
-> AppExpBase f vn
LetWith IdentBase NoInfo Name
ident IdentBase NoInfo Name
ident UncheckedSlice
slice UncheckedExp
happy_var_4 UncheckedExp
happy_var_5 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_5)) forall {k} (a :: k). NoInfo a
NoInfo
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_224 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_224 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_224 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
60# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_224
happyReduction_224 :: HappyAbsSyn t102 t103 t104 t105
-> p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_224 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	p
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap53 UncheckedExp
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn68
		 (UncheckedExp
happy_var_2
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_225 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_225 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_225 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
60# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_225
happyReduction_225 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_225 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap67
happyOut67 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap67 UncheckedExp
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn68
		 (UncheckedExp
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_226 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_226 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_226 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
1# Int#
60# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> p -> ParserMonad (HappyAbsSyn t102 t103 t104 t105)
happyReduction_226
happyReduction_226 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> p -> ParserMonad (HappyAbsSyn t102 t103 t104 t105)
happyReduction_226 (HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest) p
tk
	 = forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ((case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
DEF) -> 
	( forall loc a. Located loc => loc -> Maybe Text -> ParserMonad a
parseErrorAt Loc
happy_var_1 (forall a. a -> Maybe a
Just Text
"Unexpected \"def\" - missing \"in\"?"))})
	) (\UncheckedExp
r -> forall a. a -> ParserMonad a
happyReturn (forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn68 UncheckedExp
r))

#if __GLASGOW_HASKELL__ >= 710
happyReduce_227 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_227 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_227 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
1# Int#
60# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> p -> ParserMonad (HappyAbsSyn t102 t103 t104 t105)
happyReduction_227
happyReduction_227 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> p -> ParserMonad (HappyAbsSyn t102 t103 t104 t105)
happyReduction_227 (HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest) p
tk
	 = forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ((case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
TYPE) -> 
	( forall loc a. Located loc => loc -> Maybe Text -> ParserMonad a
parseErrorAt Loc
happy_var_1 (forall a. a -> Maybe a
Just Text
"Unexpected \"type\" - missing \"in\"?"))})
	) (\UncheckedExp
r -> forall a. a -> ParserMonad a
happyReturn (forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn68 UncheckedExp
r))

#if __GLASGOW_HASKELL__ >= 710
happyReduce_228 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_228 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_228 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
1# Int#
60# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> p -> ParserMonad (HappyAbsSyn t102 t103 t104 t105)
happyReduction_228
happyReduction_228 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> p -> ParserMonad (HappyAbsSyn t102 t103 t104 t105)
happyReduction_228 (HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest) p
tk
	 = forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ((case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
MODULE) -> 
	( forall loc a. Located loc => loc -> Maybe Text -> ParserMonad a
parseErrorAt Loc
happy_var_1 (forall a. a -> Maybe a
Just Text
"Unexpected \"module\" - missing \"in\"?"))})
	) (\UncheckedExp
r -> forall a. a -> ParserMonad a
happyReturn (forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn68 UncheckedExp
r))

#if __GLASGOW_HASKELL__ >= 710
happyReduce_229 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_229 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_229 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_229
happyReduction_229 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_229 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_230 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_230 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_230 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_230
happyReduction_230 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_230 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_231 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_231 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_231 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_231
happyReduction_231 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_231 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (L Loc
happy_var_2 Token
NEGATE) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 (forall a. Loc -> a -> L a
L Loc
happy_var_2 (BinOp -> [Name] -> Name -> Token
SYMBOL BinOp
Minus [] (String -> Name
nameFromString String
"-"))) UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_232 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_232 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_232 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_232
happyReduction_232 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_232 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_233 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_233 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_233 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_233
happyReduction_233 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_233 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (L Loc
happy_var_2 Token
ASTERISK) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 (forall a. Loc -> a -> L a
L Loc
happy_var_2 (BinOp -> [Name] -> Name -> Token
SYMBOL BinOp
Times [] (String -> Name
nameFromString String
"*"))) UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_234 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_234 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_234 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_234
happyReduction_234 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_234 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_235 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_235 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_235 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_235
happyReduction_235 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_235 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_236 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_236 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_236 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_236
happyReduction_236 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_236 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_237 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_237 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_237 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_237
happyReduction_237 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_237 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_238 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_238 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_238 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_238
happyReduction_238 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_238 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_239 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_239 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_239 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_239
happyReduction_239 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_239 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_240 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_240 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_240 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_240
happyReduction_240 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_240 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_241 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_241 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_241 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_241
happyReduction_241 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_241 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_242 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_242 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_242 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_242
happyReduction_242 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_242 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_243 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_243 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_243 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_243
happyReduction_243 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_243 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (L Loc
happy_var_2 Token
PIPE) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 (forall a. Loc -> a -> L a
L Loc
happy_var_2 (BinOp -> [Name] -> Name -> Token
SYMBOL BinOp
Bor [] (String -> Name
nameFromString String
"|"))) UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_244 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_244 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_244 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_244
happyReduction_244 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_244 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_245 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_245 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_245 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_245
happyReduction_245 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_245 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_246 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_246 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_246 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_246
happyReduction_246 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_246 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_247 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_247 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_247 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_247
happyReduction_247 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_247 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (L Loc
happy_var_2 Token
HAT) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 (forall a. Loc -> a -> L a
L Loc
happy_var_2 (BinOp -> [Name] -> Name -> Token
SYMBOL BinOp
Xor [] (String -> Name
nameFromString String
"^"))) UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_248 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_248 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_248 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_248
happyReduction_248 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_248 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_249 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_249 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_249 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_249
happyReduction_249 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_249 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_250 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_250 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_250 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_250
happyReduction_250 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_250 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_251 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_251 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_251 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_251
happyReduction_251 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_251 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_252 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_252 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_252 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_252
happyReduction_252 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_252 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_253 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_253 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_253 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_253
happyReduction_253 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_253 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_254 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_254 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_254 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_254
happyReduction_254 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_254 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_255 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_255 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_255 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_255
happyReduction_255 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_255 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 L Token
happy_var_2 UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_256 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_256 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_256 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
61# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_256
happyReduction_256 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_256 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (L Loc
happy_var_2 Token
LTH) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (UncheckedExp -> L Token -> UncheckedExp -> UncheckedExp
binOp UncheckedExp
happy_var_1 (forall a. Loc -> a -> L a
L Loc
happy_var_2 (BinOp -> [Name] -> Name -> Token
SYMBOL BinOp
Less [] (String -> Name
nameFromString String
"<"))) UncheckedExp
happy_var_3
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_257 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_257 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_257 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
61# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_257
happyReduction_257 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_257 (HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap52
happyOut52 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap52 (QualName Name, Loc)
happy_var_3) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_5 of { (HappyWrap54 UncheckedExp
happy_var_5) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn69
		 (forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (forall (f :: * -> *) vn.
(QualName vn, SrcLoc)
-> f PatType
-> (ExpBase f vn, f (StructType, Maybe VName))
-> (ExpBase f vn, f (StructType, Maybe VName))
-> SrcLoc
-> AppExpBase f vn
BinOp (forall (p :: * -> * -> *) b c a.
Bifunctor p =>
(b -> c) -> p a b -> p a c
second forall a. Located a => a -> SrcLoc
srclocOf (QualName Name, Loc)
happy_var_3) forall {k} (a :: k). NoInfo a
NoInfo (UncheckedExp
happy_var_1, forall {k} (a :: k). NoInfo a
NoInfo) (UncheckedExp
happy_var_5, forall {k} (a :: k). NoInfo a
NoInfo) (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedExp
happy_var_5)) forall {k} (a :: k). NoInfo a
NoInfo
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_258 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_258 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_258 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
62# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_258
happyReduction_258 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_258 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn70
		 (forall (f :: * -> *) vn.
QualName vn -> f PatType -> SrcLoc -> ExpBase f vn
OpSection (forall v. v -> QualName v
qualName (String -> Name
nameFromString String
"-")) forall {k} (a :: k). NoInfo a
NoInfo (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_259 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_259 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_259 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
62# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_259
happyReduction_259 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_259 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap54 UncheckedExp
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (L Loc
happy_var_4 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn70
		 (forall (f :: * -> *) vn.
QualName vn
-> f PatType
-> ExpBase f vn
-> (f (PName, StructType, Maybe VName), f (PName, StructType))
-> (f PatRetType, f [VName])
-> SrcLoc
-> ExpBase f vn
OpSectionLeft (forall v. v -> QualName v
qualName (String -> Name
nameFromString String
"-"))
      forall {k} (a :: k). NoInfo a
NoInfo UncheckedExp
happy_var_2 (forall {k} (a :: k). NoInfo a
NoInfo, forall {k} (a :: k). NoInfo a
NoInfo) (forall {k} (a :: k). NoInfo a
NoInfo, forall {k} (a :: k). NoInfo a
NoInfo) (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_4)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_260 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_260 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_260 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
62# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_260
happyReduction_260 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_260 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap30
happyOut30 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap30 (QualName Name, Loc)
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (L Loc
happy_var_4 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn70
		 (forall (f :: * -> *) vn.
QualName vn
-> f PatType
-> ExpBase f vn
-> (f (PName, StructType), f (PName, StructType, Maybe VName))
-> f PatRetType
-> SrcLoc
-> ExpBase f vn
OpSectionRight (forall a b. (a, b) -> a
fst (QualName Name, Loc)
happy_var_2) forall {k} (a :: k). NoInfo a
NoInfo UncheckedExp
happy_var_3 (forall {k} (a :: k). NoInfo a
NoInfo, forall {k} (a :: k). NoInfo a
NoInfo) forall {k} (a :: k). NoInfo a
NoInfo (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_4)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_261 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_261 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_261 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
62# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_261
happyReduction_261 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_261 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap54 UncheckedExp
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap30
happyOut30 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap30 (QualName Name, Loc)
happy_var_3) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (L Loc
happy_var_4 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn70
		 (forall (f :: * -> *) vn.
QualName vn
-> f PatType
-> ExpBase f vn
-> (f (PName, StructType, Maybe VName), f (PName, StructType))
-> (f PatRetType, f [VName])
-> SrcLoc
-> ExpBase f vn
OpSectionLeft (forall a b. (a, b) -> a
fst (QualName Name, Loc)
happy_var_3) forall {k} (a :: k). NoInfo a
NoInfo UncheckedExp
happy_var_2 (forall {k} (a :: k). NoInfo a
NoInfo, forall {k} (a :: k). NoInfo a
NoInfo) (forall {k} (a :: k). NoInfo a
NoInfo, forall {k} (a :: k). NoInfo a
NoInfo) (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_4)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_262 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_262 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_262 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
62# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_262
happyReduction_262 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_262 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap30
happyOut30 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap30 (QualName Name, Loc)
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn70
		 (forall (f :: * -> *) vn.
QualName vn -> f PatType -> SrcLoc -> ExpBase f vn
OpSection (forall a b. (a, b) -> a
fst (QualName Name, Loc)
happy_var_2) forall {k} (a :: k). NoInfo a
NoInfo (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_263 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_263 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_263 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
62# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_263
happyReduction_263 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_263 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap61
happyOut61 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap61 (Name, Loc)
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap62
happyOut62 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap62 [(Name, Loc)]
happy_var_3) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (L Loc
happy_var_4 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn70
		 (forall (f :: * -> *) vn.
[Name] -> f PatType -> SrcLoc -> ExpBase f vn
ProjectSection (forall a b. (a -> b) -> [a] -> [b]
map forall a b. (a, b) -> a
fst ((Name, Loc)
happy_var_2forall a. a -> [a] -> [a]
:[(Name, Loc)]
happy_var_3)) forall {k} (a :: k). NoInfo a
NoInfo (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_4)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_264 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_264 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_264 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
6# Int#
62# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_264
happyReduction_264 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_264 (HappyAbsSyn t102 t103 t104 t105
happy_x_6 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap89
happyOut89 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap89 UncheckedSlice
happy_var_4) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_6 of { (L Loc
happy_var_6 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn70
		 (forall (f :: * -> *) vn.
SliceBase f vn -> f PatType -> SrcLoc -> ExpBase f vn
IndexSection UncheckedSlice
happy_var_4 forall {k} (a :: k). NoInfo a
NoInfo (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_6)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_265 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_265 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_265 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
63# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_265
happyReduction_265 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_265 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn71
		 (forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (forall (f :: * -> *) vn.
ExpBase f vn
-> Maybe (ExpBase f vn)
-> Inclusiveness (ExpBase f vn)
-> SrcLoc
-> AppExpBase f vn
Range UncheckedExp
happy_var_1 forall a. Maybe a
Nothing (forall a. a -> Inclusiveness a
ToInclusive UncheckedExp
happy_var_3) (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedExp
happy_var_3)) forall {k} (a :: k). NoInfo a
NoInfo
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_266 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_266 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_266 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
63# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_266
happyReduction_266 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_266 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn71
		 (forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (forall (f :: * -> *) vn.
ExpBase f vn
-> Maybe (ExpBase f vn)
-> Inclusiveness (ExpBase f vn)
-> SrcLoc
-> AppExpBase f vn
Range UncheckedExp
happy_var_1 forall a. Maybe a
Nothing (forall a. a -> Inclusiveness a
UpToExclusive UncheckedExp
happy_var_3) (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedExp
happy_var_3)) forall {k} (a :: k). NoInfo a
NoInfo
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_267 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_267 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_267 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
63# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_267
happyReduction_267 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_267 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn71
		 (forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (forall (f :: * -> *) vn.
ExpBase f vn
-> Maybe (ExpBase f vn)
-> Inclusiveness (ExpBase f vn)
-> SrcLoc
-> AppExpBase f vn
Range UncheckedExp
happy_var_1 forall a. Maybe a
Nothing (forall a. a -> Inclusiveness a
DownToExclusive UncheckedExp
happy_var_3)  (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedExp
happy_var_3)) forall {k} (a :: k). NoInfo a
NoInfo
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_268 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_268 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_268 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
63# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_268
happyReduction_268 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_268 (HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_5 of { (HappyWrap54 UncheckedExp
happy_var_5) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn71
		 (forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (forall (f :: * -> *) vn.
ExpBase f vn
-> Maybe (ExpBase f vn)
-> Inclusiveness (ExpBase f vn)
-> SrcLoc
-> AppExpBase f vn
Range UncheckedExp
happy_var_1 (forall a. a -> Maybe a
Just UncheckedExp
happy_var_3) (forall a. a -> Inclusiveness a
ToInclusive UncheckedExp
happy_var_5) (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedExp
happy_var_5)) forall {k} (a :: k). NoInfo a
NoInfo
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_269 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_269 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_269 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
63# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_269
happyReduction_269 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_269 (HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_5 of { (HappyWrap54 UncheckedExp
happy_var_5) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn71
		 (forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (forall (f :: * -> *) vn.
ExpBase f vn
-> Maybe (ExpBase f vn)
-> Inclusiveness (ExpBase f vn)
-> SrcLoc
-> AppExpBase f vn
Range UncheckedExp
happy_var_1 (forall a. a -> Maybe a
Just UncheckedExp
happy_var_3) (forall a. a -> Inclusiveness a
UpToExclusive UncheckedExp
happy_var_5) (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedExp
happy_var_5)) forall {k} (a :: k). NoInfo a
NoInfo
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_270 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_270 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_270 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
63# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_270
happyReduction_270 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_270 (HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_5 of { (HappyWrap54 UncheckedExp
happy_var_5) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn71
		 (forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (forall (f :: * -> *) vn.
ExpBase f vn
-> Maybe (ExpBase f vn)
-> Inclusiveness (ExpBase f vn)
-> SrcLoc
-> AppExpBase f vn
Range UncheckedExp
happy_var_1 (forall a. a -> Maybe a
Just UncheckedExp
happy_var_3) (forall a. a -> Inclusiveness a
DownToExclusive UncheckedExp
happy_var_5) (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan UncheckedExp
happy_var_1 UncheckedExp
happy_var_5)) forall {k} (a :: k). NoInfo a
NoInfo
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_271 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_271 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_271 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
6# Int#
64# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_271
happyReduction_271 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_271 (HappyAbsSyn t102 t103 t104 t105
happy_x_6 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
IF) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap53 UncheckedExp
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap53 UncheckedExp
happy_var_4) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_6 of { (HappyWrap53 UncheckedExp
happy_var_6) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn72
		 (forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (forall (f :: * -> *) vn.
ExpBase f vn
-> ExpBase f vn -> ExpBase f vn -> SrcLoc -> AppExpBase f vn
If UncheckedExp
happy_var_2 UncheckedExp
happy_var_4 UncheckedExp
happy_var_6 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_6)) forall {k} (a :: k). NoInfo a
NoInfo
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_272 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_272 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_272 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> L Token
    -> ParserMonad
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyMonadReduce Int#
5# Int#
65# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> p -> ParserMonad (HappyAbsSyn t102 t103 t104 t105)
happyReduction_272
happyReduction_272 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> p -> ParserMonad (HappyAbsSyn t102 t103 t104 t105)
happyReduction_272 (HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest) p
tk
	 = forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen ((case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LOOP) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap93
happyOut93 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap93 PatBase NoInfo Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap85
happyOut85 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap85 LoopFormBase NoInfo Name
happy_var_3) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_5 of { (HappyWrap53 UncheckedExp
happy_var_5) -> 
	( forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (\UncheckedExp
t -> forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (forall (f :: * -> *) vn.
[VName]
-> PatBase f vn
-> ExpBase f vn
-> LoopFormBase f vn
-> ExpBase f vn
-> SrcLoc
-> AppExpBase f vn
DoLoop [] PatBase NoInfo Name
happy_var_2 UncheckedExp
t LoopFormBase NoInfo Name
happy_var_3 UncheckedExp
happy_var_5 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_5)) forall {k} (a :: k). NoInfo a
NoInfo) (PatBase NoInfo Name -> ParserMonad UncheckedExp
patternExp PatBase NoInfo Name
happy_var_2))}}}})
	) (\UncheckedExp
r -> forall a. a -> ParserMonad a
happyReturn (forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn73 UncheckedExp
r))

#if __GLASGOW_HASKELL__ >= 710
happyReduce_273 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_273 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_273 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
7# Int#
65# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_273
happyReduction_273 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_273 (HappyAbsSyn t102 t103 t104 t105
happy_x_7 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_6 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LOOP) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap93
happyOut93 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap93 PatBase NoInfo Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap53 UncheckedExp
happy_var_4) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap85
happyOut85 HappyAbsSyn t102 t103 t104 t105
happy_x_5 of { (HappyWrap85 LoopFormBase NoInfo Name
happy_var_5) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_7 of { (HappyWrap53 UncheckedExp
happy_var_7) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn73
		 (forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (forall (f :: * -> *) vn.
[VName]
-> PatBase f vn
-> ExpBase f vn
-> LoopFormBase f vn
-> ExpBase f vn
-> SrcLoc
-> AppExpBase f vn
DoLoop [] PatBase NoInfo Name
happy_var_2 UncheckedExp
happy_var_4 LoopFormBase NoInfo Name
happy_var_5 UncheckedExp
happy_var_7 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_7)) forall {k} (a :: k). NoInfo a
NoInfo
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_274 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_274 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_274 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
66# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_274
happyReduction_274 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_274 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
MATCH) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap53 UncheckedExp
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap75
happyOut75 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap75 NonEmpty (CaseBase NoInfo Name)
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedExp -> HappyAbsSyn t102 t103 t104 t105
happyIn74
		 (let loc :: SrcLoc
loc = forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 (forall a. NonEmpty a -> [a]
NE.toList NonEmpty (CaseBase NoInfo Name)
happy_var_3)
              in forall (f :: * -> *) vn.
AppExpBase f vn -> f AppRes -> ExpBase f vn
AppExp (forall (f :: * -> *) vn.
ExpBase f vn
-> NonEmpty (CaseBase f vn) -> SrcLoc -> AppExpBase f vn
Match UncheckedExp
happy_var_2 NonEmpty (CaseBase NoInfo Name)
happy_var_3 SrcLoc
loc) forall {k} (a :: k). NoInfo a
NoInfo
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_275 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_275 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_275 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
67# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_275
happyReduction_275 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_275 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap76
happyOut76 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap76 CaseBase NoInfo Name
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
NonEmpty (CaseBase NoInfo Name) -> HappyAbsSyn t102 t103 t104 t105
happyIn75
		 (forall a. a -> NonEmpty a
NE.singleton CaseBase NoInfo Name
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_276 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_276 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_276 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
67# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_276
happyReduction_276 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_276 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap76
happyOut76 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap76 CaseBase NoInfo Name
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap75
happyOut75 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap75 NonEmpty (CaseBase NoInfo Name)
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
NonEmpty (CaseBase NoInfo Name) -> HappyAbsSyn t102 t103 t104 t105
happyIn75
		 (forall a. a -> NonEmpty a -> NonEmpty a
NE.cons CaseBase NoInfo Name
happy_var_1 NonEmpty (CaseBase NoInfo Name)
happy_var_2
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_277 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_277 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_277 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
68# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_277
happyReduction_277 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_277 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
CASE) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap77
happyOut77 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap77 PatBase NoInfo Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap53 UncheckedExp
happy_var_4) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
CaseBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn76
		 (let loc :: SrcLoc
loc = forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 UncheckedExp
happy_var_4 in forall (f :: * -> *) vn.
PatBase f vn -> ExpBase f vn -> SrcLoc -> CaseBase f vn
CasePat PatBase NoInfo Name
happy_var_2 UncheckedExp
happy_var_4 SrcLoc
loc
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_278 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_278 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_278 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
69# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_278
happyReduction_278 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_278 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
HASH_LBRACKET) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap100
happyOut100 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap100 AttrInfo Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap77
happyOut77 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap77 PatBase NoInfo Name
happy_var_4) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn77
		 (forall (f :: * -> *) vn.
AttrInfo vn -> PatBase f vn -> SrcLoc -> PatBase f vn
PatAttr AttrInfo Name
happy_var_2 PatBase NoInfo Name
happy_var_4 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 PatBase NoInfo Name
happy_var_4)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_279 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_279 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_279 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
69# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_279
happyReduction_279 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_279 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap79
happyOut79 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap79 PatBase NoInfo Name
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap35
happyOut35 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap35 UncheckedTypeExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn77
		 (forall (f :: * -> *) vn.
PatBase f vn -> TypeExp vn -> SrcLoc -> PatBase f vn
PatAscription PatBase NoInfo Name
happy_var_1 UncheckedTypeExp
happy_var_3 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan PatBase NoInfo Name
happy_var_1 UncheckedTypeExp
happy_var_3)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_280 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_280 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_280 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
69# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_280
happyReduction_280 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_280 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap79
happyOut79 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap79 PatBase NoInfo Name
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn77
		 (PatBase NoInfo Name
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_281 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_281 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_281 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
69# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_281
happyReduction_281 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_281 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap43
happyOut43 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap43 (Name, Loc)
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap80
happyOut80 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap80 [PatBase NoInfo Name]
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn77
		 (let (Name
n, Loc
loc) = (Name, Loc)
happy_var_1;
                                            loc' :: SrcLoc
loc' = forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
loc [PatBase NoInfo Name]
happy_var_2
                                        in forall (f :: * -> *) vn.
Name -> f PatType -> [PatBase f vn] -> SrcLoc -> PatBase f vn
PatConstr Name
n forall {k} (a :: k). NoInfo a
NoInfo [PatBase NoInfo Name]
happy_var_2 SrcLoc
loc'
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_282 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_282 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_282 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
70# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_282
happyReduction_282 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_282 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap77
happyOut77 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap77 PatBase NoInfo Name
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[PatBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn78
		 ([PatBase NoInfo Name
happy_var_1]
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_283 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_283 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_283 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
70# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_283
happyReduction_283 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_283 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap77
happyOut77 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap77 PatBase NoInfo Name
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap78
happyOut78 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap78 [PatBase NoInfo Name]
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[PatBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn78
		 (PatBase NoInfo Name
happy_var_1 forall a. a -> [a] -> [a]
: [PatBase NoInfo Name]
happy_var_3
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_284 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_284 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_284 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
71# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_284
happyReduction_284 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_284 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn79
		 (let L Loc
loc (ID Name
name) = L Token
happy_var_1 in forall (f :: * -> *) vn. vn -> f PatType -> SrcLoc -> PatBase f vn
Id Name
name forall {k} (a :: k). NoInfo a
NoInfo (forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_285 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_285 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_285 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
71# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_285
happyReduction_285 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_285 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap31
happyOut31 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap31 Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn79
		 (forall (f :: * -> *) vn. vn -> f PatType -> SrcLoc -> PatBase f vn
Id Name
happy_var_2 forall {k} (a :: k). NoInfo a
NoInfo (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_286 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_286 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_286 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
71# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_286
happyReduction_286 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_286 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
UNDERSCORE) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn79
		 (forall (f :: * -> *) vn. f PatType -> SrcLoc -> PatBase f vn
Wildcard forall {k} (a :: k). NoInfo a
NoInfo (forall a. Located a => a -> SrcLoc
srclocOf Loc
happy_var_1)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_287 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_287 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_287 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
71# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_287
happyReduction_287 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_287 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (L Loc
happy_var_2 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn79
		 (forall (f :: * -> *) vn. [PatBase f vn] -> SrcLoc -> PatBase f vn
TuplePat [] (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_2)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_288 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_288 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_288 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
71# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_288
happyReduction_288 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_288 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap77
happyOut77 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap77 PatBase NoInfo Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn79
		 (forall (f :: * -> *) vn. PatBase f vn -> SrcLoc -> PatBase f vn
PatParens PatBase NoInfo Name
happy_var_2 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_289 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_289 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_289 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
71# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_289
happyReduction_289 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_289 (HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap77
happyOut77 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap77 PatBase NoInfo Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap78
happyOut78 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap78 [PatBase NoInfo Name]
happy_var_4) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_5 of { (L Loc
happy_var_5 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn79
		 (forall (f :: * -> *) vn. [PatBase f vn] -> SrcLoc -> PatBase f vn
TuplePat (PatBase NoInfo Name
happy_var_2forall a. a -> [a] -> [a]
:[PatBase NoInfo Name]
happy_var_4) (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_5)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_290 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_290 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_290 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
71# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_290
happyReduction_290 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_290 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LCURLY) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap82
happyOut82 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap82 [(Name, PatBase NoInfo Name)]
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RCURLY) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn79
		 (forall (f :: * -> *) vn.
[(Name, PatBase f vn)] -> SrcLoc -> PatBase f vn
RecordPat [(Name, PatBase NoInfo Name)]
happy_var_2 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_291 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_291 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_291 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
71# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_291
happyReduction_291 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_291 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap84
happyOut84 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap84 (PatLit, Loc)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn79
		 (forall (f :: * -> *) vn.
PatLit -> f PatType -> SrcLoc -> PatBase f vn
PatLit (forall a b. (a, b) -> a
fst (PatLit, Loc)
happy_var_1) forall {k} (a :: k). NoInfo a
NoInfo (forall a. Located a => a -> SrcLoc
srclocOf (forall a b. (a, b) -> b
snd (PatLit, Loc)
happy_var_1))
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_292 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_292 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_292 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
71# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_292
happyReduction_292 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_292 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap43
happyOut43 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap43 (Name, Loc)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn79
		 (let (Name
n, Loc
loc) = (Name, Loc)
happy_var_1
                                                      in forall (f :: * -> *) vn.
Name -> f PatType -> [PatBase f vn] -> SrcLoc -> PatBase f vn
PatConstr Name
n forall {k} (a :: k). NoInfo a
NoInfo [] (forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_293 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_293 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_293 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
72# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_293
happyReduction_293 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_293 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap79
happyOut79 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap79 PatBase NoInfo Name
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[PatBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn80
		 ([PatBase NoInfo Name
happy_var_1]
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_294 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_294 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_294 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
72# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_294
happyReduction_294 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_294 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap80
happyOut80 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap80 [PatBase NoInfo Name]
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap79
happyOut79 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap79 PatBase NoInfo Name
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[PatBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn80
		 ([PatBase NoInfo Name]
happy_var_1 forall a. [a] -> [a] -> [a]
++ [PatBase NoInfo Name
happy_var_2]
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_295 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_295 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_295 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
73# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_295
happyReduction_295 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_295 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap92
happyOut92 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap92 (Name, Loc)
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap77
happyOut77 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap77 PatBase NoInfo Name
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, PatBase NoInfo Name) -> HappyAbsSyn t102 t103 t104 t105
happyIn81
		 ((forall a b. (a, b) -> a
fst (Name, Loc)
happy_var_1, PatBase NoInfo Name
happy_var_3)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_296 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_296 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_296 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
73# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_296
happyReduction_296 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_296 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap92
happyOut92 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap92 (Name, Loc)
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap35
happyOut35 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap35 UncheckedTypeExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, PatBase NoInfo Name) -> HappyAbsSyn t102 t103 t104 t105
happyIn81
		 ((forall a b. (a, b) -> a
fst (Name, Loc)
happy_var_1, forall (f :: * -> *) vn.
PatBase f vn -> TypeExp vn -> SrcLoc -> PatBase f vn
PatAscription (forall (f :: * -> *) vn. vn -> f PatType -> SrcLoc -> PatBase f vn
Id (forall a b. (a, b) -> a
fst (Name, Loc)
happy_var_1) forall {k} (a :: k). NoInfo a
NoInfo (forall a. Located a => a -> SrcLoc
srclocOf (forall a b. (a, b) -> b
snd (Name, Loc)
happy_var_1))) UncheckedTypeExp
happy_var_3 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan (forall a b. (a, b) -> b
snd (Name, Loc)
happy_var_1) UncheckedTypeExp
happy_var_3))
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_297 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_297 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_297 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
73# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_297
happyReduction_297 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_297 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap92
happyOut92 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap92 (Name, Loc)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, PatBase NoInfo Name) -> HappyAbsSyn t102 t103 t104 t105
happyIn81
		 ((forall a b. (a, b) -> a
fst (Name, Loc)
happy_var_1, forall (f :: * -> *) vn. vn -> f PatType -> SrcLoc -> PatBase f vn
Id (forall a b. (a, b) -> a
fst (Name, Loc)
happy_var_1) forall {k} (a :: k). NoInfo a
NoInfo (forall a. Located a => a -> SrcLoc
srclocOf (forall a b. (a, b) -> b
snd (Name, Loc)
happy_var_1)))
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_298 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_298 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_298 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
74# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_298
happyReduction_298 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_298 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap83
happyOut83 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap83 [(Name, PatBase NoInfo Name)]
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[(Name, PatBase NoInfo Name)] -> HappyAbsSyn t102 t103 t104 t105
happyIn82
		 ([(Name, PatBase NoInfo Name)]
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_299 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_299 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_299 = Int#
-> HappyAbsSyn
     (Maybe UncheckedSigExp)
     (Maybe UncheckedSigExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
74# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
happyReduction_299
happyReduction_299 :: HappyAbsSyn t102 t103 t104 t105
happyReduction_299  =  forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[(Name, PatBase NoInfo Name)] -> HappyAbsSyn t102 t103 t104 t105
happyIn82
		 ([]
	)

#if __GLASGOW_HASKELL__ >= 710
happyReduce_300 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_300 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_300 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
75# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_300
happyReduction_300 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_300 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap81
happyOut81 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap81 (Name, PatBase NoInfo Name)
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap83
happyOut83 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap83 [(Name, PatBase NoInfo Name)]
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[(Name, PatBase NoInfo Name)] -> HappyAbsSyn t102 t103 t104 t105
happyIn83
		 ((Name, PatBase NoInfo Name)
happy_var_1 forall a. a -> [a] -> [a]
: [(Name, PatBase NoInfo Name)]
happy_var_3
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_301 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_301 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_301 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
75# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_301
happyReduction_301 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_301 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap81
happyOut81 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap81 (Name, PatBase NoInfo Name)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[(Name, PatBase NoInfo Name)] -> HappyAbsSyn t102 t103 t104 t105
happyIn83
		 ([(Name, PatBase NoInfo Name)
happy_var_1]
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_302 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_302 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_302 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
76# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_302
happyReduction_302 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_302 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PatLit, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn84
		 (let L Loc
loc (CHARLIT Char
x) = L Token
happy_var_1
                          in (Integer -> PatLit
PatLitInt (forall a. Integral a => a -> Integer
toInteger (Char -> Int
ord Char
x)), Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_303 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_303 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_303 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
76# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_303
happyReduction_303 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_303 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap58
happyOut58 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap58 (PrimValue, Loc)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PatLit, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn84
		 ((PrimValue -> PatLit
PatLitPrim (forall a b. (a, b) -> a
fst (PrimValue, Loc)
happy_var_1), forall a b. (a, b) -> b
snd (PrimValue, Loc)
happy_var_1)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_304 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_304 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_304 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
76# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_304
happyReduction_304 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_304 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PatLit, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn84
		 (let L Loc
loc (INTLIT Integer
x) = L Token
happy_var_1 in (Integer -> PatLit
PatLitInt Integer
x, Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_305 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_305 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_305 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
76# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_305
happyReduction_305 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_305 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PatLit, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn84
		 (let L Loc
loc (FLOATLIT Double
x) = L Token
happy_var_1 in (Double -> PatLit
PatLitFloat Double
x, Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_306 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_306 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_306 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
76# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_306
happyReduction_306 :: HappyAbsSyn t102 t103 t104 t105
-> p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_306 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	p
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap57
happyOut57 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap57 (PrimValue, Loc)
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PatLit, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn84
		 ((PrimValue -> PatLit
PatLitPrim (PrimValue -> PrimValue
primNegate (forall a b. (a, b) -> a
fst (PrimValue, Loc)
happy_var_2)), forall a b. (a, b) -> b
snd (PrimValue, Loc)
happy_var_2)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_307 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_307 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_307 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
76# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_307
happyReduction_307 :: HappyAbsSyn t102 t103 t104 t105
-> p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_307 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	p
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PatLit, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn84
		 (let L Loc
loc (INTLIT Integer
x) = L Token
happy_var_2 in (Integer -> PatLit
PatLitInt (forall a. Num a => a -> a
negate Integer
x), Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_308 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_308 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_308 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
76# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_308
happyReduction_308 :: HappyAbsSyn t102 t103 t104 t105
-> p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_308 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	p
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { L Token
happy_var_2 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(PatLit, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn84
		 (let L Loc
loc (FLOATLIT Double
x) = L Token
happy_var_2 in (Double -> PatLit
PatLitFloat (forall a. Num a => a -> a
negate Double
x), Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_309 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_309 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_309 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
77# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_309
happyReduction_309 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_309 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap91
happyOut91 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap91 IdentBase NoInfo Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap53 UncheckedExp
happy_var_4) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
LoopFormBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn85
		 (forall (f :: * -> *) vn.
IdentBase f vn -> ExpBase f vn -> LoopFormBase f vn
For IdentBase NoInfo Name
happy_var_2 UncheckedExp
happy_var_4
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_310 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_310 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_310 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
77# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_310
happyReduction_310 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_310 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap93
happyOut93 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap93 PatBase NoInfo Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap53 UncheckedExp
happy_var_4) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
LoopFormBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn85
		 (forall (f :: * -> *) vn.
PatBase f vn -> ExpBase f vn -> LoopFormBase f vn
ForIn PatBase NoInfo Name
happy_var_2 UncheckedExp
happy_var_4
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_311 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_311 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_311 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
77# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_311
happyReduction_311 :: HappyAbsSyn t102 t103 t104 t105
-> p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_311 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	p
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap53 UncheckedExp
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
LoopFormBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn85
		 (forall (f :: * -> *) vn. ExpBase f vn -> LoopFormBase f vn
While UncheckedExp
happy_var_2
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_312 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_312 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_312 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
78# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_312
happyReduction_312 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_312 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap89
happyOut89 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap89 UncheckedSlice
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RBRACKET) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
((Name, Loc), UncheckedSlice, Loc)
-> HappyAbsSyn t102 t103 t104 t105
happyIn86
		 (let L Loc
vloc (INDEXING Name
v) = L Token
happy_var_1
              in ((Name
v, Loc -> Loc
backOneCol Loc
vloc), UncheckedSlice
happy_var_2, forall a. Located a => a -> Loc
locOf (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan L Token
happy_var_1 Loc
happy_var_3))
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_313 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_313 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_313 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
79# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_313
happyReduction_313 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_313 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap86
happyOut86 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap86 ((Name, Loc), UncheckedSlice, Loc)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
((QualName Name, Loc), UncheckedSlice, Loc)
-> HappyAbsSyn t102 t103 t104 t105
happyIn87
		 (let ((Name
v, Loc
vloc), UncheckedSlice
y, Loc
loc) = ((Name, Loc), UncheckedSlice, Loc)
happy_var_1 in ((forall v. v -> QualName v
qualName Name
v, Loc
vloc), UncheckedSlice
y, Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_314 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_314 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_314 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
79# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_314
happyReduction_314 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_314 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap89
happyOut89 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap89 UncheckedSlice
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RBRACKET) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
((QualName Name, Loc), UncheckedSlice, Loc)
-> HappyAbsSyn t102 t103 t104 t105
happyIn87
		 (let L Loc
vloc (QUALINDEXING [Name]
qs Name
v) = L Token
happy_var_1
                  in ((forall vn. [vn] -> vn -> QualName vn
QualName [Name]
qs Name
v, Loc -> Loc
backOneCol Loc
vloc), UncheckedSlice
happy_var_2, forall a. Located a => a -> Loc
locOf (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan L Token
happy_var_1 Loc
happy_var_3))
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_315 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_315 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_315 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
80# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_315
happyReduction_315 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_315 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedDimIndex -> HappyAbsSyn t102 t103 t104 t105
happyIn88
		 (forall (f :: * -> *) vn. ExpBase f vn -> DimIndexBase f vn
DimFix UncheckedExp
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_316 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_316 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_316 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
80# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_316
happyReduction_316 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_316 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedDimIndex -> HappyAbsSyn t102 t103 t104 t105
happyIn88
		 (forall (f :: * -> *) vn.
Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> DimIndexBase f vn
DimSlice (forall a. a -> Maybe a
Just UncheckedExp
happy_var_1) (forall a. a -> Maybe a
Just UncheckedExp
happy_var_3) forall a. Maybe a
Nothing
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_317 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_317 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_317 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
80# forall {k} {k} {k} {k} {k} {k} {k} {k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_317
happyReduction_317 :: p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_317 p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedDimIndex -> HappyAbsSyn t102 t103 t104 t105
happyIn88
		 (forall (f :: * -> *) vn.
Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> DimIndexBase f vn
DimSlice (forall a. a -> Maybe a
Just UncheckedExp
happy_var_1) forall a. Maybe a
Nothing forall a. Maybe a
Nothing
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_318 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_318 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_318 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
80# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_318
happyReduction_318 :: HappyAbsSyn t102 t103 t104 t105
-> p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_318 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	p
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap54 UncheckedExp
happy_var_2) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedDimIndex -> HappyAbsSyn t102 t103 t104 t105
happyIn88
		 (forall (f :: * -> *) vn.
Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> DimIndexBase f vn
DimSlice forall a. Maybe a
Nothing (forall a. a -> Maybe a
Just UncheckedExp
happy_var_2) forall a. Maybe a
Nothing
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_319 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_319 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_319 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
80# forall {k} {k} {k} {k} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_319
happyReduction_319 :: p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_319 p
happy_x_1
	 =  forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedDimIndex -> HappyAbsSyn t102 t103 t104 t105
happyIn88
		 (forall (f :: * -> *) vn.
Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> DimIndexBase f vn
DimSlice forall a. Maybe a
Nothing forall a. Maybe a
Nothing forall a. Maybe a
Nothing
	)

#if __GLASGOW_HASKELL__ >= 710
happyReduce_320 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_320 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_320 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
80# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_320
happyReduction_320 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_320 (HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_5 of { (HappyWrap54 UncheckedExp
happy_var_5) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedDimIndex -> HappyAbsSyn t102 t103 t104 t105
happyIn88
		 (forall (f :: * -> *) vn.
Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> DimIndexBase f vn
DimSlice (forall a. a -> Maybe a
Just UncheckedExp
happy_var_1) (forall a. a -> Maybe a
Just UncheckedExp
happy_var_3) (forall a. a -> Maybe a
Just UncheckedExp
happy_var_5)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_321 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_321 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_321 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
80# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_321
happyReduction_321 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_321 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap54 UncheckedExp
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap54 UncheckedExp
happy_var_4) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedDimIndex -> HappyAbsSyn t102 t103 t104 t105
happyIn88
		 (forall (f :: * -> *) vn.
Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> DimIndexBase f vn
DimSlice forall a. Maybe a
Nothing (forall a. a -> Maybe a
Just UncheckedExp
happy_var_2) (forall a. a -> Maybe a
Just UncheckedExp
happy_var_4)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_322 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_322 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_322 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
80# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_322
happyReduction_322 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_322 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap54 UncheckedExp
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap54 UncheckedExp
happy_var_4) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedDimIndex -> HappyAbsSyn t102 t103 t104 t105
happyIn88
		 (forall (f :: * -> *) vn.
Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> DimIndexBase f vn
DimSlice (forall a. a -> Maybe a
Just UncheckedExp
happy_var_1) forall a. Maybe a
Nothing (forall a. a -> Maybe a
Just UncheckedExp
happy_var_4)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_323 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_323 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_323 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
80# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {p} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p -> p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_323
happyReduction_323 :: HappyAbsSyn t102 t103 t104 t105
-> p -> p -> HappyAbsSyn t102 t103 t104 t105
happyReduction_323 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	p
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap54
happyOut54 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap54 UncheckedExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedDimIndex -> HappyAbsSyn t102 t103 t104 t105
happyIn88
		 (forall (f :: * -> *) vn.
Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> Maybe (ExpBase f vn)
-> DimIndexBase f vn
DimSlice forall a. Maybe a
Nothing forall a. Maybe a
Nothing (forall a. a -> Maybe a
Just UncheckedExp
happy_var_3)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_324 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_324 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_324 = Int#
-> HappyAbsSyn
     (Maybe UncheckedSigExp)
     (Maybe UncheckedSigExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
81# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
happyReduction_324
happyReduction_324 :: HappyAbsSyn t102 t103 t104 t105
happyReduction_324  =  forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedSlice -> HappyAbsSyn t102 t103 t104 t105
happyIn89
		 ([]
	)

#if __GLASGOW_HASKELL__ >= 710
happyReduce_325 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_325 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_325 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
81# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_325
happyReduction_325 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_325 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap90
happyOut90 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap90 (UncheckedDimIndex, UncheckedSlice)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
UncheckedSlice -> HappyAbsSyn t102 t103 t104 t105
happyIn89
		 (forall a b. (a, b) -> a
fst (UncheckedDimIndex, UncheckedSlice)
happy_var_1 forall a. a -> [a] -> [a]
: forall a b. (a, b) -> b
snd (UncheckedDimIndex, UncheckedSlice)
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_326 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_326 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_326 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
82# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_326
happyReduction_326 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_326 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap88
happyOut88 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap88 UncheckedDimIndex
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(UncheckedDimIndex, UncheckedSlice)
-> HappyAbsSyn t102 t103 t104 t105
happyIn90
		 ((UncheckedDimIndex
happy_var_1, [])
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_327 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_327 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_327 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
82# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_327
happyReduction_327 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_327 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap88
happyOut88 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap88 UncheckedDimIndex
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap90
happyOut90 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap90 (UncheckedDimIndex, UncheckedSlice)
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(UncheckedDimIndex, UncheckedSlice)
-> HappyAbsSyn t102 t103 t104 t105
happyIn90
		 ((UncheckedDimIndex
happy_var_1, forall a b. (a, b) -> a
fst (UncheckedDimIndex, UncheckedSlice)
happy_var_3 forall a. a -> [a] -> [a]
: forall a b. (a, b) -> b
snd (UncheckedDimIndex, UncheckedSlice)
happy_var_3)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_328 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_328 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_328 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
83# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_328
happyReduction_328 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_328 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
IdentBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn91
		 (let L Loc
loc (ID Name
name) = L Token
happy_var_1 in forall (f :: * -> *) vn.
vn -> f PatType -> SrcLoc -> IdentBase f vn
Ident Name
name forall {k} (a :: k). NoInfo a
NoInfo (forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_329 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_329 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_329 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
84# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_329
happyReduction_329 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_329 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn92
		 (let L Loc
loc (ID Name
name) = L Token
happy_var_1 in (Name
name, Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_330 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_330 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_330 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
84# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_330
happyReduction_330 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_330 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn92
		 (let L Loc
loc (INTLIT Integer
n) = L Token
happy_var_1 in (String -> Name
nameFromString (forall a. Show a => a -> String
show Integer
n), Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_331 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_331 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_331 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
85# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_331
happyReduction_331 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_331 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
HASH_LBRACKET) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap100
happyOut100 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap100 AttrInfo Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap93
happyOut93 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap93 PatBase NoInfo Name
happy_var_4) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn93
		 (forall (f :: * -> *) vn.
AttrInfo vn -> PatBase f vn -> SrcLoc -> PatBase f vn
PatAttr AttrInfo Name
happy_var_2 PatBase NoInfo Name
happy_var_4 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 PatBase NoInfo Name
happy_var_4)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_332 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_332 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_332 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
85# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_332
happyReduction_332 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_332 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap95
happyOut95 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap95 PatBase NoInfo Name
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap35
happyOut35 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap35 UncheckedTypeExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn93
		 (forall (f :: * -> *) vn.
PatBase f vn -> TypeExp vn -> SrcLoc -> PatBase f vn
PatAscription PatBase NoInfo Name
happy_var_1 UncheckedTypeExp
happy_var_3 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan PatBase NoInfo Name
happy_var_1 UncheckedTypeExp
happy_var_3)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_333 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_333 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_333 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
85# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_333
happyReduction_333 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_333 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap95
happyOut95 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap95 PatBase NoInfo Name
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn93
		 (PatBase NoInfo Name
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_334 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_334 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_334 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
86# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_334
happyReduction_334 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_334 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap93
happyOut93 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap93 PatBase NoInfo Name
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[PatBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn94
		 ([PatBase NoInfo Name
happy_var_1]
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_335 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_335 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_335 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
86# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_335
happyReduction_335 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_335 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap93
happyOut93 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap93 PatBase NoInfo Name
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap94
happyOut94 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap94 [PatBase NoInfo Name]
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[PatBase NoInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn94
		 (PatBase NoInfo Name
happy_var_1 forall a. a -> [a] -> [a]
: [PatBase NoInfo Name]
happy_var_3
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_336 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_336 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_336 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
87# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_336
happyReduction_336 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_336 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn95
		 (let L Loc
loc (ID Name
name) = L Token
happy_var_1 in forall (f :: * -> *) vn. vn -> f PatType -> SrcLoc -> PatBase f vn
Id Name
name forall {k} (a :: k). NoInfo a
NoInfo (forall a. Located a => a -> SrcLoc
srclocOf Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_337 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_337 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_337 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
87# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_337
happyReduction_337 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_337 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap31
happyOut31 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap31 Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn95
		 (forall (f :: * -> *) vn. vn -> f PatType -> SrcLoc -> PatBase f vn
Id Name
happy_var_2 forall {k} (a :: k). NoInfo a
NoInfo (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_338 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_338 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_338 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
87# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_338
happyReduction_338 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_338 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
UNDERSCORE) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn95
		 (forall (f :: * -> *) vn. f PatType -> SrcLoc -> PatBase f vn
Wildcard forall {k} (a :: k). NoInfo a
NoInfo (forall a. Located a => a -> SrcLoc
srclocOf Loc
happy_var_1)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_339 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_339 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_339 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
87# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_339
happyReduction_339 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_339 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (L Loc
happy_var_2 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn95
		 (forall (f :: * -> *) vn. [PatBase f vn] -> SrcLoc -> PatBase f vn
TuplePat [] (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_2)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_340 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_340 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_340 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
87# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_340
happyReduction_340 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_340 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap93
happyOut93 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap93 PatBase NoInfo Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn95
		 (forall (f :: * -> *) vn. PatBase f vn -> SrcLoc -> PatBase f vn
PatParens PatBase NoInfo Name
happy_var_2 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_341 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_341 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_341 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
5# Int#
87# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_341
happyReduction_341 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_341 (HappyAbsSyn t102 t103 t104 t105
happy_x_5 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LPAR) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap93
happyOut93 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap93 PatBase NoInfo Name
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap94
happyOut94 HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (HappyWrap94 [PatBase NoInfo Name]
happy_var_4) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_5 of { (L Loc
happy_var_5 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn95
		 (forall (f :: * -> *) vn. [PatBase f vn] -> SrcLoc -> PatBase f vn
TuplePat (PatBase NoInfo Name
happy_var_2forall a. a -> [a] -> [a]
:[PatBase NoInfo Name]
happy_var_4) (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_5)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_342 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_342 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_342 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
87# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k}
       {k} {t102 :: k} {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_342
happyReduction_342 :: HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_342 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	HappyAbsSyn t102 t103 t104 t105
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (L Loc
happy_var_1 Token
LCURLY) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap97
happyOut97 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap97 [(Name, PatBase NoInfo Name)]
happy_var_2) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RCURLY) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
PatBase NoInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn95
		 (forall (f :: * -> *) vn.
[(Name, PatBase f vn)] -> SrcLoc -> PatBase f vn
RecordPat [(Name, PatBase NoInfo Name)]
happy_var_2 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan Loc
happy_var_1 Loc
happy_var_3)
	)}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_343 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_343 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_343 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
88# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_343
happyReduction_343 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_343 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap92
happyOut92 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap92 (Name, Loc)
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap93
happyOut93 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap93 PatBase NoInfo Name
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, PatBase NoInfo Name) -> HappyAbsSyn t102 t103 t104 t105
happyIn96
		 ((forall a b. (a, b) -> a
fst (Name, Loc)
happy_var_1, PatBase NoInfo Name
happy_var_3)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_344 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_344 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_344 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
88# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_344
happyReduction_344 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_344 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap92
happyOut92 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap92 (Name, Loc)
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap35
happyOut35 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap35 UncheckedTypeExp
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, PatBase NoInfo Name) -> HappyAbsSyn t102 t103 t104 t105
happyIn96
		 ((forall a b. (a, b) -> a
fst (Name, Loc)
happy_var_1, forall (f :: * -> *) vn.
PatBase f vn -> TypeExp vn -> SrcLoc -> PatBase f vn
PatAscription (forall (f :: * -> *) vn. vn -> f PatType -> SrcLoc -> PatBase f vn
Id (forall a b. (a, b) -> a
fst (Name, Loc)
happy_var_1) forall {k} (a :: k). NoInfo a
NoInfo (forall a. Located a => a -> SrcLoc
srclocOf (forall a b. (a, b) -> b
snd (Name, Loc)
happy_var_1))) UncheckedTypeExp
happy_var_3 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan (forall a b. (a, b) -> b
snd (Name, Loc)
happy_var_1) UncheckedTypeExp
happy_var_3))
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_345 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_345 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_345 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
88# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_345
happyReduction_345 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_345 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap92
happyOut92 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap92 (Name, Loc)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(Name, PatBase NoInfo Name) -> HappyAbsSyn t102 t103 t104 t105
happyIn96
		 ((forall a b. (a, b) -> a
fst (Name, Loc)
happy_var_1, forall (f :: * -> *) vn. vn -> f PatType -> SrcLoc -> PatBase f vn
Id (forall a b. (a, b) -> a
fst (Name, Loc)
happy_var_1) forall {k} (a :: k). NoInfo a
NoInfo (forall a. Located a => a -> SrcLoc
srclocOf (forall a b. (a, b) -> b
snd (Name, Loc)
happy_var_1)))
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_346 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_346 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_346 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
89# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_346
happyReduction_346 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_346 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap98
happyOut98 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap98 [(Name, PatBase NoInfo Name)]
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[(Name, PatBase NoInfo Name)] -> HappyAbsSyn t102 t103 t104 t105
happyIn97
		 ([(Name, PatBase NoInfo Name)]
happy_var_1
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_347 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_347 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_347 = Int#
-> HappyAbsSyn
     (Maybe UncheckedSigExp)
     (Maybe UncheckedSigExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
89# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
happyReduction_347
happyReduction_347 :: HappyAbsSyn t102 t103 t104 t105
happyReduction_347  =  forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[(Name, PatBase NoInfo Name)] -> HappyAbsSyn t102 t103 t104 t105
happyIn97
		 ([]
	)

#if __GLASGOW_HASKELL__ >= 710
happyReduce_348 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_348 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_348 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
90# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_348
happyReduction_348 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_348 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap96
happyOut96 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap96 (Name, PatBase NoInfo Name)
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap98
happyOut98 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap98 [(Name, PatBase NoInfo Name)]
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[(Name, PatBase NoInfo Name)] -> HappyAbsSyn t102 t103 t104 t105
happyIn98
		 ((Name, PatBase NoInfo Name)
happy_var_1 forall a. a -> [a] -> [a]
: [(Name, PatBase NoInfo Name)]
happy_var_3
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_349 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_349 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_349 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
90# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_349
happyReduction_349 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_349 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap96
happyOut96 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap96 (Name, PatBase NoInfo Name)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[(Name, PatBase NoInfo Name)] -> HappyAbsSyn t102 t103 t104 t105
happyIn98
		 ([(Name, PatBase NoInfo Name)
happy_var_1]
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_350 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_350 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_350 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
91# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_350
happyReduction_350 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_350 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(AttrAtom Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn99
		 (let L Loc
loc (ID Name
s) =     L Token
happy_var_1 in (forall {k} (vn :: k). Name -> AttrAtom vn
AtomName Name
s, Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_351 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_351 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_351 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
91# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_351
happyReduction_351 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_351 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
(AttrAtom Name, Loc) -> HappyAbsSyn t102 t103 t104 t105
happyIn99
		 (let L Loc
loc (INTLIT Integer
x) = L Token
happy_var_1 in (forall {k} (vn :: k). Integer -> AttrAtom vn
AtomInt Integer
x, Loc
loc)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_352 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_352 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_352 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
92# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_352
happyReduction_352 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_352 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap99
happyOut99 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap99 (AttrAtom Name, Loc)
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
AttrInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn100
		 (let (AttrAtom Name
x,Loc
y) = (AttrAtom Name, Loc)
happy_var_1 in forall {k} (vn :: k). AttrAtom vn -> SrcLoc -> AttrInfo vn
AttrAtom AttrAtom Name
x (forall a. Located a => a -> SrcLoc
srclocOf Loc
y)
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_353 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_353 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_353 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
92# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_353
happyReduction_353 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_353 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (L Loc
happy_var_3 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
AttrInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn100
		 (let L Loc
_ (ID Name
s) = L Token
happy_var_1 in forall {k} (vn :: k).
Name -> [AttrInfo vn] -> SrcLoc -> AttrInfo vn
AttrComp Name
s [] (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan L Token
happy_var_1 Loc
happy_var_3)
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_354 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_354 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_354 = Int#
-> Int#
-> (HappyStk
      (HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
    -> HappyStk
         (HappyAbsSyn
            (Maybe UncheckedSigExp)
            (Maybe UncheckedSigExp)
            (Maybe UncheckedTypeExp)
            (Maybe UncheckedTypeExp)))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce Int#
4# Int#
92# forall {k} {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_354
happyReduction_354 :: HappyStk (HappyAbsSyn t102 t103 t104 t105)
-> HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyReduction_354 (HappyAbsSyn t102 t103 t104 t105
happy_x_4 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_3 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_2 `HappyStk`
	HappyAbsSyn t102 t103 t104 t105
happy_x_1 `HappyStk`
	HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest)
	 = case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { L Token
happy_var_1 -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap101
happyOut101 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap101 [AttrInfo Name]
happy_var_3) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> L Token
happyOutTok HappyAbsSyn t102 t103 t104 t105
happy_x_4 of { (L Loc
happy_var_4 Token
RPAR) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
AttrInfo Name -> HappyAbsSyn t102 t103 t104 t105
happyIn100
		 (let L Loc
_ (ID Name
s) = L Token
happy_var_1 in forall {k} (vn :: k).
Name -> [AttrInfo vn] -> SrcLoc -> AttrInfo vn
AttrComp Name
s [AttrInfo Name]
happy_var_3 (forall a b. (Located a, Located b) => a -> b -> SrcLoc
srcspan L Token
happy_var_1 Loc
happy_var_4)
	) forall a. a -> HappyStk a -> HappyStk a
`HappyStk` HappyStk (HappyAbsSyn t102 t103 t104 t105)
happyRest}}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_355 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_355 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_355 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_1  Int#
93# forall {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_355
happyReduction_355 :: HappyAbsSyn t102 t103 t104 t105 -> HappyAbsSyn t102 t103 t104 t105
happyReduction_355 HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap100
happyOut100 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap100 AttrInfo Name
happy_var_1) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[AttrInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn101
		 ([AttrInfo Name
happy_var_1]
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_356 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_356 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_356 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_3  Int#
93# forall {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {k} {t102 :: k}
       {t103 :: k} {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {t102 :: k} {t103 :: k} {t104 :: k}
       {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_356
happyReduction_356 :: HappyAbsSyn t102 t103 t104 t105
-> p
-> HappyAbsSyn t102 t103 t104 t105
-> HappyAbsSyn t102 t103 t104 t105
happyReduction_356 HappyAbsSyn t102 t103 t104 t105
happy_x_3
	p
happy_x_2
	HappyAbsSyn t102 t103 t104 t105
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap100
happyOut100 HappyAbsSyn t102 t103 t104 t105
happy_x_1 of { (HappyWrap100 AttrInfo Name
happy_var_1) -> 
	case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap101
happyOut101 HappyAbsSyn t102 t103 t104 t105
happy_x_3 of { (HappyWrap101 [AttrInfo Name]
happy_var_3) -> 
	forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
[AttrInfo Name] -> HappyAbsSyn t102 t103 t104 t105
happyIn101
		 (AttrInfo Name
happy_var_1 forall a. a -> [a] -> [a]
: [AttrInfo Name]
happy_var_3
	)}}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_357 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_357 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_357 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
94# forall {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t103 :: k} {t104 :: k} {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p -> HappyAbsSyn (Maybe UncheckedSigExp) t103 t104 t105
happyReduction_357
happyReduction_357 :: HappyAbsSyn t102 t103 t104 t105
-> p -> HappyAbsSyn (Maybe UncheckedSigExp) t103 t104 t105
happyReduction_357 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	p
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap13
happyOut13 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap13 UncheckedSigExp
happy_var_2) -> 
	forall {k} {k} {k} t102 (t103 :: k) (t104 :: k) (t105 :: k).
t102 -> HappyAbsSyn t102 t103 t104 t105
happyIn102
		 (forall a. a -> Maybe a
Just UncheckedSigExp
happy_var_2
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_358 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_358 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_358 = Int#
-> HappyAbsSyn
     (Maybe UncheckedSigExp)
     (Maybe UncheckedSigExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
94# forall {k} {k} {k} {a} {t103 :: k} {t104 :: k} {t105 :: k}.
HappyAbsSyn (Maybe a) t103 t104 t105
happyReduction_358
happyReduction_358 :: HappyAbsSyn (Maybe a) t103 t104 t105
happyReduction_358  =  forall {k} {k} {k} t102 (t103 :: k) (t104 :: k) (t105 :: k).
t102 -> HappyAbsSyn t102 t103 t104 t105
happyIn102
		 (forall a. Maybe a
Nothing
	)

#if __GLASGOW_HASKELL__ >= 710
happyReduce_359 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_359 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_359 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
95# forall {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t104 :: k} {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p -> HappyAbsSyn t102 (Maybe UncheckedSigExp) t104 t105
happyReduction_359
happyReduction_359 :: HappyAbsSyn t102 t103 t104 t105
-> p -> HappyAbsSyn t102 (Maybe UncheckedSigExp) t104 t105
happyReduction_359 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	p
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap19
happyOut19 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap19 UncheckedSigExp
happy_var_2) -> 
	forall {k} {k} {k} t103 (t102 :: k) (t104 :: k) (t105 :: k).
t103 -> HappyAbsSyn t102 t103 t104 t105
happyIn103
		 (forall a. a -> Maybe a
Just UncheckedSigExp
happy_var_2
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_360 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_360 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_360 = Int#
-> HappyAbsSyn
     (Maybe UncheckedSigExp)
     (Maybe UncheckedSigExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
95# forall {k} {k} {k} {t102 :: k} {a} {t104 :: k} {t105 :: k}.
HappyAbsSyn t102 (Maybe a) t104 t105
happyReduction_360
happyReduction_360 :: HappyAbsSyn t102 (Maybe a) t104 t105
happyReduction_360  =  forall {k} {k} {k} t103 (t102 :: k) (t104 :: k) (t105 :: k).
t103 -> HappyAbsSyn t102 t103 t104 t105
happyIn103
		 (forall a. Maybe a
Nothing
	)

#if __GLASGOW_HASKELL__ >= 710
happyReduce_361 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_361 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_361 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
96# forall {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t105 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p -> HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happyReduction_361
happyReduction_361 :: HappyAbsSyn t102 t103 t104 t105
-> p -> HappyAbsSyn t102 t103 (Maybe UncheckedTypeExp) t105
happyReduction_361 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	p
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap35
happyOut35 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap35 UncheckedTypeExp
happy_var_2) -> 
	forall {k} {k} {k} t104 (t102 :: k) (t103 :: k) (t105 :: k).
t104 -> HappyAbsSyn t102 t103 t104 t105
happyIn104
		 (forall a. a -> Maybe a
Just UncheckedTypeExp
happy_var_2
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_362 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_362 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_362 = Int#
-> HappyAbsSyn
     (Maybe UncheckedSigExp)
     (Maybe UncheckedSigExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
96# forall {k} {k} {k} {t102 :: k} {t103 :: k} {a} {t105 :: k}.
HappyAbsSyn t102 t103 (Maybe a) t105
happyReduction_362
happyReduction_362 :: HappyAbsSyn t102 t103 (Maybe a) t105
happyReduction_362  =  forall {k} {k} {k} t104 (t102 :: k) (t103 :: k) (t105 :: k).
t104 -> HappyAbsSyn t102 t103 t104 t105
happyIn104
		 (forall a. Maybe a
Nothing
	)

#if __GLASGOW_HASKELL__ >= 710
happyReduce_363 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_363 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_363 = Int#
-> (HappyAbsSyn
      (Maybe UncheckedSigExp)
      (Maybe UncheckedSigExp)
      (Maybe UncheckedTypeExp)
      (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp)
    -> HappyAbsSyn
         (Maybe UncheckedSigExp)
         (Maybe UncheckedSigExp)
         (Maybe UncheckedTypeExp)
         (Maybe UncheckedTypeExp))
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_2  Int#
97# forall {k} {k} {k} {k} {k} {k} {k} {t102 :: k} {t103 :: k}
       {t104 :: k} {t105 :: k} {p} {t102 :: k} {t103 :: k} {t104 :: k}.
HappyAbsSyn t102 t103 t104 t105
-> p -> HappyAbsSyn t102 t103 t104 (Maybe UncheckedTypeExp)
happyReduction_363
happyReduction_363 :: HappyAbsSyn t102 t103 t104 t105
-> p -> HappyAbsSyn t102 t103 t104 (Maybe UncheckedTypeExp)
happyReduction_363 HappyAbsSyn t102 t103 t104 t105
happy_x_2
	p
happy_x_1
	 =  case forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap37
happyOut37 HappyAbsSyn t102 t103 t104 t105
happy_x_2 of { (HappyWrap37 UncheckedTypeExp
happy_var_2) -> 
	forall {k} {k} {k} t105 (t102 :: k) (t103 :: k) (t104 :: k).
t105 -> HappyAbsSyn t102 t103 t104 t105
happyIn105
		 (forall a. a -> Maybe a
Just UncheckedTypeExp
happy_var_2
	)}

#if __GLASGOW_HASKELL__ >= 710
happyReduce_364 :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)
#endif
happyReduce_364 :: Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyReduce_364 = Int#
-> HappyAbsSyn
     (Maybe UncheckedSigExp)
     (Maybe UncheckedSigExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp)
-> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happySpecReduce_0  Int#
97# forall {k} {k} {k} {t102 :: k} {t103 :: k} {t104 :: k} {a}.
HappyAbsSyn t102 t103 t104 (Maybe a)
happyReduction_364
happyReduction_364 :: HappyAbsSyn t102 t103 t104 (Maybe a)
happyReduction_364  =  forall {k} {k} {k} t105 (t102 :: k) (t103 :: k) (t104 :: k).
t105 -> HappyAbsSyn t102 t103 t104 t105
happyIn105
		 (forall a. Maybe a
Nothing
	)

happyNewToken :: Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyNewToken Int#
action Happy_IntList
sts HappyStk
  (HappyAbsSyn
     (Maybe UncheckedSigExp)
     (Maybe UncheckedSigExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
stk
	= forall a. (L Token -> ParserMonad a) -> ParserMonad a
lexer(\L Token
tk -> 
	let cont :: Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
i = Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyDoAction Int#
i L Token
tk Int#
action Happy_IntList
sts HappyStk
  (HappyAbsSyn
     (Maybe UncheckedSigExp)
     (Maybe UncheckedSigExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
stk in
	case L Token
tk of {
	L Loc
_ Token
EOF -> Int#
-> L Token
-> Int#
-> Happy_IntList
-> HappyStk
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyDoAction Int#
103# L Token
tk Int#
action Happy_IntList
sts HappyStk
  (HappyAbsSyn
     (Maybe UncheckedSigExp)
     (Maybe UncheckedSigExp)
     (Maybe UncheckedTypeExp)
     (Maybe UncheckedTypeExp))
stk;
	L Loc
happy_dollar_dollar Token
IF -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
1#;
	L Loc
happy_dollar_dollar Token
THEN -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
2#;
	L Loc
happy_dollar_dollar Token
ELSE -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
3#;
	L Loc
happy_dollar_dollar Token
LET -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
4#;
	L Loc
happy_dollar_dollar Token
DEF -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
5#;
	L Loc
happy_dollar_dollar Token
LOOP -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
6#;
	L Loc
happy_dollar_dollar Token
IN -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
7#;
	L Loc
happy_dollar_dollar Token
MATCH -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
8#;
	L Loc
happy_dollar_dollar Token
CASE -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
9#;
	L Loc
_ (ID Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
10#;
	L Loc
_ (INDEXING Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
11#;
	L Loc
_ (QUALINDEXING [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
12#;
	L Loc
_ (QUALPAREN [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
13#;
	L Loc
_ (CONSTRUCTOR Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
14#;
	L Loc
_ (PROJ_INTFIELD Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
15#;
	L Loc
_ (INTLIT Integer
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
16#;
	L Loc
_ (I8LIT Int8
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
17#;
	L Loc
_ (I16LIT Int16
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
18#;
	L Loc
_ (I32LIT Int32
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
19#;
	L Loc
_ (I64LIT Int64
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
20#;
	L Loc
_ (U8LIT Word8
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
21#;
	L Loc
_ (U16LIT Word16
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
22#;
	L Loc
_ (U32LIT Word32
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
23#;
	L Loc
_ (U64LIT Word64
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
24#;
	L Loc
_ (FLOATLIT Double
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
25#;
	L Loc
_ (F16LIT Half
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
26#;
	L Loc
_ (F32LIT Float
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
27#;
	L Loc
_ (F64LIT Double
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
28#;
	L Loc
_ (STRINGLIT Text
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
29#;
	L Loc
_ (CHARLIT Char
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
30#;
	L Loc
happy_dollar_dollar Token
DOT -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
31#;
	L Loc
happy_dollar_dollar Token
TWO_DOTS -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
32#;
	L Loc
happy_dollar_dollar Token
THREE_DOTS -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
33#;
	L Loc
happy_dollar_dollar Token
TWO_DOTS_LT -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
34#;
	L Loc
happy_dollar_dollar Token
TWO_DOTS_GT -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
35#;
	L Loc
happy_dollar_dollar Token
EQU -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
36#;
	L Loc
happy_dollar_dollar Token
ASTERISK -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
37#;
	L Loc
happy_dollar_dollar Token
NEGATE -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
38#;
	L Loc
happy_dollar_dollar Token
BANG -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
39#;
	L Loc
happy_dollar_dollar Token
LTH -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
40#;
	L Loc
happy_dollar_dollar Token
HAT -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
41#;
	L Loc
happy_dollar_dollar Token
TILDE -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
42#;
	L Loc
happy_dollar_dollar Token
PIPE -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
43#;
	L Loc
_ (SYMBOL BinOp
Plus [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
44#;
	L Loc
_ (SYMBOL BinOp
Minus [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
45#;
	L Loc
_ (SYMBOL BinOp
Times [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
46#;
	L Loc
_ (SYMBOL BinOp
Divide [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
47#;
	L Loc
_ (SYMBOL BinOp
Mod [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
48#;
	L Loc
_ (SYMBOL BinOp
Quot [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
49#;
	L Loc
_ (SYMBOL BinOp
Rem [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
50#;
	L Loc
_ (SYMBOL BinOp
Equal [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
51#;
	L Loc
_ (SYMBOL BinOp
NotEqual [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
52#;
	L Loc
_ (SYMBOL BinOp
Less [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
53#;
	L Loc
_ (SYMBOL BinOp
Greater [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
54#;
	L Loc
_ (SYMBOL BinOp
Leq [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
55#;
	L Loc
_ (SYMBOL BinOp
Geq [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
56#;
	L Loc
_ (SYMBOL BinOp
Pow [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
57#;
	L Loc
_ (SYMBOL BinOp
ShiftL [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
58#;
	L Loc
_ (SYMBOL BinOp
ShiftR [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
59#;
	L Loc
_ (SYMBOL BinOp
PipeRight [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
60#;
	L Loc
_ (SYMBOL BinOp
PipeLeft [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
61#;
	L Loc
_ (SYMBOL BinOp
Bor [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
62#;
	L Loc
_ (SYMBOL BinOp
Band [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
63#;
	L Loc
_ (SYMBOL BinOp
Xor [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
64#;
	L Loc
_ (SYMBOL BinOp
LogOr [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
65#;
	L Loc
_ (SYMBOL BinOp
LogAnd [Name]
_ Name
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
66#;
	L Loc
happy_dollar_dollar Token
LPAR -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
67#;
	L Loc
happy_dollar_dollar Token
RPAR -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
68#;
	L Loc
happy_dollar_dollar Token
RPAR_THEN_LBRACKET -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
69#;
	L Loc
happy_dollar_dollar Token
LCURLY -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
70#;
	L Loc
happy_dollar_dollar Token
RCURLY -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
71#;
	L Loc
happy_dollar_dollar Token
LBRACKET -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
72#;
	L Loc
happy_dollar_dollar Token
RBRACKET -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
73#;
	L Loc
happy_dollar_dollar Token
HASH_LBRACKET -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
74#;
	L Loc
happy_dollar_dollar Token
COMMA -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
75#;
	L Loc
happy_dollar_dollar Token
UNDERSCORE -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
76#;
	L Loc
happy_dollar_dollar Token
BACKSLASH -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
77#;
	L Loc
happy_dollar_dollar Token
APOSTROPHE -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
78#;
	L Loc
happy_dollar_dollar Token
APOSTROPHE_THEN_HAT -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
79#;
	L Loc
happy_dollar_dollar Token
APOSTROPHE_THEN_TILDE -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
80#;
	L Loc
happy_dollar_dollar Token
BACKTICK -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
81#;
	L Loc
happy_dollar_dollar Token
ENTRY -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
82#;
	L Loc
happy_dollar_dollar Token
RIGHT_ARROW -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
83#;
	L Loc
happy_dollar_dollar Token
COLON -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
84#;
	L Loc
happy_dollar_dollar Token
COLON_GT -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
85#;
	L Loc
happy_dollar_dollar Token
QUESTION_MARK -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
86#;
	L Loc
happy_dollar_dollar Token
FOR -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
87#;
	L Loc
happy_dollar_dollar Token
DO -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
88#;
	L Loc
happy_dollar_dollar Token
WITH -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
89#;
	L Loc
happy_dollar_dollar Token
ASSERT -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
90#;
	L Loc
happy_dollar_dollar Token
TRUE -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
91#;
	L Loc
happy_dollar_dollar Token
FALSE -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
92#;
	L Loc
happy_dollar_dollar Token
WHILE -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
93#;
	L Loc
happy_dollar_dollar Token
INCLUDE -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
94#;
	L Loc
happy_dollar_dollar Token
IMPORT -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
95#;
	L Loc
happy_dollar_dollar Token
TYPE -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
96#;
	L Loc
happy_dollar_dollar Token
MODULE -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
97#;
	L Loc
happy_dollar_dollar Token
VAL -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
98#;
	L Loc
happy_dollar_dollar Token
OPEN -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
99#;
	L Loc
happy_dollar_dollar Token
LOCAL -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
100#;
	L Loc
_  (DOC String
_) -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
101#;
	L Loc
happy_dollar_dollar Token
HOLE -> Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
cont Int#
102#;
	L Token
_ -> forall a. (L Token, [String]) -> ParserMonad a
happyError' (L Token
tk, [])
	})

happyError_ :: [String] -> Int# -> L Token -> ParserMonad a
happyError_ [String]
explist Int#
103# L Token
tk = forall a. (L Token, [String]) -> ParserMonad a
happyError' (L Token
tk, [String]
explist)
happyError_ [String]
explist Int#
_ L Token
tk = forall a. (L Token, [String]) -> ParserMonad a
happyError' (L Token
tk, [String]
explist)

happyThen :: () => ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen :: forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen = forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
(Prelude.>>=)
happyReturn :: () => a -> ParserMonad a
happyReturn :: forall a. a -> ParserMonad a
happyReturn = (forall (m :: * -> *) a. Monad m => a -> m a
Prelude.return)
#if __GLASGOW_HASKELL__ >= 710
happyParse :: () => Happy_GHC_Exts.Int# -> ParserMonad (HappyAbsSyn _ _ _ _)

happyNewToken :: () => Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)

happyDoAction :: () => Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _)

happyReduceArr :: () => Happy_Data_Array.Array Prelude.Int (Happy_GHC_Exts.Int# -> L Token -> Happy_GHC_Exts.Int# -> Happy_IntList -> HappyStk (HappyAbsSyn _ _ _ _) -> ParserMonad (HappyAbsSyn _ _ _ _))

#endif
happyThen1 :: () => ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen1 :: forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen1 = forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen
happyReturn1 :: () => a -> ParserMonad a
happyReturn1 :: forall a. a -> ParserMonad a
happyReturn1 = forall a. a -> ParserMonad a
happyReturn
happyError' :: () => ((L Token), [Prelude.String]) -> ParserMonad a
happyError' :: forall a. (L Token, [String]) -> ParserMonad a
happyError' (L Token, [String])
tk = forall a. (L Token, [String]) -> ParserMonad a
parseError (L Token, [String])
tk
prog :: ParserMonad UncheckedProg
prog = ParserMonad UncheckedProg
happySomeParser where
 happySomeParser :: ParserMonad UncheckedProg
happySomeParser = forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen (Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyParse Int#
0#) (\HappyAbsSyn
  (Maybe UncheckedSigExp)
  (Maybe UncheckedSigExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
x -> forall a. a -> ParserMonad a
happyReturn (let {(HappyWrap9 UncheckedProg
x') = forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap9
happyOut9 HappyAbsSyn
  (Maybe UncheckedSigExp)
  (Maybe UncheckedSigExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
x} in UncheckedProg
x'))

futharkType :: ParserMonad UncheckedTypeExp
futharkType = ParserMonad UncheckedTypeExp
happySomeParser where
 happySomeParser :: ParserMonad UncheckedTypeExp
happySomeParser = forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen (Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyParse Int#
1#) (\HappyAbsSyn
  (Maybe UncheckedSigExp)
  (Maybe UncheckedSigExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
x -> forall a. a -> ParserMonad a
happyReturn (let {(HappyWrap35 UncheckedTypeExp
x') = forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap35
happyOut35 HappyAbsSyn
  (Maybe UncheckedSigExp)
  (Maybe UncheckedSigExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
x} in UncheckedTypeExp
x'))

expression :: ParserMonad UncheckedExp
expression = ParserMonad UncheckedExp
happySomeParser where
 happySomeParser :: ParserMonad UncheckedExp
happySomeParser = forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen (Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyParse Int#
2#) (\HappyAbsSyn
  (Maybe UncheckedSigExp)
  (Maybe UncheckedSigExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
x -> forall a. a -> ParserMonad a
happyReturn (let {(HappyWrap53 UncheckedExp
x') = forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap53
happyOut53 HappyAbsSyn
  (Maybe UncheckedSigExp)
  (Maybe UncheckedSigExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
x} in UncheckedExp
x'))

modExpression :: ParserMonad UncheckedModExp
modExpression = ParserMonad UncheckedModExp
happySomeParser where
 happySomeParser :: ParserMonad UncheckedModExp
happySomeParser = forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen (Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyParse Int#
3#) (\HappyAbsSyn
  (Maybe UncheckedSigExp)
  (Maybe UncheckedSigExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
x -> forall a. a -> ParserMonad a
happyReturn (let {(HappyWrap16 UncheckedModExp
x') = forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap16
happyOut16 HappyAbsSyn
  (Maybe UncheckedSigExp)
  (Maybe UncheckedSigExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
x} in UncheckedModExp
x'))

declaration :: ParserMonad UncheckedDec
declaration = ParserMonad UncheckedDec
happySomeParser where
 happySomeParser :: ParserMonad UncheckedDec
happySomeParser = forall a b. ParserMonad a -> (a -> ParserMonad b) -> ParserMonad b
happyThen (Int#
-> ParserMonad
     (HappyAbsSyn
        (Maybe UncheckedSigExp)
        (Maybe UncheckedSigExp)
        (Maybe UncheckedTypeExp)
        (Maybe UncheckedTypeExp))
happyParse Int#
4#) (\HappyAbsSyn
  (Maybe UncheckedSigExp)
  (Maybe UncheckedSigExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
x -> forall a. a -> ParserMonad a
happyReturn (let {(HappyWrap10 UncheckedDec
x') = forall {k} {k} {k} {k} (t102 :: k) (t103 :: k) (t104 :: k)
       (t105 :: k).
HappyAbsSyn t102 t103 t104 t105 -> HappyWrap10
happyOut10 HappyAbsSyn
  (Maybe UncheckedSigExp)
  (Maybe UncheckedSigExp)
  (Maybe UncheckedTypeExp)
  (Maybe UncheckedTypeExp)
x} in UncheckedDec
x'))

happySeq :: a -> b -> b
happySeq = forall a b. a -> b -> b
happyDontSeq



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













-- 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)) :: Prelude.Bool)
#define GTE(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.>=# m)) :: Prelude.Bool)
#define EQ(n,m) ((Happy_GHC_Exts.tagToEnum# (n Happy_GHC_Exts.==# m)) :: Prelude.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



















data Happy_IntList = HappyCons Happy_GHC_Exts.Int# Happy_IntList








































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 ERROR_TOK, 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 (happyExpListPerState ((Happy_GHC_Exts.I# (st)) :: Prelude.Int)) 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    = happyAdjustOffset (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 Prelude.False
         action
          | check     = indexShortOffAddr happyTable off_i
          | Prelude.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#




{-# INLINE happyLt #-}
happyLt x y = LT(x,y)


readArrayBit arr bit =
    Bits.testBit (Happy_GHC_Exts.I# (indexShortOffAddr arr ((unbox_int bit) `Happy_GHC_Exts.iShiftRA#` 4#))) (bit `Prelude.mod` 16)
  where unbox_int (Happy_GHC_Exts.I# x) = x






data HappyAddr = HappyA# Happy_GHC_Exts.Addr#


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













-----------------------------------------------------------------------------
-- 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 = happyAdjustOffset (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 = happyAdjustOffset (indexShortOffAddr happyGotoOffsets st)
         off_i = (off Happy_GHC_Exts.+# nt)
         new_state = indexShortOffAddr happyTable off_i




-----------------------------------------------------------------------------
-- Error recovery (ERROR_TOK is the error token)

-- parse error if we are in recovery and we fail again
happyFail explist 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_ explist 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  ERROR_TOK tk old_st CONS(HAPPYSTATE(action),sts) 
                                                (saved_tok `HappyStk` _ `HappyStk` stk) =
--      trace ("discarding state, depth " ++ show (length stk))  $
        DO_ACTION(action,ERROR_TOK,tk,sts,(saved_tok`HappyStk`stk))
-}

-- Enter error recovery: generate an error token,
--                       save the old token and carry on.
happyFail explist 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 = Prelude.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 `Prelude.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.