Lawrence Paulson

From Infogalactic: the planetary knowledge core
(Redirected from Lawrence C. Paulson)
Jump to: navigation, search
Lawrence Paulson
Born Lawrence Charles Paulson
1955 (age 68–69)
Citizenship US/UK
Fields <templatestyles src="Plainlist/styles.css"/>
Institutions University of Cambridge
Alma mater <templatestyles src="Plainlist/styles.css"/>
Thesis A Compiler Generator for Semantic Grammars (1981)
Doctoral advisor John L. Hennessy[2]
Doctoral students <templatestyles src="Plainlist/styles.css"/>
Known for <templatestyles src="Plainlist/styles.css"/>
Notable awards <templatestyles src="Plainlist/styles.css"/>
  • Pilkington Teaching Prize (2003)
  • FACM (2008)
Spouse <templatestyles src="Plainlist/styles.css"/>
  • 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

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

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

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

Personal life

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

Awards and honours

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

References

  1. ↑ 1.0 1.1 Lawrence Paulson's publications indexed by Google Scholar, a service provided by Google
  2. ↑ 2.0 2.1 2.2 2.3 Lawrence Paulson at the Mathematics Genealogy Project
  3. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  4. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  5. ↑ 5.0 5.1 Lua error in package.lua at line 80: module 'strict' not found.
  6. ↑ List of publications from Microsoft Academic Search
  7. ↑ Lawrence Paulson from the Association for Computing Machinery (ACM) Digital Library
  8. ↑ Lawrence Paulson's publications indexed by the DBLP Bibliography Server at the University of Trier
  9. ↑ Lawrence Paulson's publications indexed by the Scopus bibliographic database, a service provided by Elsevier.
  10. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  11. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  12. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  13. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  14. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  15. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  16. ↑ Lua error in package.lua at line 80: module 'strict' not found.
  17. ↑ Lua error in package.lua at line 80: module 'strict' not found.


<templatestyles src="Asbox/styles.css"></templatestyles>

Stub icon

This biographical article relating to a computer specialist is a stub. You can help Wikipedia by expanding it.
Retrieved from "https://infogalactic.com/w/index.php?title=Lawrence_Paulson&oldid=2158432"