Lawrence Paulson

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Lawrence Paulson
Born Lawrence Charles Paulson
1955 (age 58–59)
Citizenship US/UK
Fields
Institutions University of Cambridge
Alma mater
Thesis A Compiler Generator for Semantic Grammars (1981)
Doctoral advisor John L. Hennessy[2]
Doctoral students
Known for
Notable awards
  • Pilkington Teaching Prize (2003)
  • FACM (2008)
Spouse
  • Susan Mary Paulson (d. 2010)
  • Elena Tchougounova
Website
www.cl.cam.ac.uk/~lp15/

Lawrence Charles Paulson (born 1955) is a professor at the University of Cambridge Computer Laboratory and a fellow of Clare College, Cambridge.[1][2][6][7][8][9]

Education[edit]

Paulson graduated from the California Institute of Technology in 1977, and obtained his PhD in Computer Science from Stanford University under the supervision of John L. Hennessy.[2][10]

Research[edit]

Paulson came to the University of Cambridge in 1983 and became a Fellow of Clare College, Cambridge in 1987. He is best known for the cornerstone text on the programming language ML, ML for the Working Programmer.[11][12] His research is based around the interactive theorem prover Isabelle, which he introduced in 1986.[13] He has worked on the verification of cryptographic protocols using inductive definitions, and he has also formalized the constructible universe of Kurt Gödel. Recently he has built a new theorem prover, MetiTarski,[5] for real-valued special functions.[14]

Teaching[edit]

Paulson teaches two undergraduate lecture courses on the Computer Science Tripos, entitled Foundations of Computer Science (which introduces functional programming) and Logic and Proof (which covers automated theorem proving and related methods).[citation needed]

Personal life[edit]

Paulson has two children by his first wife, Dr Susan Mary Paulson, who died 2010. He is now married to Dr Elena Tchougounova.

Awards and honours[edit]

Paulson is a Fellow of the Association for Computing Machinery (2008).

References[edit]

  1. ^ a b List of publications from Google Scholar
  2. ^ a b c d Lawrence Paulson at the Mathematics Genealogy Project
  3. ^ Fleuriot, Jacques Désiré (1990). A combination of geometry theorem proving and nonstandard analysis, with application to Newton's Principia (PhD thesis). University of Cambridge. 
  4. ^ Wolfram, David (1990). The Clausal Theory of Types (PhD thesis). University of Cambridge. 
  5. ^ a b Akbarpour, B.; Paulson, L. C. (2009). "Meti Tarski: An Automatic Theorem Prover for Real-Valued Special Functions". Journal of Automated Reasoning 44 (3): 175. doi:10.1007/s10817-009-9149-2. 
  6. ^ List of publications from Microsoft Academic Search
  7. ^ Lawrence Paulson from the ACM Portal
  8. ^ List of publications from the DBLP Bibliography Server
  9. ^ Lawrence Paulson from the Scopus bibliographic database
  10. ^ Paulson, Lawrence Charles (1981). A Compiler Generator for Semantic Grammars (PhD thesis). Stanford University. 
  11. ^ ISBN 052156543X
    Please click here to fill in your citation. If you are still editing the main article, you may want to open the link in a new window or tab.
  12. ^ http://www.cl.cam.ac.uk/users/lcp/MLbook
  13. ^ Paulson, L. C. (1986). "Natural deduction as higher-order resolution". The Journal of Logic Programming 3 (3): 237. doi:10.1016/0743-1066(86)90015-4. 
  14. ^ Paulson, L. C. (2012). "Meti Tarski: Past and Future". Interactive Theorem Proving. Lecture Notes in Computer Science 7406. p. 1. doi:10.1007/978-3-642-32347-8_1. ISBN 978-3-642-32346-1.