write-you-a-haskell
hatsugen
| write-you-a-haskell | hatsugen | |
|---|---|---|
| 4 | 3 | |
| 3,304 | 5 | |
| - | - | |
| 0.0 | 2.1 | |
| over 3 years ago | about 1 year ago | |
| Haskell | Lean | |
| MIT License | 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?
hatsugen
-
A decade of developing a programming language
Might this help? I wrote it: https://azdavis.net/posts/define-pl-01/
-
Rust in 2023 - azdavis
Perhaps my own series of posts? It starts here.
-
Memories: Edinburgh ML to Standard ML
2. Preservation states that if you have a program that type-checks _and_ that can continue evaluating, _as_ it continues to evaluate, it _continues_ to type-check.
Note that the conclusion of preservation 'feeds back' into progress: the program type-checks. And vice versa: progress may state as its conclusion that the program can continue evaluating, which then lets you apply preservation. This means you can keep applying the progress and preservation theorems in a 'loop' until the program is done evaluating.
For each of the 4 posts in my series about formal semantics, I duly translated the rules presented in the blog post into Lean code, and then proved that the rules do satisfy the safety properties. For example, for the first post linked above:
- The syntax of the language: https://github.com/azdavis/hatsugen/blob/part-01/src/syntax....
What are some alternatives?
algebra-driven-design - Source material for Algebra-Driven Design
pkg - Package your Node.js project into an executable
type-level-bst - Type-Level Binary Search Tree in Haskell
rust - Empowering everyone to build reliable and efficient software.
distributive - Dual Traversable
sml-buildscripts - Scripts to compile and run Standard ML programs defined in .mlb files.
articles - Miscellaneous articles. The readme is the table of contents.
hm - a simple Hindley-Milner type system in Go
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.