write-you-a-haskell
example
write-you-a-haskell | example | |
---|---|---|
4 | 7 | |
3,304 | 2,460 | |
- | 0.6% | |
0.0 | 6.7 | |
over 3 years ago | 3 months ago | |
Haskell | Go | |
MIT License | BSD 3-clause "New" or "Revised" 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?
example
-
A decade of developing a programming language
I'm in the same boat as you -- here are the two best resources I found:
https://mukulrathi.com/create-your-own-programming-language/...
https://jaked.org/blog/2021-09-07-Reconstructing-TypeScript-...
I read through the first 10 chapters of TAPL, and skimmed the rest. The first 10 chapters were good to remind myself of the framing. But as far as I can tell, all the stuff I care about is stuffed into one chapter (chapter 11 I think), and the rest isn't that relevant (type inference stuff that is not mainstream AFAIK)
This is also good:
https://github.com/golang/example/blob/master/gotypes/README...
And yeah I think we had the same conversation on Reddit -- somebody needs to make a Crafting Interpreters for type checking :) Preferably with OOP and functional and nominal/structural.
-
Slog: Zero-dependency structured logging in Go
A guide covering how to write custom handlers is out of scope for this post, but you can find one such guide written by the author of slog here. Thankfully, you don’t need to write a handler from scratch to use one. There are several community-contributed handlers, including handlers that allow you to output colored logs, and a handler that lets you implement sampling. You can find a full list here.
- A Guide to Writing Slog Handlers
-
[blog post] Ten challenges for Rust
I am not too familiar with how Go does things, but it, eg, exposes Go type-checker via stdlib: https://github.com/golang/example/tree/master/gotypes. Similarly, I believe gofmt uses the ast package from stdlib, rather private compiler internals like rustfmt.
- go/types: The Go Type Checker
-
Can't get gopls to work with nvim-lsp
So I just cloned this git repo https://github.com/golang/example and as soon as I entered the hello/hello.go file I was able to get autocomplete and error checking. I don't understand why it isn't working with just a .go file I made.
-
I'm not sure where to begin. I find programming exhausting.
GitHub repsoitories: - https://github.com/golang/example - https://github.com/gothinkster/flask-realworld-example-app - https://github.com/gothinkster/rails-realworld-example-app
What are some alternatives?
algebra-driven-design - Source material for Algebra-Driven Design
nvim-lspconfig - Quickstart configs for Nvim LSP
type-level-bst - Type-Level Binary Search Tree in Haskell
slog-sampling - 🚨 slog sampling: drop repetitive log records
distributive - Dual Traversable
pattern-matching-in-rust - Pattern matching and exhaustiveness checking algorithms implemented in Rust
articles - Miscellaneous articles. The readme is the table of contents.
fyg-lang - Fyg is a simple high-level, functional-imperative with runtime type safety for the aspiring grug
type-eq - Type equality evidence you can carry around
hm - a simple Hindley-Milner type system in Go
brainfuck - This is an interpreter of the brainf*ck language, written in the pure, lazy, functional language Haskell.
TreadMarks - Battle tank combat racing!