Îõ³h$’      Safe&'(>Àà logict-sequenceôBased on the LogicT improvements in the paper, Reflection without Remorse. Code is based on the code provided in: 2https://github.com/atzeus/reflectionwithoutremorseÊNote: that code is provided under an MIT license, so we use that as well.= !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJK    Ì      !"#$"%&"%'"%("%)"%*"%+"%,"%-"./".0"12"13"#4"#5"#6"#7"#8"#9"#:"#;"#<"#="#>"#?"#@"#A"1B"CD"CE"CF"CG"HI"%J"%K"%L"%M"%N"%O"%P"%Q"%R"%S"%TÕlogict-sequence-0.1.0.1-inplaceControl.Monad.Logic.Sequencetransformers-0.5.6.2Control.Monad.Trans.Classlift MonadTransSeqSeqTMSeqgetMS AsUnitLoopULQueue observeAllTobserveTobserve observeMaybeT observeMaybe observeAll$fTraversableMSeq$fFoldableMSeq $fFunctorMSeq$fSequenceMSeq $fMonadIOSeqT$fMonadLogicSeqT$fMonadTransSeqT $fMonoidSeqT$fSemigroupSeqT$fMonadPlusSeqT$fMonadFailSeqT $fMonadSeqT$fAlternativeSeqT$fApplicativeSeqT $fFunctorSeqTbase Control.MonadguardGHC.BasejoinMonadreturn>>=>>Functorfmap<$Control.Monad.Fail MonadFailfailData.TraversablesequencemapMmfilter<$!>unless replicateM_ replicateMfoldM_foldM zipWithM_zipWithM mapAndUnzipMforever<=<>=>filterMforM Data.Foldablemsum sequence_forM_mapM_ Data.FunctorvoidapliftM5liftM4liftM3liftM2liftMwhen=<< MonadPlusmzeromplus