Completed
Representing types as trees
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Julia: Great Language or the Greatest Language - Keynote by Jan Vitek
Automatically move to the next video in the Classroom when playback concludes
- 1 Welcome!
- 2 Information about JuliaCon 2021
- 3 Schedule and organization of the JuliaCon 2021
- 4 Introduction of prof. Jan Vitek
- 5 Prof. Jan Vitek "Julia: Great language or the greatest language"
- 6 Why are we still inventing, adopting, and abandoning programming languages?
- 7 How to revolutionize scientific programming?
- 8 Programming languages landscape
- 9 What have we learned in the last 20 years?
- 10 Intel project on the parallel accelerator
- 11 Publishing papers on Julia
- 12 Our first paper: Julia is fast
- 13 Julia implementation
- 14 Julia design
- 15 Julia coding style
- 16 Implementation, design, and code styles make Julia fast
- 17 Second paper: formalizing Julia subtyping algorithm
- 18 Defining rules of subtyping
- 19 Normalization of types
- 20 Normalization of types is in the exponential complexity class
- 21 Representing types as trees
- 22 Third paper: rational reconstruction of Julia subtyping
- 23 Who is right?
- 24 Subtyping parametric types
- 25 The diagonal rule
- 26 Julia type system isn't decidable, what we will do with it?
- 27 Fourth paper: eval and world age
- 28 Fifth paper: type stability and type grounded
- 29 Q&A: What are the promising techniques from JIT theory that weren't put into practice?
- 30 Q&A: What are the barriers for Julia reaching the speed of C?
- 31 Q&A: Is the concept of programming from the time before 2010 still relevant in 2021?
