Lawrence Paulson | |
|---|---|
 Paulson in 2017 | |
| Born | Lawrence Charles Paulson 1955 (age 69–70)[4] |
| Citizenship | US/UK |
| Alma mater | |
| Known for | |
| Spouses |
|
| Awards |
|
| Scientific career | |
| Fields | |
| Institutions | University of Cambridge Technical University of Munich |
| Thesis | A Compiler Generator for Semantic Grammars (1981) |
| Doctoral advisor | John L. Hennessy[3] |
| Website | Official website  |
Lawrence Charles Paulson is an American computer scientist. He is a Professor of Computational Logic at the University of Cambridge Computer Laboratory and a Fellow of Clare College, Cambridge.[2][3][7][8][9]
- ^ Cite error: The named reference
facmwas invoked but never defined (see the help page). - ^ a b c d Lawrence Paulson publications indexed by Google Scholar
- ^ a b Lawrence Paulson at the Mathematics Genealogy Project
- ^ Anon (2017). "Paulson, Prof. Lawrence Charles". Who's Who (online Oxford University Press ed.). Oxford: A & C Black. doi:10.1093/ww/9780199540884.013.289302. (Subscription or UK public library membership required.)
- ^ Anon (2017). "Professor Lawrence Paulson FRS". royalsociety.org. London: Royal Society. Retrieved 5 May 2017.
- ^ Akbarpour, B.; Paulson, L. C. (2009). "Meti Tarski: An Automatic Theorem Prover for Real-Valued Special Functions". Journal of Automated Reasoning. 44 (3): 175. CiteSeerX 10.1.1.157.3300. doi:10.1007/s10817-009-9149-2. S2CID 16215962.
- ^ Lawrence Paulson author profile page at the ACM Digital Library
- ^ Lawrence C. Paulson at DBLP Bibliography Server
- ^ Lawrence Paulson publications indexed by the Scopus bibliographic database. (subscription required)