Philip Wadler

Phil Wadler
Philip Wadler before a lecture at the University of Edinburgh.
Born Philip Lee Wadler
(1956-04-08) April 8, 1956
Alma mater
Awards
Scientific career
Fields Programming languages[3]
Institutions
Thesis Listlessness is Better than Laziness: An Algorithm that Transforms Applicative Programs to Eliminate Intermediate Lists (1984)
Doctoral advisor Nico Habermann[4]
Doctoral students
  • Ezra Cooper[4]
  • Kei Davis[4]
  • DeLesley Hutchins[5]
  • David R. Lester[6][4]
  • Philip Trinder[4]
  • Jeremy Yallop[7]
Website

Philip Lee Wadler (born April 8, 1956) is an American computer scientist known for his contributions to programming language design and type theory. In particular, he has contributed to the theory behind functional programming[8] and the use of monads in functional programming, the design of the purely functional language Haskell,[9] and the XQuery declarative query language. In 1984, he created the Orwell programming language. Wadler was involved in adding generic types to Java 5.0.[10] He is also author of the paper Theorems for free![11] that gave rise to much research on functional language optimization (see also Parametricity).

Education

Wadler received a Bachelor of Science degree in Mathematics from Stanford University in 1977, and a Master of Science degree in Computer Science from Carnegie Mellon University in 1979.[12] He completed his Doctor of Philosophy in Computer Science at Carnegie Mellon University in 1984. His thesis was entitled Listlessness is Better than Laziness and was supervised by Nico Habermann.[13][4]

Research and career

Wadler's research interests[14][3][15] are in programming languages.[10][16]

Wadler was a Research Fellow at the Programming Research Group (part of the Oxford University Computing Laboratory) and St Cross College, Oxford during 1983–87.[12] He was progressively Lecturer, Reader, and Professor at the University of Glasgow from 1987–96. Wadler was a Member of Technical Staff at Bell Labs, Lucent Technologies (1996–99) and then at Avaya Labs (1999–2003). Since 2003, he has been Professor of Theoretical Computer Science in the School of Informatics at the University of Edinburgh.[17]

Wadler was editor of the Journal of Functional Programming from 1990–2004. Wadler is currently working on a new functional language designed for writing web applications, called Links.[18] He has supervised numerous doctoral students to completion.[4][5][6][7]

Awards and honours

Wadler received the Most Influential POPL Paper Award in 2003 for the 1993 POPL Symposium paper Imperative Functional Programming, jointly with Simon Peyton Jones.[12][19] In 2005, he was elected Fellow of the Royal Society of Edinburgh.[1] In 2007, he was inducted as an ACM Fellow by the Association for Computing Machinery (ACM).[2]

References

  1. 1 2 Royal Society of Edinburgh profile
  2. 1 2 ACM fellowship award page
  3. 1 2 Philip Wadler publications indexed by Google Scholar Edit this at Wikidata
  4. 1 2 3 4 5 6 7 Philip Wadler at the Mathematics Genealogy Project
  5. 1 2 Hutchins, DeLesley (2009). Pure subtype systems : a type theory for extensible software. ethos.bl.uk (PhD thesis). University of Edinburgh. hdl:1842/3937. OCLC 781103005.
  6. 1 2 Lester, David. (1988). Combinator graph reduction : A congruence and its applications. bodleian.ox.ac.uk (DPhil thesis). University of Oxford. ISBN 9780902928558. OCLC 937098100.
  7. 1 2 Yallop, Jeremy (2010). Abstraction for web programming. ethos.bl.uk (PhD thesis). University of Edinburgh. hdl:1842/4683. OCLC 827264319.
  8. ↑ "Philip Wadler: Biography". O'Reilly Media. Retrieved 2017-03-20.
  9. ↑ Hudak, P.; Johnsson, T.; Kieburtz, D.; Nikhil, R.; Partain, W.; Peterson, J.; Peyton Jones, S.; Wadler, P.; Boutel, B.; Fairbairn, J.; Fasel, J.; Guzmán, M. A. M.; Hammond, K.; Hughes, J. (1992). "Report on the programming language Haskell". ACM SIGPLAN Notices. 27 (5): 1. doi:10.1145/130697.130699.
  10. 1 2 Wadler, Philip; Naftalin, Maurice (2007). Java generics and collections. Sebastopol, CA: O'Reilly. ISBN 0-596-52775-6.
  11. ↑ Wadler, P. (1989). "Theorems for free!". Proceedings of the fourth international conference on Functional programming languages and computer architecture - FPCA '89. p. 347. doi:10.1145/99370.99404. ISBN 0897913280.
  12. 1 2 3 "Philip Wadler : CV" (PDF). Homepages.inf.ed.ac.uk. Retrieved 2017-03-20.
  13. ↑ Wadler, Philip Lee (1984). Listlessness is Better than Laziness: An Algorithm that Transforms Applicative Programs to Eliminate Intermediate Lists. proquest.com (PhD thesis). Carnegie Mellon University. OCLC 123317612. (subscription required)
  14. ↑ Philip Wadler at DBLP Bibliography Server Edit this at Wikidata
  15. ↑ Philip Wadler's publications indexed by the Scopus bibliographic database. (subscription required)
  16. ↑ Bird, Richard Miller; Wadler, Philip (1998). Introduction to functional programming using Haskell. New York: Prentice Hall Europe. ISBN 0-13-484346-0.
  17. ↑ "Philip Wadler". Inf.ed.ac.uk. Retrieved 2017-03-20.
  18. ↑ "Archived copy". Archived from the original on 17 June 2006. Retrieved 22 June 2006.
  19. ↑ Peyton Jones, S. L.; Wadler, P. (1993). "Imperative functional programming". Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93. p. 71. doi:10.1145/158511.158524. ISBN 0897915607.

Media related to Philip Wadler at Wikimedia Commons

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.