úÎKH   (C) 2016 Csongor KissBSD3*Csongor Kiss <kiss.csongor.kiss@gmail.com> experimental non-portableSafe'(>KLAnalogous to Data.List.++Analogous to Data.List.elem)Analogous to `Data.List.filter (/= x) xs`Analogous to Data.List.nullAnalogous to Data.List.nub(C) 2016 Csongor KissBSD3*Csongor Kiss <kiss.csongor.kiss@gmail.com> experimental non-portableSafe'(3457;>KLN(Analogous to the regular expression (a+)(Analogous to the regular expression (a?)(Analogous to the regular expression (a*)ÿSequence regular expression terms. The traditional regular expression matched character-by-character, in that case, this sequencing would delimit character-rules. Here, we're matching types in a type-level list. (as opposed to characters in a list, aka String) +Analogous to the regular expression (a | b) %The constraint is satisfied when the input' matches the given regular expression re. :example :: ('[a] ~= (Int :| Char)) => a -> a example = id  The functon example> can only satisfy the types `Int -> Int' and `Char -> Char`'."  !"#$ % &    !"#$ % &'      !"#$% "&'(regex_JRJmyiym9oZ5f3Ir5tWcVYData.Type.Regex.ListUtilsData.Type.Regex++Elem FilterOutIsNullNubPlusOptRep:>:|~=Comb2Comb1BindMakeMakeMakeNDASndFstTry AnyAccepted LabelsOf'LabelsOfAllTransitionsTransitionsFromTo IsTerminalAccepts'AcceptsLabelCEpsRENullTermSeqAltToTerm$f~=[]REinputre