Philip Wadler
Philip Wadler has contributed to the designs of Haskell, Java, and XQuery, and is a co-author of XQuery from the Experts (Addison Wesley, 2004) and Generics and Collections in Java (O'Reilly, 2006).
Philip is Professor of Theoretical Computer Science at the University of Edinburgh. He is an ACM Fellow and a Fellow of the Royal Society of Edinburgh, past chair of ACM SIGPLAN, and past holder of a Royal Society-Wolfson Research Merit Fellowship. Previously, he worked or studied at Stanford, Xerox Parc, CMU, Oxford, Chalmers, Glasgow, Bell Labs, and Avaya Labs, and visited as a guest professor in Copenhagen, Sydney, and Paris. He has an h-index of 61, with more than 18,000 citations to his work according to Google Scholar.
He is a winner of the POPL Most Influential Paper Award, has contributed to the designs of Haskell, Java, and XQuery, and is a co-author of Introduction to Functional Programming (Prentice Hall, 1988), XQuery from the Experts (Addison Wesley, 2004) and Generics and Collections in Java (O'Reilly, 2006). He has delivered invited talks in locations ranging from Aizu to Zurich.
Talks I've Given
-
Keynote: (Programming Languages) in Agda = Programming (Languages in Agda)
Featuring Philip Wadler
The most profound connection between logic and computation is a pun.
functional-programming types propositions agda haskell -
(Programming Languages) in Agda = Programming (Languages in Agda)
Featuring Philip Wadler
The most profound connection between logic and computation is a pun. The doctrine of Propositions as Types asserts that propositions correspond to types, proofs to programs, and simplification of proofs to evaluation of programs. The proof of a conjunction is a pair, the proof of a disjunction is...
language -
Programming Language Foundations in Agda
Featuring Philip Wadler
PARTICIPANT PREPARATION:
Clone the repository at
https://github.com/plfa/plfa.github.io/
This is the textbook for the course.
Install Agda, the Agda standard library, and configure the plfa library. This can be done by following the instructions under the heading
Getting Started with PLFA
at
...
language -
Philip Wadler on Reynolds’s ‘Definitional Interpreters for Higher-Order Programming Languages’
Featuring Philip Wadler
Certain papers change your life. McCarthy’s ‘Recursive Functions of Symbolic Expressions and their Computation by Machine (Part I)’ (1960) changed Philip's, and so did Landin’s ‘The Next 700 Programming Languages’ (1966). And he remembers the moment, halfway through my graduate career, when...
papers-we-love -
A practical theory of language-integrated query
Featuring Philip Wadler
In this talk we present a practical theory of language-integrated query based on quotation and normalisation of quoted terms.
functional-programming linq bigdata sql f# scala haskell -
How Best to Blend a Domain-Specific Language into a Host Language?
Featuring Philip Wadler
For the domain of databases, the old question of how to achieve language integrated query is receiving renewed attention, in part because of its support through Microsoft’s LINQ framework. We present a practical theory of language-integrated query based on quotation and normalisation of...
languages -
How Best to Blend a Domain-Specific Language into a Host Language?
Featuring Philip Wadler
For the domain of databases, the old question of how to achieve language integrated query is receiving renewed attention, in part because of its support through Microsoft’s LINQ framework. We present a practical theory of language-integrated query based on quotation and normalisation of...
languages -
How Best to Blend a Domain-Specific Language into a Host Language?
Featuring Philip Wadler
For the domain of databases, the old question of how to achieve language integrated query is receiving renewed attention, in part because of its support through Microsoft’s LINQ framework. We present a practical theory of language-integrated query based on quotation and normalisation of...
languages