TVM: Where are we going Tianqi ChenCurrent Deep Learning Landscape Frameworks and Inference engines DL Compilers Kenrel Libraries Hardware CuDNN NNPack MKL-DNN Hand optimized Open source, automated

Shared Libraries and Where to Find Them R&D Team Lead, JFrogIntroduction From the point of view of a C++ developer, compiled code typically ends up in either: ● The executables themselves ● Static are needed ○ WHICH programs needs to locate shared libraries ○ TOOLS to query, troubleshoot ○ WHERE to find shared libraries ● What this talk is NOT about: ○ Shared vs static linking ○ Internal structures two-level namespace. When a Mach-O image imports a symbol, it references the symbol name and the library where it expects to find that symbol. An Apple Library Primer, Apple Developer Forums https://developer

Cubical Implicit Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal Overloading Lossy Unification Mixfix Operators Module System Mutual Recursion +is%3Asuccess] page (instruction on how to find them [https://github.com/actions/upload-artifact#where-does-the-upload- go]). You can find a lot of useful resources on Agda Wiki [https://wiki.portal Agda as a Proof Assistant: Proving Associativity of Addition Building an Executable Agda Program Where to go from here? A List of Tutorials Books on Agda Tutorials and lecture notes Videos on Agda Courses

Variables Implicit Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal Overloading Mixfix Operators Module System Mutual Recursion Pattern Synonyms erroneous programs. Programs will raise exceptions or loop forever. And it is very difficult to analyse where the problems are. Haskell [http://www.haskell.org/] or ML [http://en.wikipedia.org/wiki/ML_%28p [http://en.wikipedia.org/wiki/Standard_ML] and Caml [http://caml.inria.fr/] are typed languages, where functions come with a type expressing what type of arguments the program expects and what the result

Variables Implicit Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal Overloading Mixfix Operators Module System Mutual Recursion Pattern Synonyms erroneous programs. Programs will raise exceptions or loop forever. And it is very difficult to analyse where the problems are. Haskell [http://www.haskell.org/] or ML [http://en.wikipedia.org/wiki/ML_%28p [http://en.wikipedia.org/wiki/Standard_ML] and Caml [http://caml.inria.fr/] are typed languages, where functions come with a type expressing what type of arguments the program expects and what the result

Cubical Implicit Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal Overloading Lossy Unification Mixfix Operators Module System Mutual Recursion +is%3Asuccess] page (instruction on how to find them [https://github.com/actions/upload-artifact#where-does-the-upload- go]). You can find a lot of useful resources on Agda Wiki [https://wiki.portal Agda as a Proof Assistant: Proving Associativity of Addition Building an Executable Agda Program Where to go from here? A List of Tutorials Books on Agda Tutorials and lecture notes Videos on Agda Courses

Cubical Implicit Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal Overloading Mixfix Operators Module System Mutual Recursion Pattern Synonyms +is%3Asuccess] page (instruction on how to find them [https://github.com/actions/upload-artifact#where-does-the-upload- go]). You can find a lot of useful resources on Agda Wiki [https://wiki.portal Agda as a Proof Assistant: Proving Associativity of Addition Building an Executable Agda Program Where to go from here? A List of Tutorials Books on Agda Tutorials and lecture notes Videos on Agda Courses

Cubical Implicit Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal Overloading Mixfix Operators Module System Mutual Recursion Pattern Synonyms +is%3Asuccess] page (instruction on how to find them where- does-the-upload-go>_). You can find a lot of useful resources on Agda Wiki [https://wiki.portal Agda as a Proof Assistant: Proving Associativity of Addition Building an Executable Agda Program Where to go from here? A List of Tutorials Books on Agda Tutorials and lecture notes Videos on Agda Courses

conceived as a relatively conservative extension of Haskell 98, taking on board new features only where they were well understood and widely agreed upon. It too was intended to be a “stable” language, yet | import | in | infix | infixl | infixr | instance | let | module | newtype | of | then | type | where | _ An identifier consists of a letter followed by zero or more letters, digits, underscores, and The layout (or “off-side”) rule takes effect whenever the open brace is omitted after the keyword where, let, do, or of. When this happens, the indentation of the next lexeme (whether or not on a new line)

Variables Implicit Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal Overloading Mixfix Operators Module System Mutual Recursion Pattern Synonyms +is%3Asuccess] page (instruction on how to find them where- does-the-upload-go>_). You can find a lot of useful resources on Agda Wiki [https://wiki.portal erroneous programs. Programs will raise exceptions or loop forever. And it is very difficult to analyze where the problems are. Haskell [https://www.haskell.org/] or ML [https://en.wikipedia.org/wiki/ML_%2