slist

slist copied to clipboard

``` Error: setup: Encountered missing or private dependencies: base >=4.10.1.0 &&

l29ah

Property tests

1

For type class instances laws checks.

vrom911

[RFC] Sized Difference List

2

Because of how ordinary lists are implemented in Haskell, left-associative appending of such lists is very slow. The following takes much more time than it should: ```haskell ((((l1 ++ l2)...

chshersh

vrom911

NonEmpty Slist

1

Create another data structure similar to `NonEmpty` implemented through the ordinary list. Something like this: ```haskell data SNonEmpty a = a :| Slist a ```

vrom911

Serializable representations with leading length

1

This is more of a comment for something to keep in mind in future work, rather than an issue about something that exists now in the code. I mention it...

k0001

Create patterns for smooth pattern-matching

2

vrom911

Explore the way how to make it more efficient

vrom911