3      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                     !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~(c) Fumiaki Kinoshita 2017BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com> Trustworthy%&*+,059:;DIOQRT  :: Getter s a -> s -> a & :: Getter s a -> (a -> r) -> (s -> r) * :: Setter s t a b -> (a -> b) -> (s -> t)      (c) Fumiaki Kinoshita 2017BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com>None%&*+,/023459:;DIOQRT Poly-kinded productPoly-kinded ConstPoly-kinded composition&The extensible data types should take k -> *T as a parameter. This class allows us to take a shortcut for direct representation. h v! is the actual representation of h v.This is an isomorphism between h v and  h v. !_Wrapper :: Iso' (h v) (Repr h v)Restricted version of .. It is useful for eliminating ambiguousness.Wrap a result of        (c) Fumiaki Kinoshita 2017BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com> Trustworthy%&*+,/059:;<=?DIOQRT[Ideally, it will be 'Map Succ'8The successor of the number9Converts type naturals into .;Type level binary number@FindType typesBUnicode flipped alias for NEA readable type search resultII k v xs is essentially identical to  (k :> v) " xs , but the type v is inferred from k and xs.KA synonym for (M)LThe kind of key-value pairsNx is a member of xsPThe position of x in the type level set xs.R Generates a P2 that corresponds to the given ordinal (0-origin).SRemember that  Member xs x from P.U/Embodies a type equivalence to ensure that the P points the first element.V Compare two Ps.W There is no P of an empty list.XThe P points the first elementYThe next membership089:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`ab489:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXY#PQQRTUVWXYNOSB@LMKIJCDEFGH;<=>9:8A?#89:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abM0(c) Fumiaki Kinoshita 2017BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com> Trustworthy%&*+,059:;DIOQRTdefghijdefghijdefghijdefghijf5(c) Fumiaki Kinoshita 2017BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com>None%&*+,059:;<=DIOQRT lEvery element in xs satisfies cmEnumerate all possible Ps of xs with an additional context.o(Every type-level list is an instance of o.pEnumerate all possible Ps of xs.q Count the number of memberships.r Enumerate Ps and construct an d.sThis class allows us to use t for both sums and products.uAccessor for an element.vLike u%, but reckon membership from its key.w-Access a specified element through a wrapper.x$Access an element through a wrapper.y>Access an element specified by the key type through a wrapper.klmnopqrstuvwxyz{|}#@BCDEFGHIJKLMNOPRSUVklmnopqrstuvwxy#stuvwxyPRVUNOSB@opqrlmnkLMKIJCDEFGHklmnopqrstuvwxyz{|}(c) Fumiaki Kinoshita 2017BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com>None$%&*+,059:;<=BDIOQRT~ The type of extensible products. (:*) :: (k -> *) -> [k] -> *A pointer to an element in a .Mutable type-indexed struct.Write a value in a .Read a value from a .Get a  from a name. Create a new  using the supplied initializer. Create a  full of the specified value. Create a new / using the supplied initializer with a context. Create a new  from an HList.Turn ) into an immutable product. The original  may not be used. Create a new  from a product.The size of a product.$Right-associative fold of a product.Convert a product into an HList. Create a new ! using the contents of a product.Get an element in a product.Create a product from an  action which returns a .!~~~~(c) Fumiaki Kinoshita 2017BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com>None%&*+,/059:;<=DIOQRTbThe extensible sum type (:|) :: (k -> *) -> [k] -> *Change the wrapper.O(1) lift a value."Try to extract something you want."Try to extract something you want.O(1) Naive pattern matchThere is no empty union.&Embed a value, but focuses on its key. 1 (c) Fumiaki Kinoshita 2017BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com> Trustworthy$%&*+,/059:;<=DIOQRT:O(n) Prepend an element onto a product. Expressions like a <: b <: c <: nil are transformed to a single .Strict version of ().An empty product.Convert  into a product.Flipped -Map a function to every element of a product.;Transform every element in a product, preserving the order.   "a   (f . g) "a  f .  g  for heterogeneous product for heterogeneous product1Map elements to a monoid and combine the results.  f .  g "a  (f . g)! with the membership of elements.$ with a constraint for each element.$ with a constraint for each element.<Traverse all elements and combine the result sequentially.  htraverse (fmap f . g) "a fmap (hmap f) . htraverse g htraverse pure "a pure htraverse (Comp . fmap g . f) "a Comp . fmap (htraverse g) . htraverse f  analog for extensible products The dual of  The dual of  with Ps.*A product filled with the specified value.3Construct a product using a function which takes a P.  f ( g) "a  (f . g)  ( m) "a m  ( k) "a k  version of .Pure version of .*A product filled with the specified value. version of .Accumulate sums on a product.  haccum =  Group sums by type.$Evaluate every element in a product.)lmnopqr~)~opqrlmn00 None%&*+,059:;<=DIOQRT%Composition for a class and a wrapperForall upon a wrapper0Reify a collection of dictionaries, as you wish. (c) Fumiaki Kinoshita 2017BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com>None%&*+,059:;<=DIOQRT  Similar to , but this focuses on keys. xs (k ':> v) is equivalent to I k v xsys contains xsUnicode alias for 'Reify the inclusion of type level sets.O(n) Select some elements.O(1) Embed to a larger union.'Reify the inclusion of type level sets.O(n) Select some elements.O(1) Embed to a larger union.   (c) Fumiaki Kinoshita 2017BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com>None%&*+,059:;DIOQRT)Turn a wrapper type into a clause for it.ORetrieve the contents so that they matches and pass both to the given function.$Applies a function to the result of .O(1) Perform pattern matching.Flipped 0 (c) Fumiaki Kinoshita 2017BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com>None%&*+,/059:;<=DIOQRT*A ghostly type which spells the field name!Signifies a field name internally4When you see this type as an argument, it expects a  FieldLensA. This type is used to resolve the name of the field internally."The trivial inextensible data type FieldOptic s; is a type of optics that points a field/constructor named s.The yielding fields can be  Jhttp://hackage.haskell.org/package/lens/docs/Control-Lens-Lens.html#t:LensLenses for s and  Khttp://hackage.haskell.org/package/lens/docs/Control-Lens-Lens.html#t:PrismPrisms for s. ( "foo" = Associate "foo" a xs => Lens' ( xs) a ) "foo" = Associate "foo" a xs => Prism' ( xs) a s can be generated using mkField defined in the Data.Extensible.TH module.Simple variant Simple record The dual of  )VariantOf :: (v -> *) -> [Assoc k v] -> *1The type of records which contain several fields. (RecordOf :: (v -> *) -> [Assoc k v] -> *A  h (k ':> v) is h v annotated with the field name k.  :: (v -> *) -> Assoc k v -> *Combined constraint for LTake the type of the valueTake the type of the key Proxy-level . This is useful when using . Lift a function for the content. Lift a function for the content. An empty .*Select a corresponding field of a variant.Pattern matching on a #Annotate a value by the field name.Lifted ()+Annotate a value by the field name without .'Kind-monomorphic, unwrapped version of ('=')@ Shows in field @= value" style instead of the derived one.1111(c) Fumiaki Kinoshita 2017BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com>None%&*+,059:;DIOQRT1Throwing an exceptionAn effect with no result(,) already is a writer monad.fThe reader monad is characterised by a type equality between the result type and the enviroment type. [a, b, c] r is a -> b -> c -> r)Anonymous representation of instructions.Transformation between effectsA function to bind an   in %. The extensible operational monad .A unit of named effects. This is a variant of (:|)! specialised for 'Type -> Type'."Lift an instruction onto an  action.#Lift an instruction onto an + action and apply a function to the result.$/Censor a specific type of effects in an action.%7Build a relay-style handler from a triple of functions. `runStateEff = peelEff1 (a s -> return (a, s)) (m k s -> let (a, s') = runState m s in k a s') &%/ specialised for continuations with no argument'%( specialised for 1-argument continuation(*A common value for the second argument of %!. Binds an instruction directly.)/A pre-defined value for the second argument of %.. Preserves the argument of the continuation.*/A pre-defined value for the second argument of %/. Preserves two arguments of the continuation.+Reveal the final result of .,Tear down an action using the  instance of the instruction.- Process an  action using a record of s..Pass the arguments of  to the supplied function./ Create a  of a  for an .0Specialised version of % for s. You can pass a function a -> b -> ... -> (q -> r) -> r as a handler for  '[a, b, ...] q.1$Non continuation-passing variant of 0.2Fetch the environment.3#Pass the environment to a function.4Modify the enviroment locally.5Run the frontal reader effect.6Get the current state.7%Pass the current state to a function.8#Replace the state with a new value.9Modify the state.:#Lift a state modification function.;Run the frontal state effect.<Run the frontal state effect.=6Write the second element and return the first element.>Write a value.?/Squash the outputs into one step and return it.@3Modify the output using the function in the result.ARun the frontal writer effect.BRun the frontal state effect.C,Run an effect which may fail in the name of k.DThrow an exception e,, throwing the rest of the computation away.E"Attach a handler for an exception.FRun the frontal Either effect.G!Put a milestone on a computation.HRun a computation until G.8 !"#$%Re-bind an unrelated actionreturn the result%Handle the foremost type of an action&return the result%Handle the foremost type of an action'return the result%Handle the foremost type of an action()*+,-./0Re-bind an unrelated actionreturn the resultHandle the foremost action1Handle the foremost action23456789:;<=>?@ABCDEFGH8 !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGH8 !"#$-%(&)'*+,./0123456789:;<=>?@ABCDEFGH3 !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGH/1(c) Fumiaki Kinoshita 2017BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com>None%&*+,059:;<=DIOQRTIJKLMNOPQRSTUVWXY IJKLMNOPQR MNLOKPJQIRIJKLMNOPQRSTUVWXY(c) Fumiaki Kinoshita 2017BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com>None%&*+,059:;<=DIOQRTZSpecialised version of y.Z[\Z\Z[Z[\(c) Fumiaki Kinoshita 2017BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com>None%&*+,059:;DIOQRT[] Wrapped Maybe` Apply a function to its content.aThe inverse of .bA product filled with ] c,Extend a product and fill missing fields by Null.d)Narrow the range of the sum, if possible. ]^_`abcdef]^_`abcdbacd]^_`]^_`abcdef(c) Fumiaki Kinoshita 2017BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com> Trustworthy%&*+,059:;DIOQRT[lAlias for plain sumsmAlias for plain productsnO(log n) Add a plain value to a product.oExtract a plain value.pEmbed a plain value.q)Naive pattern matching for a plain value.r%An accessor for newtype constructors.lmnopqrlmnopqrmlnopqrlmnopqrn5q1(c) Fumiaki Kinoshita 2017BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com>None%&*+,059:;DIOQRT[s3The class of types that can be converted to/from a .wConvert a value into a .x Convert a  to a value.y 5record :: IsRecord a => Iso' a (Record (RecFields a))z Create an s* instance for a normal record declaration. stuvwxyz{stuvwxyzstuvwxyz stuvwxyz{(c) Fumiaki Kinoshita 2017BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com> Trustworthy$%&*+,059:;DIOQRT[|Generate fields using y. | "foo Bar" defines: Rfoo :: FieldOptic "foo" foo = itemAssoc (Proxy :: Proxy "foo") _Bar :: FieldOptic Bar" _Bar = itemAssoc (Proxy :: Proxy Bar) }/Generate named effects from a GADT declaration. LdecEffects [d| data Blah a b x where Blah :: Int -> a -> Blah a b b |]  generates type Blah a b = "Blah" >: Action '[Int, a] b blah :: forall xs a b . Associate "Blah" (Action '[Int, a] b) xs => Int -> a -> Eff xs b blah a0 a1 = liftEff (Data.Proxy.Proxy :: Data.Proxy.Proxy "Blah") (AArgument a0 (AArgument a1 AResult)) ~WInstead of making a type synonym for individual actions, it defines a list of actions.KGenerates type synonyms for the set of actions and also individual actions.|}~(generate a synonym of the set of actions(generate synonyms for individual actions|}~|}~|}~(c) Fumiaki Kinoshita 2017BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com>None%&*+,059:;DIOQRT h xs mA is the monad of computations that may depend on the elements in xs.#Hitch an element associated to the  through a wrapper.6Take a value from the tangles. The result is memoized.Run a 8 action and return the result and the calculated values.Run a  action.-Run tangles and collect all the results as a .  tangle matrixpre-calculated values tangle matrixpre-calculated values tangle matrixpre-calculated values  (c) Fumiaki Kinoshita 2017BSD3'Fumiaki Kinoshita <fumiexcel@gmail.com>None%&*+,059:;DIOQRT @BCDEFGHIJKLMNOPRSUVklmnopqrstuvwxy~ !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHZ]^_`abcdlmnopqrstuvwxyz|}~ !"#$%&''(()**+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ ~                                                      ! "#$%&'()*++,-.//0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijkklmnopqrstuvwxyz{|}~h  'extensible-0.4.3-FkffA4htkw4Gohvgxa4tQxData.Extensible.EffectData.Extensible.Internal.RigData.Extensible.WrapperData.Extensible.InternalData.Extensible.HListData.Extensible.ClassData.Extensible.StructData.Extensible.SumData.Extensible.ProductData.Extensible.DictionaryData.Extensible.InclusionData.Extensible.MatchData.Extensible.FieldData.Extensible.Effect.DefaultData.Extensible.LabelData.Extensible.NullableData.Extensible.PlainData.Extensible.RecordData.Extensible.THData.Extensible.TangleLHListData.ExtensiblebaseData.Functor.IdentityIdentitytransformers-0.5.2.0 Control.Monad.Trans.State.StrictStateExchangeOptic'OpticviewviewsoverwithIsoreview$fProfunctorExchangeProdConst' getConst'CompgetCompWrapperRepr_Wrapper _WrapperAscomp$fWrapperkProd $fNFDataProd$fWrapperkProxy$fWrapperkConst'$fWrapperkComp$fWrapperTYPE[]$fWrapperTYPEMaybe$fWrapperTYPEIdentity $fShowComp$fEqComp $fOrdComp $fNFDataComp $fGenericComp $fShowConst' $fEqConst' $fOrdConst'$fGenericConst'$fNFDataConst'$fFunctorConst'$fFoldableConst'$fTraversableConst' $fShowProd$fEqProd $fOrdProd $fGenericProd $fFunctorProd$fFoldableProd$fTraversableProd$fTraversableComp$fFoldableComp $fFunctorCompSucc KnownPositiontheIntNatZeroDNatSDNatLastFindTypeHead∈ FindAssoc Elaborate Elaborated ExpectingMissing Duplicate Associate association>:Assoc:>Member membership Membership getMemberId mkMembershiprememberreifyMembership leadershipcompareMembershipimpossibleMembershipherenavNext$fKnownPositionNatSDNat$fKnownPositionNatDNat$fKnownPositionNatZero$fSemigroupMembership$fOrdMembership$fEqMembership$fShowMembership$fAssociatevkkvxs $fMemberkxsx$fNFDataMembershipHNilHCons htraversehtraverseWithIndexhfoldrWithIndexhlengthForallFForall henumerateForhgenerateListForGenerate henumeratehcount hgenerateList ExtensiblepieceAtpiece pieceAssocitemAtitem itemAssoc $fForallac: $fForallkc[] $fGeneratek: $fGeneratek[]:*WrappedPointerStructsetget atomicModify atomicModify' atomicModify_atomicModify'_-$>new newRepeatnewFor newFromHList unsafeFreezethawtoHListnewFromhlookuphfrozenhmodify$fExtensiblekfp:*$fHasUpdateWrappedPointeraa$fHasSetterWrappedPointera$fHasGetterWrappedPointera:|EmbedAthoistembedstrikestrikeAt<:|exhaust embedAssoc$fExtensiblekfp:| $fBounded:|$fEnum:|<:@:>@==$fProfunctorLabelPhantom$fExtensiblekfpInextensible $fShowField$fWrapperAssocField$fKeyValuevkpkpv:>$fGenericField $fNFDataField$fBoundedField $fEnumField $fMonoidField$fStorableField$fSemigroupField$fRealFracField$fRealFloatField $fRealField$fFloatingField$fFractionalField$fIntegralField $fNumField $fOrdField $fEqField EitherEffMaybeEff WriterEff ReaderEffFunctionActionAResult AArgument InterpreterrunInterpreterRebinderEff InstructionliftEffliftsEffhoistEffpeelEffpeelEff0peelEff1 rebindEff0 rebindEff1 rebindEff2leaveEff retractEff handleEff runAction@!? peelAction peelAction0askEffasksEfflocalEff runReaderEffgetEffgetsEffputEff modifyEffstateEff runStateEff execStateEff writerEfftellEff listenEffpassEff runWriterEff execWriterEff runMaybeEffthrowEffcatchEff runEitherEfftickEff runIterEff EitherDefMaybeDef WriterDefStateDef ReaderDef runReaderDef runStateDef runWriterDef runMaybeDef runEitherDef$fMonadPlusSkeleton$fAlternativeSkeleton$fMonadErroreSkeleton$fMonadWriterwSkeleton$fMonadStatesSkeleton$fMonadReaderrSkeleton$fMonadIOSkeleton訊$fIsLabelk(->)$fIsLabelkProxyNullable getNullable mapNullable coinclusionvacancywrenchretrench$fMonoidNullable$fWrapperkNullable$fShowNullable $fEqNullable $fOrdNullable$fGenericNullable$fNFDataNullableOneOfAllOf<%pluckbury<%| accessingIsRecord RecFieldsrecordFromList recordToListtoRecord fromRecordrecordderiveIsRecord $fIsRecord()mkField decEffects decEffectSetdecEffectSuitecustomDecEffectsTangleT unTangleTlassohitchAt runTangleT evalTangleT runTangles$fMonoidTangleT$fSemigroupTangleT$fMonadTransTangleT$fFunctorTangleT$fApplicativeTangleT$fMonadTangleTGHC.BasefmapMapSuccghc-prim GHC.TypesWord MapSuccKey Remembrance~~Data.Type.Equalityouterinnerapply gcastWithcastWithtranssym:~:Refl TestEquality testEquality== Data.Proxy asProxyTypeOfProxyKProxyproxyKeyGHC.STSTHProductnewDict newForDictunsafeMembershipidGHC.ListzipWithzipWith3Data.Traversablesequence ApplicativegetAssociation Associated' GHC.TypeLits symbolValMonad contState contWriterpReaderpStatepWriterpEitherNothingtvName shape2Pat shape2Expcon2EfffromMangledGADTvarsT effectFunD effectFunT uniqueNames typeListT associateT effClause