a simple extension to the prenex fragment of #SystemF that allows closures to be stack-allocated.
https://arxiv.org/abs/2108.07389
polymorphic calculi like #systemF, it would be nice to be able to infer the type abstractions and applications, and omit the annotations on λs as above. This is also undecidable, but the proof is much harder
https://cs.stackexchange.com/questions/12691/what-makes-type-inference-for-dependent-types-undecidable/12957#12957
I just finished the State section of #systemf's #fpcourse! I wanted to double down on learning #haskell before I got back to working on projects.
https://gist.github.com/hyperrealgopher/2990e00193f65a56009fac37cec0372c
A link to my older solutions: https://fosstodon.org/@hyperrealgopher/105960643461269805