HoldMyType · @xameer
233 followers · 6433 posts · Server mathstodon.xyzpolymorphic 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
Julien M. · @julm
485 followers · 4935 posts · Server framapiaf.org#StephanieWeirich : "#StronglyTyped #SystemF in #GHC"
"This project demonstrates my solution to this #challenge using the #Haskell #programming #language, assisted by the #singletons library. Because I had a lot of fun completing this challenge, I wrote up this solution as a #tutorial of #DependentlyTyped programming in #GHC."
https://github.com/sweirich/challenge/blob/canon/debruijn/overview.md
https://youtube.com/watch?v=GxP-ufWyj3s
https://www.youtube.com/watch?v=j2xYSxMkXeQ
#DependentlyTyped #tutorial #singletons #language #programming #haskell #challenge #ghc #SystemF #StronglyTyped #stephanieweirich