úÎr2     ƒA library providing length-indexed and element-indexed lists which sit somewhere between homogeneous and fully heterogeneous lists. Copyright (c) 2014 Kenneth Fonerkenneth.foner@gmail.com experimental non-portable Safe-Inferred!"&'(2346=HJKMªConic lists are lists where each element is an (f a) for some a, but the a may be different for each element. Types of elements are kept track of in the type of the list.   ƒA library providing length-indexed and element-indexed lists which sit somewhere between homogeneous and fully heterogeneous lists. Copyright (c) 2014 Kenneth Fonerkenneth.foner@gmail.com experimental non-portable Safe-Inferred!"&'(2346=HJKM 0Counted lists are indexed by length in the type. The  = of a list is the natural number corresponding to its length. 1Convert a counted list to a regular Haskell list.1Replicate some element a certain number of times.jAppending two counted lists yields one of length equal to the sum of the lengths of the two initial lists.mTake the nth element of a list. We statically prevent taking the nth element of a list of length less than n.‘Pad the length of a list to a given length. If the number specified is less than the length of the list given, it won't pass the type-checker.$Zip two equal-length lists together.       ƒA library providing length-indexed and element-indexed lists which sit somewhere between homogeneous and fully heterogeneous lists. Copyright (c) 2014 Kenneth Fonerkenneth.foner@gmail.com experimental non-portable Safe-Inferred!"'=HMTurn a   into a " by means of a function from some a to an (f t).!Given a function to collapse any (f t) into an a , turn a  into a  .       IndexedList-0.1.0.0Data.List.Indexed.ConicData.List.Indexed.CountedData.List.IndexedTackLength Replicate ConicListConicNil:-:Niltack CountedList CountedNil:::countunCount replicateappendnthpadTozip$fApplicativeCountedList$fFunctorCountedList$fShowCountedList heterogenize homogenize