Lawrence Paulson

























































Lawrence Paulson


FRS


Lawrence Paulson Royal Society.jpg
Lawrence Paulson at the Royal Society admissions day in London, July 2017

Born
Lawrence Charles Paulson


1955 (age 63–64)[1]
Citizenship US/UK
Alma mater



  • California Institute of Technology (BSc)


  • Stanford University (PhD)
Known for


  • ML


  • Isabelle[2]

  • MetiTarski[3]
Spouse(s)


  • Susan Mary Paulson (d. 2010)

  • Elena Tchougounova
Awards


  • ACM Fellow (2008) [4]
Scientific career
Fields



  • Theorem proving[5]


  • Formal methods[5]


  • Computer security[5]
Institutions
University of Cambridge
Technical University of Munich
Thesis
A Compiler Generator for Semantic Grammars (1981)
Doctoral advisor
John L. Hennessy[6]

Website www.cl.cam.ac.uk/~lp15/

Lawrence Charles Paulson (born 1955)[1]FRS[2] is a Professor of Computational Logic at the University of Cambridge Computer Laboratory and a Fellow of Clare College, Cambridge.[5][6][7][8][9]




Contents






  • 1 Education


  • 2 Research


    • 2.1 Awards and honours




  • 3 Personal life


  • 4 References





Education


Paulson graduated from the California Institute of Technology in 1977,[10] and obtained his PhD in Computer Science from Stanford University in 1981 for research on programming languages and compiler-compilers supervised by John L. Hennessy.[6][11]



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.[12][13] His research is based around the interactive theorem prover Isabelle, which he introduced in 1986.[14] He has worked on the verification of cryptographic protocols using inductive definitions,[15] and he has also formalised the constructible universe of Kurt Gödel. Recently he has built a new theorem prover, MetiTarski,[3] for real-valued special functions.[16]


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



Awards and honours


Paulson was elected a Fellow of the Royal Society (FRS) in 2017,[2] a Fellow of the Association for Computing Machinery in 2008[4] and a Distinguished Affiliated Professor for Logic in Informatics at the Technical University of Munich.[when?][19]



Personal life


Paulson has two children by his first wife, Dr Susan Mary Paulson, who died in 2010.[20] Since 2012, he has been married to Dr Elena Tchougounova.[1]



References





  1. ^ abc Anon (2017). Paulson, Prof. Lawrence Charles. ukwhoswho.com. Who's Who (online Oxford University Press ed.). A & C Black, an imprint of Bloomsbury Publishing plc. doi:10.1093/ww/9780199540884.013.289302..mw-parser-output cite.citation{font-style:inherit}.mw-parser-output .citation q{quotes:"""""""'""'"}.mw-parser-output .citation .cs1-lock-free a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/6/65/Lock-green.svg/9px-Lock-green.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .citation .cs1-lock-limited a,.mw-parser-output .citation .cs1-lock-registration a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/d/d6/Lock-gray-alt-2.svg/9px-Lock-gray-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .citation .cs1-lock-subscription a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/a/aa/Lock-red-alt-2.svg/9px-Lock-red-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration{color:#555}.mw-parser-output .cs1-subscription span,.mw-parser-output .cs1-registration span{border-bottom:1px dotted;cursor:help}.mw-parser-output .cs1-ws-icon a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/4/4c/Wikisource-logo.svg/12px-Wikisource-logo.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output code.cs1-code{color:inherit;background:inherit;border:inherit;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;font-size:100%}.mw-parser-output .cs1-visible-error{font-size:100%}.mw-parser-output .cs1-maint{display:none;color:#33aa33;margin-left:0.3em}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration,.mw-parser-output .cs1-format{font-size:95%}.mw-parser-output .cs1-kern-left,.mw-parser-output .cs1-kern-wl-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right,.mw-parser-output .cs1-kern-wl-right{padding-right:0.2em}
    closed access

    (subscription required)


  2. ^ abc Anon (2017). "Professor Lawrence Paulson FRS". royalsociety.org. London: Royal Society. Retrieved 5 May 2017.


  3. ^ ab 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.


  4. ^ ab Anon (2008). "Professor Lawrence C. Paulson". awards.acm.org. Association for Computing Machinery. Retrieved 12 April 2016.


  5. ^ abcd Lawrence Paulson publications indexed by Google Scholar Edit this at Wikidata


  6. ^ abc Lawrence Paulson at the Mathematics Genealogy Project


  7. ^ Lawrence Paulson author profile page at the ACM Digital Library


  8. ^ Lawrence C. Paulson at DBLP Bibliography Server Edit this at Wikidata


  9. ^ Lawrence Paulson publications indexed by the Scopus bibliographic database. (subscription required)


  10. ^ Lawrence Paulson Entry at ORCID


  11. ^ Paulson, Lawrence Charles (1981). A Compiler Generator for Semantic Grammars (PDF). cl.cam.ac.uk (PhD thesis). Stanford University. OCLC 757240716.


  12. ^ Paulson, Lawrence (1996). ML for the working programmer. Cambridge New York: Cambridge University Press. ISBN 978-0521565431.


  13. ^ "ML for the Working Programmer". University of Cambridge. Retrieved 25 November 2015.


  14. ^ Paulson, L. C. (1986). "Natural deduction as higher-order resolution". The Journal of Logic Programming. 3 (3): 237–258. arXiv:cs/9301104. doi:10.1016/0743-1066(86)90015-4.


  15. ^ Paulson, Lawrence C. (1998). "The inductive approach to verifying cryptographic protocols". Journal of Computer Security. 6 (1–2): 85–128. CiteSeerX 10.1.1.57.2049. doi:10.3233/JCS-1998-61-205. ISSN 1875-8924.


  16. ^ Paulson, L. C. (2012). "Meti Tarski: Past and Future". Interactive Theorem Proving. Lecture Notes in Computer Science. 7406. pp. 1–10. CiteSeerX 10.1.1.259.5577. doi:10.1007/978-3-642-32347-8_1. ISBN 978-3-642-32346-1.


  17. ^ Paulson, Larry. "Foundations of Computer Science". Retrieved 25 November 2015.


  18. ^ Paulson, Larry. "Logic and Proof". University of Cambridge. Retrieved 25 November 2015.


  19. ^ "Certificate of Appointment" (PDF). TU Munich. Retrieved 12 April 2016.


  20. ^ Paulson, Laurence (2010). "Susan Paulson, PhD (1959–2010)". University of Cambridge. Retrieved 25 November 2015.













Comments

Post a Comment

Popular posts from this blog

Monte Carlo

Image
For other uses, see Monte Carlo (disambiguation). Quarter and ward of Monaco in Monaco Monte Carlo Quarter and ward of Monaco Monte Carlo in Monaco (Ward shown) Monte Carlo Location in relation to France Coordinates: 43°44′23″N 7°25′38″E  /  43.73972°N 7.42722°E  / 43.73972; 7.42722 Coordinates: 43°44′23″N 7°25′38″E  /  43.73972°N 7.42722°E  / 43.73972; 7.42722 Country   Monaco Government  • Type Principality Area  • Urban 0.61 km 2 (.234 sq mi) Population  • Quarter and ward of Monaco 15,200 (in the quarter)  3,500 (in the ward) Postcode 98000 Monte Carlo ( / ˈ m ɒ n t i ˈ k ɑːr l oʊ / ; Italian:  [ˈmonte ˈkarlo] ; French: Monte-Carlo [mɔ̃te kaʁlo] , or colloquially Monte-Carl [mɔ̃te kaʁl] ; Monégasque: Munte Carlu ) officially refers to an administrative area of the Principality of Monaco, specifically the ward of Monte Carlo/Spélugues, where the Monte Carlo Casino is located. Informally the name also refers to a ...
Read more

Information security

Image
This article is part of a series on Information security Related security categories Internet security Cyberwarfare Computer security Mobile security Network security Threats Computer crime Vulnerability Eavesdropping Malware Spyware Ransomware Trojans Viruses Worms Rootkits Bootkits Keyloggers Screen scrapers Exploits Backdoors Logic bombs Payloads Denial of service Defenses Computer access control Application security Antivirus software Secure coding Secure by default Secure by design Secure operating systems Authentication Multi-factor authentication Authorization Data-centric security Encryption Firewall Intrusion detection system Mobile secure gateway Runtime application self-protection (RASP) v t e Information security , sometimes shortened to InfoSec , is the practice of preventing unauthorized access, use, disclosure, disruption, modification, inspection, recording or destruction of information. Th...
Read more

章鱼与海女图

Image
本条目 可参照英語維基百科相應條目来扩充 。 （2014/5/25） 若您熟悉来源语言和主题，请协助参考外语维基扩充条目。请勿直接提交机械翻译，也不要翻译不可靠、低品质内容。依版权协议，译文需在编辑摘要注明来源，或于讨论页顶部标记 {{Translated page}} 标签。 本条目 需要擴充。 （2013年8月15日） 请協助改善这篇條目，更進一步的信息可能會在討論頁或扩充请求中找到。请在擴充條目後將此模板移除。 《 章鱼与海女 》（日语： 蛸と海女 ／ たことあま   Tako to ama ）是一幅由日本畫家葛饰北斋创作的浮世绘，出自1814年（文化4年）出版的艳本《喜能会之故真通》（日语： 喜能会之故真通 ／ きのえのこまつ   Kinoe no Komatsu ）。畫中有兩隻章鱼以觸手攻擊一名採珠的海女，並進行擬似戀獸癖的交媾行為。作品尺寸为6½" × 8¾" （16.51 cm × 22.23 cm）。 [1] 在此之前的类似作品还有北尾重政的艳本《謡曲色番組》及勝川春潮的艳本《艳本千夜多女志》等，有被北斋作为参考的可能性。 《章鱼与海女图》有不同英文翻译，一般称The Dream of the Fisherman's Wife，又作Girl Diver and Octopi、Diver and Two Octopi，Richard Douglas Lane称其为 Girl Diver and Octopi [2] ，Mathi Forrer 称其为 Pearl Diver and Two Octopi [3] ，Danielle Talerico 称其为 Diver and Two Octopi 。 [4] 目录 1 作品介绍 1.1 画中对话 1.2 解释 2 评价 3 影响 3.1 模仿作品 4 另见 5 参考来源 6 外部連結 作品介绍 画中对话 原文 译文 大蛸： いつぞハいつぞハとねらいすましてゐたかいがあつて、けふといふけふ、とうとうとらまへたア。てもむつくりとしたいいぼぼだ。いもよりハなをこうぶつだ。サアサア、すつてすつてすいつくして...
Read more