h*Vn      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                                                                                                                                                                                                                      !!!!""""""""""""############$$$$$$$$$$$%%%%%%%%%%%%%%%%&&&&&&&&&&&&&&&&&'1.3.0*( Safe-Inferred Safe-InferredsmcdelAn equivalence relation given by equivalence classes, as a list of lists.smcdel3A binary relation, represented by a list of tuples.     Safe-Inferred.smcdel&semantics: truth at a world in a model/smcdelglobal truth in a model0smcdelpublic announcement2smcdelpublic announcement-whether4smcdelsafe substitutions5smcdelpublic factual change) !"&%$#'()*+,-./0123456789:;<=>)'("&%$# !)*+,-./0123456789:;<=> Safe-InferredJ JKLMNOPQRS JKLOPQRSMN Safe-Inferred"osmcdelTeXing assignments as setsTUV_^][ZYXW\`fedcbaghijklmnghij`fedcbaklV_^][ZYXW\TUmn) Safe-Inferred. * Safe-Inferred smcdelEncode a Haskell String to a list of Word8 values, in UTF8 format.  Safe-Inferred&/xsmcdelBoolean FormulassmcdelFormulassmcdel True ConstantsmcdelFalse ConstantsmcdelAtomic PropositionsmcdelNegationsmcdel Conjunctionsmcdel Disjunctionsmcdel n-ary X-ORsmcdel ImplicationsmcdelBi-Implicationsmcdel Boolean Universal Quantificationsmcdel"Boolean Existential Quantificationsmcdel Knowing thatsmcdelCommon knowing thatsmcdelDistributed knowing thatsmcdelKnowing whethersmcdelCommon knowing whethersmcdelDistributed knowing whethersmcdelPublic announcement thatsmcdelPublic announcement whethersmcdel (Semi-)Private announcement thatsmcdel#(Semi-)Private announcement whethersmcdelDynamic Diamondsmcdel,Five default agents given by `"1"` to `"5"`.smcdel If-Then-Elsesmcdel3Abbreviation for a sequence of announcements using.smcdelAbbreviation to say that exactly a given subset of a set of propositions is true.smcdelThe dynamic box operatorsmcdelThe \vDash symbol for semantics.smcdelshift addprops to ensure that props and newprops are disjoint:smcdelAdding knowledge transformers does not increase expressivity because we have the following reductions.For now we do not implement a separate type of formulas with dynamic operators but instead implement the reduction axioms directly as a function which takes an event and ``pushes it through'' a formula.The following takes an event $mathcal{X},x$ and a formula $phi$ and then `pushes' $[mathcal{X},x]$ through all boolean and epistemic operators in $phi$ until it disappears in front of atomic propositons. This translation is global, i.e. if there is a reduced formula, then it is equivalent to the original on all structures.smcdelGenerating random knowledge structures for QuickCheck. -- FIXME: not showing up in Haddock?++  Safe-InferredG Safe-InferredH\ Safe-InferredH Safe-InferredI( Safe-InferredI Safe-InferredJsmcdel=Initial structure for Dining Cryptographers (complete graph!) Safe-InferredJq Safe-InferredKsmcdelSize of a BDD, also counting terminal nodes. TODO: check if this is correct / agrees with CacBDD.smcdel>shift addprops to ensure that props and newprops are disjoint: Safe-InferredOsmcdel$A function mapping worlds to states.smcdelBDD to say that exactly this subset of a given vocabulary is true.smcdelConvert a multipointed S5 Kripke model to a knoweldge structure. See also .smcdelGet lists of variables which agent i does (not) observe in model m. This does *not* preserve all information, i.e. does not characterize every possible S5 relation!smcdelshift addprops to ensure that props and newprops are disjoint:&& Safe-InferredTosmcdel;Map p or p' in double vocabulary to p in single vocabulary.smcdel9Go from p in double vocabulary to p in single vocabulary.smcdel:Go from p' in double vocabulary to p in single vocabulary.smcdelTranslate an agent's relation of worlds to a relation of sets of propositions. The given model must have distinct valuations.smcdelGiven a formula, compute a BDD that is equivalent to that formula, on a given belief structure.smcdel(Get all states of a knowledge structure.smcdel>shift addprops to ensure that props and newprops are disjoint:11 Safe-InferredUsmcdel1Convert a belief scene to a pointed Kripke model. Safe-InferredWsmcdelEvery knowledge structure is also a belief structure. We replace each O_i with 8\Omega_i := \bigwedge_{p \in O_i} (p \leftrightarrow p').smcdelEvery S5 Kripke model is also a general Kripke model. This replaces each partition \sim_i with a relation R_i. Safe-Inferred`smcdelAn implicitly coordinated plan is a sequence of owned actions. Note: there is no check that the action is actually local for the agent!smcdel?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~[CGHTSE         U                                                                      G                                                                                                                      xw{|}~:                 !!!!""""""""""""############$$$$$$$$$$$%%%%%%%%%%%%%%%%&&&&&&&&&&&&&&&&&(((((((())))))))))))))))))))))))))))))))))))))))))))))******************************************************************************************+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +  #smcdel-1.3.0-FxkK570E7G81b6lQmdg2tZSMCDEL.Internal.HelpSMCDEL.Explicit.DEMO_S5SMCDEL.Examples.CherylDemoSMCDEL.Internal.TexDisplaySMCDEL.LanguageSMCDEL.Internal.TaggedBDDSMCDEL.Internal.SanitySMCDEL.Explicit.S5SMCDEL.Explicit.KSMCDEL.Other.BDD2FormSMCDEL.Other.MCTRIANGLESMCDEL.Symbolic.S5SMCDEL.Examples.SumAndProductSMCDEL.Examples.WhatSumSMCDEL.Examples.PrisonersSMCDEL.Examples.GossipS5SMCDEL.Examples.DrinkLogicSMCDEL.Examples.DiningCryptoSMCDEL.Examples.CherylSMCDEL.Symbolic.S5_DDSMCDEL.Translations.S5SMCDEL.Symbolic.KiSMCDEL.Symbolic.KSMCDEL.Translations.KSMCDEL.Translations.ConvertSMCDEL.Other.PlanningSMCDEL.Examples.SimpleKSMCDEL.Examples.SallyAnneSMCDEL.Examples.RussianCardsSMCDEL.Examples.MuddyChildrenSMCDEL.Examples.MuddyPlanningSMCDEL.Examples.GossipKwSMCDEL.Examples.CoinFlipSMCDEL.Examples.ToynabiSMCDEL.Examples.SimpleS5SMCDEL.Examples.LetterPassingSMCDEL.Examples.DoorMatSMCDEL.Examplessmcdel Paths_smcdelSMCDEL.Internal.TokenSMCDEL.Internal.LexSMCDEL.Internal.ParseErelalleq alleqWithanydiff anydiffWithalldiff groupSortWithapply!set applyPartial!=powersetlfprestrictrtctcblfusion intersectionseteqsubseteqDemoFormTopInfoPrpNgConjDisjKnPAPAWEpistMMoDemoPrpDemoPDemoQDemoRDemoSAgentAgrelinitM powerListsortLimplisTrueAtisTrueupdPaupdsPaupdPaWupdsPaWsubupdPcupdsPcupdPibTablesinitNfatherNkndontknowNsolveN $fShowDemoPrp $fShowEpistM $fEqDemoForm $fOrdDemoForm$fShowDemoForm $fEqEpistM $fEqDemoPrp $fOrdDemoPrp $fEqAgent $fOrdAgent $fShowAgentMyWorld allStatesstartcherylIsweKnowItstep1step2step3step4step5ViaDot KripkeLikegetNodesgetEdges getActualsdirectednodeAtstoGraphdispDottextDotsvgTexAbletextexTo texDocumentTopdfTodisp svgViaTexbegintabendtabnewlineremoveDoubleSpaces runAndWaitrunIgnoreAndWaitdot2texdot2texDefaultArgs $fTexAbleList $fTexAbleInt$fTexAbleList0$fTexAbleViaDot $fEqViaDot $fOrdViaDot $fShowViaDotSimplifiedFormSFBFUpdate unsafeUpdatecheckspreCheckupdateHasPreconditionpreOf Optimizableoptimize SemanticsPointed HasAgentsagentsOf DynamicOpDynFormBotPrpFNegXorImplEquiForallExistsKCkDkKwCkwDkw PubAnnounce PubAnnounceWAnnounce AnnounceWDiaGroupAgAgentHasVocabvocabOfPdefaultVocabularyfreshpalicebobcarol defaultAgentsitepubAnnounceStackpubAnnounceWhetherStack booloutofFormoneOfbox|=updatesupdateSequencehaveSameAgentsshowSetppForm ppFormWithtexForm subformulas shrinkformsubstit substitSet substitOutOf replPsInP replPsInF propsInForm propsInForms agentsInFormsimplifysimSteprandomboolformWith $fTexAblePrp$fArbitraryPrp $fEnumPrp$fArbitraryAgAgent$fArbitraryGroup$fShowDynamicOp$fOrdDynamicOp $fEqDynamicOp$fArbitraryForm $fTexAbleForm$fHasAgents(,) $fHasVocab(,)$fHasPreconditionForm $fArbitraryBF$fArbitrarySimplifiedForm$fEqSimplifiedForm$fOrdSimplifiedForm$fShowSimplifiedForm$fEqBF$fOrdBF$fShowBF$fEqForm $fOrdForm $fShowForm $fEqGroup $fOrdGroup $fShowGroup $fEqAgAgent $fOrdAgAgent $fShowAgAgent$fEqPrp$fOrdPrp $fShowPrp QuadrupelTripelDubbel TagForBDDs multiplierunmvBddmvcpcpMany tagBddEval totalRelBdd emptyRelBdd allsamebdd$fTagForBDDsDubbel$fTagForBDDsTripel$fTagForBDDsQuadrupel sanityCheckMultipointedActionModelS5PointedActionModelS5 ActionModelS5ActMS5 PostConditionAction BisimulationPropListMultipointedModelS5PointedModelS5 KripkeModelS5KrMS5 Assignment Partition HasWorldsworldsOfWorld withoutWorld withoutProps randomPartForevalvalidannounceannounceAction checkBisimcheckBisimPointedgeneratedSubmodel bisimClassescheckBisimClasses bisiminimizesafepost$fHasWorlds(,)$fTexAbleKripkeModelS5$fKripkeLikeKripkeModelS5$fUpdateKripkeModelS5Form$fSemanticsKripkeModelS5$fArbitraryKripkeModelS5$fHasWorldsKripkeModelS5$fHasVocabKripkeModelS5$fHasAgentsKripkeModelS5$fPointedKripkeModelS5List$fPointedKripkeModelS5Int$fOptimizable(,) $fTexAble(,)$fKripkeLike(,)$fUpdate(,)Form$fSemantics(,) $fTexAble(,)0$fKripkeLike(,)0$fUpdate(,)Form0$fSemantics(,)0$fArbitraryPropList"$fUpdateKripkeModelS5ActionModelS5$fArbitraryActionModelS5$fTexAbleActionModelS5$fKripkeLikeActionModelS5$fPointedActionModelS5List$fHasPreconditionActionModelS5$fPointedActionModelS5Int$fHasAgentsActionModelS5$fUpdate(,)(,)$fUpdate(,)(,)0 $fTexAble(,)1$fKripkeLike(,)1$fHasPrecondition(,)$fUpdate(,)(,)1$fUpdate(,)(,)2 $fTexAble(,)2$fKripkeLike(,)2$fHasPrecondition(,)0$fEqActionModelS5$fOrdActionModelS5$fShowActionModelS5$fEqKripkeModelS5$fOrdKripkeModelS5$fShowKripkeModelS5MultipointedActionModelPointedActionModel ActionModelActMActprepost StatusMapStatusMultipointedModel PointedModel KripkeModelKrM distinctValrelOfIn truthsInAtgroupReldistReldiff diffPointed$fUpdateKripkeModelForm$fSemanticsKripkeModel$fArbitraryKripkeModel$fTexAbleKripkeModel$fKripkeLikeKripkeModel$fHasAgentsKripkeModel$fHasVocabKripkeModel$fHasWorldsKripkeModel$fPointedKripkeModelList$fPointedKripkeModelInt$fTexAbleActionModel$fKripkeLikeActionModel$fArbitraryActionModel$fUpdateKripkeModelActionModel$fPointedActionModelList$fPointedActionModelInt$fHasPreconditionActionModel$fHasAgentsActionModel$fEqActionModel$fOrdActionModel$fShowActionModel$fEqAct$fOrdAct $fShowAct$fEqKripkeModel$fOrdKripkeModel$fShowKripkeModelformOf McFormulaQfKnowSelf NotKnowSelf QuantifierMcModelMcMStateKindMuddyCleanmcModelposFromobsForposForsome nobodyknows everyoneKnowsmcUpdatestepshowme $fShowMcModelWrapBddWrapMultipointedEventEventKnowTransformerKnTrf PropulationMultipointedKnowScene KnowScene KnowStructKnS boolBddOfboolEvalViaBddbddEvalsize relabelWithstatesOfnumberOfStates shareknowcomknow announceOnScnbddOf evalViaBdd validViaBdd whereViaBdddeterminedVocabOf nonobsVocabOfequivExtraVocabOf replaceWithInreplaceEquivExtrageneratedSubstructure$$ checkPropunoChangepublicAnnounce shiftPrepare texBddWithtexBDDreduce$fArbitraryKnowStruct$fTexAbleKnowStruct$fOptimizableKnowStruct$fUpdateKnowStructForm$fSemanticsKnowStruct$fHasVocabKnowStruct$fHasAgentsKnowStruct$fPointedKnowStructBdd$fPointedKnowStructList$fOptimizable(,)0$fTexAbleKnowTransformer!$fUpdateKnowStructKnowTransformer$fPointedKnowTransformerBdd$fPointedKnowTransformerList $fHasPreconditionKnowTransformer$fHasAgentsKnowTransformer$fTexAbleWrapBdd$fEqKnowTransformer$fShowKnowTransformer$fEqKnowStruct$fShowKnowStructpairsxPropsyPropssPropspProps sapAllPropsxIsyIssIspIsxyAre sapKnStructsapKnowssapForm1sapForm2sapForm3 sapProtocol sapSolutionssapExplainStatenmbrwsBound wsTriplesaPropsbPropscPropsaIsbIscIs wsKnStruct wsKnowSelfA wsKnowSelfB wsKnowSelfCwsResult wsSolutionswsExplainStateStorynlightprisonExpStart prisonGoal prisonActionprisonInterviewendOfprisonExpStoryprisonSymStartwasInterviewedisNowInterviewedlightSeenByOneprisonSymEventprisonSymInterviewprisonSymStory$fTexAbleStory gossipershasSofhasexpert allExperts gossipInit thisCallPropcallcallTrfdoCallafter isSuccess whoKnowsMetaallSequs thirstyScenethirstyF thirstyCheck dcScnInitdcScn1 someonepaid notwopaidrevealdcScn2everyoneKnowsWhetherNSApaidnobodyknowsWhoPaid dcCheckFormdcValidgenDcSomeonepaidgenDcNotwopaid genDcKnsInit genDcEveryoneKnowsWhetherNSApaid genDcRevealgenDcNobodyknowsWhoPaidgenDcCheckForm genDcValidVariableVar Possibility possibilitiesdayIsmonthIsthisPosknWhichround1round2round3cherylsBirthdaybitsOfisisBddvalueIn explainStatekvcherylbroOne ageKnsStartrevealTransformer $fEqVariable $fOrdVariable$fShowVariableBddtopbotnegcondisimpequconSetdisSetxorSet forallSet existsSet ifthenelse substitSimulrelabelsizeOf evaluateFun allSatsWith satCountWith restrictSet genGraphWith$fPointedKnowStructBDD$fPointedKnowTransformerBDDStateMapequivalentWith findStateMap knsToKripkeknsToKripkeWithGknsToKripkeMulti kripkeToKnskripkeToKnsWithG booloutofkripkeToKnsMulti uniqueValsobsnobs descableRelssmartKripkeToKnssmartKripkeToKnsWithoutCheckstransformerToActionModelWithG eventToActioneventToActionMultiactionToTransformerWithMap actionToEventactionToEventMulti TransformerTrfMultipointedBelSceneBelScene BelStructBlSTagBddRelBDDmvPcpPunmvcpPunmvuncpcpBddmvBdd texRelBDD bddprefix bddsuffixtrfPost bddReduceevalViaBddReduce$fTagBddDubbel$fUpdateBelStructForm$fSemanticsBelStruct$fHasAgentsBelStruct$fHasVocabBelStruct$fPointedBelStructBdd$fPointedBelStructList$fUpdateBelStructTransformer$fPointedTransformerList$fPointedTransformerList0$fHasPreconditionTransformer$fHasAgentsTransformer$fEqTransformer$fShowTransformer $fEqBelStruct$fShowBelStruct propRel2bdd samplerel relBddOfIn cleanupObsLaw$fArbitraryBelStruct$fOptimizableBelStruct$fTexAbleBelStruct$fTexAbleTransformer$fPointedTransformerBdd blsToKripke kripkeToBlskripkeToBlsUnsafeensureDistinctVal Convertableconvert$fConvertable(,)(,)$fConvertable(,)(,)0ICPlanOwnedLabelledCoopTaskHasPerspectiveasSeenBy isLocalForTaskPlanStopDoCheck IfThenElse OfflinePlanIsPlanreaches reachesOn offlineSearchexecutedixfindPlan flipRelBddppICPlanicSolvesfindSequentialIcPlanfindSequentialIcPlanBFS $fIsPlanList $fIsPlanPlan $fIsPlanPlan0$fHasPerspective(,)$fHasPerspective(,)0$fHasPerspective(,)1$fHasPerspective(,)2$fHasPerspectiveCoopTask $fIsPlanList0 $fEqCoopTask $fOrdCoopTask$fShowCoopTask$fEqTask $fOrdTask $fShowTask$fEqPlan $fOrdPlan $fShowPlan exampleModelexamplePointedModelaliceBddbobBddexampleGenActMexamplePointedActM exampleResult exampleStart exampleEventexampleBlTresultpublicMakeFalseActMpublicMakeFalseTrfmyEventtResultflipOverAndShowTo myOtherEventtResult2 exampleBelScnppttqq sallyInitsallyPutsMarbleInBasketsallyIntermediate1 sallyLeavessallyIntermediate2annePutsMarbleInBoxsallyIntermediate3sallyComesBacksallyIntermediate4 sallyFinalsallyFinalCheckRusCardProblem rcPlayersrcNumOfrcCardsrcPropshasCardhasHand rcExplain allCardsGivenallCardsUnique distribute331rusSCNrusKNS aAnnounce bAnnounceaKnowsBsbKnowsAs cIgnorantrcCheck rcAllCheckscheckSet possibleHandspickHandsNoCrossing allHandLists safeHandLists alicesActions bobsActions rcSolutionsrcPlanrcGoalrcSolutionsViaPlanning distributenCards nCardsGiven nCardsUnique rusSCNforpossibleHandsN allHandListsN aKnowsBsN bKnowsAsN cIgnorantN checkSetFor checkHandsFor allCasesUpTo dontChange noDoubles rusBelScnfor mudScnInit myMudScnInitknowsfathermudScn0mudScn1mudScn2mudKns2emptybuildMC buildResult mudGenKrpInitmyMudGenKrpInit mudBelScnInitmyMudBelScnInittoyPlan willExchangeTinCallinSecTtoBeExchangedTdoCalls whoKnowsWhatsucceeds coinStartflipRandomAndShowTocoinFlip coinResultcardIsAttoPlaydonevocabexplaintoynabiStartFortellplay toynabiGoaltoynabimyStartpublicMakeFalsemyResultmakeFalseShowTo thirdEvent thirdResult problemPM problemKNSatPforPatfor letterStart letterPass letterGoalletterletterStartFor letterLinedmStarttryTaketryTakeLdmGoaldmTaskdmResultdmResultKripke dmResultBobdmResultBobKripkedmdmCoop announce'dmCoop2dmPlan2modelAmodelBknsAknsBredundantModelmyKNSminimizedModel minimizedKNSmyPropupubAnnounceActionexamplePaActiongroupAnnounceActionexampleGroupAnnounceActionexampleGrAnnEventeGrAnLaw actionOne actionTwoversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDirgetDataFileName getSysconfDirRelTokenfooIfooSapnTokenInfixDKnowThatTokenInfixDKnowWhetherTokenInfixCKnowThatTokenInfixCKnowWhetherTokenInfixKnowThatTokenInfixKnowWhether TokenPrefixKw TokenPrefixK TokenExists TokenForall TokenEqui TokenImpl TokenOneOfTokenXorTokenDisTokenCon TokenBinDis TokenBinCon TokenQuestm TokenExclamTokenRATokenLATokenSCBTokenSOBTokenCCBTokenCOBTokenCBTokenOBTokenNegTokenPrpTokenBotTokenTopTokenIntTokenStr TokenComma TokenColon TokenWHEREQ TokenVALIDQ TokenTRUEQTokenOBSTokenLAW TokenVARS utf8EncodeAlexAcc AlexAccSkip AlexAccNone AlexLastAcc AlexLastSkipAlexNone AlexReturn AlexTokenAlexSkip AlexErrorAlexEOFAlexAddrAlexA# LexResultAlexPosnAlexPn AlexInputByte utf8Encode'ignorePendingBytesalexInputPrevChar alexGetByte alexStartPosalexMovealexScanTokens alex_tab_size alex_base alex_table alex_check alex_deflt alex_accept alex_actionsalexScanTokensSafe alex_action_2 alex_action_3 alex_action_4 alex_action_5 alex_action_6 alex_action_7 alex_action_8 alex_action_9alex_action_10alex_action_11alex_action_12alex_action_13alex_action_14alex_action_15alex_action_16alex_action_17alex_action_18alex_action_19alex_action_20alex_action_21alex_action_22alex_action_23alex_action_24alex_action_25alex_action_26alex_action_27alex_action_28alex_action_29alex_action_30alex_action_31alex_action_32alex_action_33alex_action_34alex_action_35alex_action_36alex_action_37alex_action_38alex_action_39alex_action_40alex_action_41alex_action_42alex_action_43alex_action_44alex_action_45alex_action_46alex_action_47alex_action_48alex_action_49alexIndexInt16OffAddralexIndexInt32OffAddr quickIndexalexScan alexScanUser alex_scan_tkn(QuickCheck-2.14.3-EzaT5hJZQaG6V1CwlPQFGfTest.QuickCheck.Arbitraryshrink HappyAddrHappyA#HappyStk Happy_IntList HappyConsParse unsafeParseSparseSparse ParseResult ObserveSpec ObserveLineFormListIntListJobListJobWhereQValidQTrueQ CheckInputHappyAny HappyAbsSynhappyIn6 happyOut6happyIn7 happyOut7happyIn8 happyOut8happyIn9 happyOut9 happyIn10 happyOut10 happyIn11 happyOut11 happyIn12 happyOut12 happyIn13 happyOut13 happyIn14 happyOut14 happyIn15 happyOut15 happyIn16 happyOut16 happyInTok happyOutTok happyExpListhappyExpListPerStatehappyActOffsetshappyGotoOffsetshappyAdjustOffsethappyDefActions happyCheck happyTablehappyReduceArr happy_n_termshappy_n_nonterms happyReduce_3happyReduction_3 happyReduce_4happyReduction_4 happyReduce_5happyReduction_5 happyReduce_6happyReduction_6 happyReduce_7happyReduction_7 happyReduce_8happyReduction_8 happyReduce_9happyReduction_9happyReduce_10happyReduction_10happyReduce_11happyReduction_11happyReduce_12happyReduction_12happyReduce_13happyReduction_13happyReduce_14happyReduction_14happyReduce_15happyReduction_15happyReduce_16happyReduction_16happyReduce_17happyReduction_17happyReduce_18happyReduction_18happyReduce_19happyReduction_19happyReduce_20happyReduction_20happyReduce_21happyReduction_21happyReduce_22happyReduction_22happyReduce_23happyReduction_23happyReduce_24happyReduction_24happyReduce_25happyReduction_25happyReduce_26happyReduction_26happyReduce_27happyReduction_27happyReduce_28happyReduction_28happyReduce_29happyReduction_29happyReduce_30happyReduction_30happyReduce_31happyReduction_31happyReduce_32happyReduction_32happyReduce_33happyReduction_33happyReduce_34happyReduction_34happyReduce_35happyReduction_35happyReduce_36happyReduction_36happyReduce_37happyReduction_37happyReduce_38happyReduction_38happyReduce_39happyReduction_39happyReduce_40happyReduction_40happyReduce_41happyReduction_41happyReduce_42happyReduction_42happyReduce_43happyReduction_43happyReduce_44happyReduction_44happyReduce_45happyReduction_45happyReduce_46happyReduction_46happyReduce_47happyReduction_47happyReduce_48happyReduction_48happyReduce_49happyReduction_49happyReduce_50happyReduction_50happyReduce_51happyReduction_51happyReduce_52happyReduction_52happyReduce_53happyReduction_53happyReduce_54happyReduction_54happyReduce_55happyReduction_55happyReduce_56happyReduction_56happyReduce_57happyReduction_57 happyNewToken happyError_ happyThen happyReturn happyThen1 happyReturn1 happyError'parseCheckInput parseForm parseFormListhappySeq parseError happyParse happyAccept happyDoActionindexShortOffAddrhappyLt readArrayBit happyShifthappySpecReduce_0happySpecReduce_1happySpecReduce_2happySpecReduce_3 happyReducehappyMonadReducehappyMonad2Reduce happyDrop happyDropStk happyGoto happyFail notHappyAtAll happyTcHack happyDoSeq happyDontSeqbaseGHC.Listlookup(HasCacBDD-0.2.0.0-GJRp4QkBQBIKsCFr5pUejQData.HasCacBDD