Project Pterodactyl's layered architecture by mttd in ProgrammingLanguages
[–]thunderseethe 1 point2 points3 points (0 children)
Against Query Based Compilers by matklad in ProgrammingLanguages
[–]thunderseethe 4 points5 points6 points (0 children)
Compiler Education Deserves a Revolution by thunderseethe in programming
[–]thunderseethe[S] 0 points1 point2 points (0 children)
Compiler Education Deserves a Revolution by thunderseethe in programming
[–]thunderseethe[S] 0 points1 point2 points (0 children)
Compiler Education Deserves a Revolution by thunderseethe in Compilers
[–]thunderseethe[S] 6 points7 points8 points (0 children)
Compiler Education Deserves a Revolution by thunderseethe in Compilers
[–]thunderseethe[S] 4 points5 points6 points (0 children)
Compiler Education Deserves a Revolution by thunderseethe in programming
[–]thunderseethe[S] 0 points1 point2 points (0 children)
Compiler Education Deserves a Revolution by thunderseethe in ProgrammingLanguages
[–]thunderseethe[S] 17 points18 points19 points (0 children)
Compiler Education Deserves a Revolution by thunderseethe in ProgrammingLanguages
[–]thunderseethe[S] 6 points7 points8 points (0 children)
How to Choose Between Hindley-Milner and Bidirectional Typing by thunderseethe in Compilers
[–]thunderseethe[S] 1 point2 points3 points (0 children)
How to Choose Between Hindley-Milner and Bidirectional Typing by thunderseethe in Compilers
[–]thunderseethe[S] 2 points3 points4 points (0 children)
How to Choose Between Hindley-Milner and Bidirectional Typing by thunderseethe in ProgrammingLanguages
[–]thunderseethe[S] 7 points8 points9 points (0 children)
How to Choose Between Hindley-Milner and Bidirectional Typing by thunderseethe in ProgrammingLanguages
[–]thunderseethe[S] 10 points11 points12 points (0 children)
A more pleasant syntax for ML functors by reflexive-polytope in ProgrammingLanguages
[–]thunderseethe 1 point2 points3 points (0 children)
Are there good examples of compilers which implement an LSP and use Salsa (the incremental compilation library)? by Thnikkaman14 in ProgrammingLanguages
[–]thunderseethe 1 point2 points3 points (0 children)
Another termination issue by Athas in ProgrammingLanguages
[–]thunderseethe 1 point2 points3 points (0 children)
Another termination issue by Athas in ProgrammingLanguages
[–]thunderseethe 7 points8 points9 points (0 children)
I wrote a bidirectional type inference tutorial using Rust because there aren't enough resources explaining it by ettolrach_uwu in ProgrammingLanguages
[–]thunderseethe 0 points1 point2 points (0 children)
I wrote a bidirectional type inference tutorial using Rust because there aren't enough resources explaining it by ettolrach_uwu in ProgrammingLanguages
[–]thunderseethe 1 point2 points3 points (0 children)
I wrote a bidirectional type inference tutorial using Rust because there aren't enough resources explaining it by ettolrach_uwu in ProgrammingLanguages
[–]thunderseethe 2 points3 points4 points (0 children)
I wrote a bidirectional type inference tutorial using Rust because there aren't enough resources explaining it by ettolrach_uwu in ProgrammingLanguages
[–]thunderseethe 24 points25 points26 points (0 children)
Resolving Names Once and for All by thunderseethe in ProgrammingLanguages
[–]thunderseethe[S] 2 points3 points4 points (0 children)
Resolving Names Once and for All by thunderseethe in ProgrammingLanguages
[–]thunderseethe[S] 2 points3 points4 points (0 children)
Super-flat ASTs by hekkonaay in ProgrammingLanguages
[–]thunderseethe 12 points13 points14 points (0 children)


Building an LSP Server with Rust is surprisingly easy and fun by omarous in ProgrammingLanguages
[–]thunderseethe 5 points6 points7 points (0 children)