Closed joews closed 7 years ago
I want to make Peach a statically-typed language with optional annotations (and therefore type inference).
A Damas-Hindley-Milner w/Algorithm W for type inference is a good fit.
Resources:
Done, mostly in c3ebdeb5d144f7cdece2fe7af9fe8bae54e111d7.
I want to make Peach a statically-typed language with optional annotations (and therefore type inference).
A Damas-Hindley-Milner w/Algorithm W for type inference is a good fit.
Resources: