incremental memory management for haskell

i see 1 last significant drawback of haskell for the software industry : it lacks an incremental memory manager - that is one that does not "stop the world" for big time;

fortunately it is being worked on; its implementation is to land in version 8.10 of the compiler, which is due at about 2019 november;

this video gives an introduction, but i do not recommend to watch it because it is too technical;

union types in Haskell at library level

Scala and Ceylon have union types as language feature;
in Haskell one can have it as a library

short intro to programming language theory

a very short, concise, understandable introduction to programming language theory and its standard notation

https://siek.blogspot.com/2012/07/crash-course-on-notation-in-programming.html

prooving balancedness of search trees in Haskell

the Haskell type system is very powerful compared to the industrial programming languages; a nice demonstration of this is its ability to represent and maintain the invariants of balanced search trees [AVL, red-black]; and the Haskell code is not even longer [or much messier] than the Agda version [Agda is a real dependently typed language, the most popular one currently]
https://doisinkidney.com/posts/2018-07-30-verified-avl.html

prooving invariant of balanced search trees in Haskell

the Haskell type system is very powerful compared to the industrial programming languages; a nice demonstration of this is its ability to represent and maintain the invariants of balanced search trees [AVL, red-black]; and the Haskell code is not even longer [or much messier] than the Agda version [Agda is a real dependently typed language, the most popular one currently]

swapping container layers

swapping container layers

programming language first to learn

i recommend Elm as the first language to learn

linear haskell - the current state

linear haskell - the current state

"dependency"

let us correct the usage of the word "dependency"