⭐ *Enroll:* dmitrysoshnikov.com/courses/typechecker/ 👉 *DS Education:* www.dmitrysoshnikov.education/p/typechecker/ 📚 In which order to take my courses: dmitrysoshnikov.com/courses/compiler-engineer-path/
Just discovered your channel and this couldn't have come at a better time. I'm working on a compiler right now and I'm just about finished with parsing. Looking forward to this series.
14:06 Can the types here be defined as generics? So that the + operator is defined for any type. (The goal would be to have a single plus operator instead of needing separate operators for different types, like + for numbers and ++ for strings, like in ReScript).
Yes, as on 15:50 a generic function can either be parametrized by an explicit type parameter, or in case of the full inference, multiple signatures can be inferred based on the allowed operations for the basic operators.
Yes, but less in a theoretical algorithm following. This course focuses on a practical type checking with explicit type annotations for function parameters and return types. We don't do implicit inference (like Hindley-Milner) for "untyped" programs, which would be a separate course.
⭐ *Enroll:* dmitrysoshnikov.com/courses/typechecker/
👉 *DS Education:* www.dmitrysoshnikov.education/p/typechecker/
📚 In which order to take my courses: dmitrysoshnikov.com/courses/compiler-engineer-path/
Just discovered your channel and this couldn't have come at a better time. I'm working on a compiler right now and I'm just about finished with parsing. Looking forward to this series.
So excited to start this course
Finally! Thank you, Dmitry, I've been waiting for the typechecker course. Learned a lot from your other classes.
Dmitry I love your lectures on interpreters, so I can’t wait to watch this series!
Really appreciate the time you put into your videos. I was hoping you'd make a series on types. Your other series were hugely helpful for me
Great stuff as usual, Dmitry! I’ll be signing up for this one as soon as I have a bit of time to dedicate to it :)
14:06 Can the types here be defined as generics? So that the + operator is defined for any type. (The goal would be to have a single plus operator instead of needing separate operators for different types, like + for numbers and ++ for strings, like in ReScript).
Yes, as on 15:50 a generic function can either be parametrized by an explicit type parameter, or in case of the full inference, multiple signatures can be inferred based on the allowed operations for the basic operators.
Thanks for the videos. Just curious, what app(s) do you use for presenting your content?
Thanks for the feedback. This is a combination of software: GoodNotes, Camtasia, live editing on iPad, etc.
What kind of algorithm will your implementation be based on? Is it bidirectional type checking?
Yes, but less in a theoretical algorithm following. This course focuses on a practical type checking with explicit type annotations for function parameters and return types. We don't do implicit inference (like Hindley-Milner) for "untyped" programs, which would be a separate course.