write-you-a-haskell
Algorithm-W-Step-By-Step
| write-you-a-haskell | Algorithm-W-Step-By-Step | |
|---|---|---|
| 4 | 2 | |
| 3,304 | 239 | |
| - | - | |
| 0.0 | 10.0 | |
| over 3 years ago | about 14 years ago | |
| Haskell | Haskell | |
| MIT License | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
write-you-a-haskell
-
A decade of developing a programming language
I highly recommend https://github.com/sdiehl/write-you-a-haskell as it is very developer friendly. It’s not complete, but it really gets the gears turning and will set you up for writing your own Hendley-Milner style type checker.
-
Type inference of letrec in Algorithm W
This is the best resource I know of: http://dev.stephendiehl.com/fun/006\_hindley\_milner.html https://github.com/sdiehl/write-you-a-haskell/blob/master/chapter7/poly_constraints/src/Infer.hs
- Write You A Haskell: "I would absolutely love to see this book completed!"
-
Monthly Hask Anything (November 2021)
I feel like Write You A Haskell was set out to introduce some of these foundational concepts in the right order: lambda calculus, to system-f to core - but that's more of a skeleton, right? What about logic? proofs? Is there anything else ... that can all be put together to create a "course" of some sort to master the theoretical concepts that Haskell stands upon?
Algorithm-W-Step-By-Step
-
Algorithm W (Step by step)
I get "download limit exceeded" but it is freely available here too.
-
Type inference of letrec in Algorithm W
While trying out the excellent tutorial on HM type inference https://github.com/wh5a/Algorithm-W-Step-By-Step I noticed that this implementation does not support recursive let bindings ("letrec"), which are necessary for example for implementing "fix".
What are some alternatives?
algebra-driven-design - Source material for Algebra-Driven Design
Amateurlog - A miniature Prolog interpreter + compiler so I can write about it
type-level-bst - Type-Level Binary Search Tree in Haskell
distributive - Dual Traversable
articles - Miscellaneous articles. The readme is the table of contents.
type-eq - Type equality evidence you can carry around
brainfuck - This is an interpreter of the brainf*ck language, written in the pure, lazy, functional language Haskell.
TreadMarks - Battle tank combat racing!
sense-lang - Sense is a very high level, functional programming language for creating software by writing only the absolute necessary information and not a single line above that.
meta-cedille - Minimalistic dependent type theory with syntactic metaprogramming
mappy - A functional programming language. Like LISP but focused around maps rather than lists.
fyg-lang - Fyg is a simple high-level, functional-imperative with runtime type safety for the aspiring grug