Keean Schupke

In Haskell this: ``` data Nil = Nil data Cons a b = Cons a b class List a instance List Nil instance (List b) => List (Cons a b)...

A couple of things. First I think we should support multi-parameter type classes (with type-families, aka associated types) in full. People do not have to use the full power of...

Regarding lazyness, nothing above changes with regard to the type system, all the Haskell types can be annotated with strictness annotations to make them strict. The type system has to...

@shelby3 wrote: > Stictness annotations don't remove bottom populated in the type because it is a fundamental fact that non-termination is a value in a lazy language. It doesn't matter....

@NodixBlockchain I think Stepanov's "Elements of Programming" is one of the best books on Generics I have read. I recommend reading it from start to finish several times. It is...

@NodixBlockchain Try "Data Structues and Network Algorithms" by Robert Endre Tarjan, which is a book on algorithms recommended by Stepanov.

This is what electronics design tools like Symplectic do. The problem is that designs like this are very hard to reason about and verify. When I worked on VLSI designs...

@NodixBlockchain The computational model for streams is called "codata". Haskell deals with this very nicely - lazy computation and codata go together very well, just like eager computation goes with...

I like clojure's approach to exactly these kind of systems, which it calls an "Epochal timeline" I think. Clojure is dynamically typed, but they have developed "spec" to specify wire...

I am not sure I like `pluggable` for a type-class. If it's going to have that many letters either `interface` or `typeclass` would be better. ``` interface List ``` I...