Adventures with types
Please log in to watch this conference skillscast.
Static type systems are the world’s most widely applied formal method, in daily use by millions of programmers.
The trouble is that weak type systems give types a bad name; they get in your way and stop you from writing the programs you want to write. And that leads to the familiar but fruitless static-vs-dynamic debate which I hope to avoid entirely.
YOU MAY ALSO LIKE:
Adventures with types
Simon Peyton Jones
Simon Peyton Jones, MA, MBCS, CEng, graduated from Trinity College Cambridge in 1980. Simon was a key contributor to the design of the now-standard functional language Haskell, and is the lead designer of the widely-used Glasgow Haskell Compiler (GHC). He has written two textbooks about the implementation of functional languages.
After two years in industry, he spent seven years as a lecturer at University College London, and nine years as a professor at Glasgow University before moving to Microsoft Research (Cambridge) in 1998.
His main research interest is in functional programming languages, their implementation, and their application. He has led a succession of research projects focused around the design and implementation of production-quality functional-language systems for both uniprocessors and parallel machines.
More generally, he is interested in language design, rich type systems, software component architectures, compiler technology, code generation, runtime systems, virtual machines, and garbage collection. He is particularly motivated by direct use of principled theory to practical language design and implementation -- that's one reason he loves functional programming so much.