Lawrence C. Paulson

9.4k total citations · 1 hit paper
114 papers, 3.3k citations indexed

About

Lawrence C. Paulson is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Lawrence C. Paulson has authored 114 papers receiving a total of 3.3k indexed citations (citations by other indexed papers that have themselves been cited), including 88 papers in Artificial Intelligence, 66 papers in Computational Theory and Mathematics and 19 papers in Computer Networks and Communications. Recurrent topics in Lawrence C. Paulson's work include Logic, programming, and type systems (72 papers), Logic, Reasoning, and Knowledge (49 papers) and Formal Methods in Verification (34 papers). Lawrence C. Paulson is often cited by papers focused on Logic, programming, and type systems (72 papers), Logic, Reasoning, and Knowledge (49 papers) and Formal Methods in Verification (34 papers). Lawrence C. Paulson collaborates with scholars based in United Kingdom, Germany and Italy. Lawrence C. Paulson's co-authors include Tobias Nipkow, Markus Wenzel, Meng Jia, Giampaolo Bella, Fabio Massacci, Jasmin Christian Blanchette, Christoph Benzmüller, Leslie Lamport, Sascha Böhme and Sean B. Holden and has published in prestigious journals such as Communications of the ACM, IEEE Journal on Selected Areas in Communications and ACM Transactions on Programming Languages and Systems.

In The Last Decade

Lawrence C. Paulson

96 papers receiving 2.8k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Isabelle/HOL: A Proof Assistant for Higher-Order Logic

2002 1.1k citations Tobias Nipkow, Lawrence C. Paulson et al. profile →

Peers

Countries citing papers authored by Lawrence C. Paulson

Since Specialization

Citations

This map shows the geographic impact of Lawrence C. Paulson's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Lawrence C. Paulson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Lawrence C. Paulson more than expected).

Fields of papers citing papers by Lawrence C. Paulson

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Lawrence C. Paulson. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Lawrence C. Paulson. The network helps show where Lawrence C. Paulson may publish in the future.

Co-authorship network of co-authors of Lawrence C. Paulson

This figure shows the co-authorship network connecting the top 25 collaborators of Lawrence C. Paulson. A scholar is included among the top collaborators of Lawrence C. Paulson based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Lawrence C. Paulson. Lawrence C. Paulson is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Improving the SMT Proof Reconstruction Pipeline in Isabelle/HOL 2025 ·Dagstuhl Research Online Publication Server ·Lawrence C. Paulson, (unknown), (unknown), (unknown), (unknown), (unknown), (unknown), (unknown), (unknown)	0
2	Grothendieck's Schemes in Algebraic Geometry. 2021 ·(unknown), Lawrence C. Paulson, (unknown)	1
3	The Nash-Williams Partition Theorem. 2020 ·Lawrence C. Paulson	1
4	Zermelo Fraenkel Set Theory in Higher-Order Logic. 2019 ·Lawrence C. Paulson	2
5	Introduction to Milestones in Interactive Theorem Proving 2018 ·Journal of Automated Reasoning ·Jeremy Avigad, Jasmin Christian Blanchette, Gerwin Klein, Lawrence C. Paulson, Andrei Popescu, Gregor Snelting	1
6	The Prime Number Theorem. 2018 ·(unknown), Lawrence C. Paulson	1
7	Real-Valued Special Functions: Upper and Lower Bounds 2014 ·Lawrence C. Paulson	1
8	Godel's Incompleteness Theorems 2013 ·Lawrence C. Paulson	2
9	Formal verification of analog circuits in the presence of noise and process variation 2010 ·Design, Automation, and Test in Europe ·(unknown), (unknown), Mohamed H. Zaki, Sofiène Tahar, Lawrence C. Paulson	6
10	Progress Report on LEO-II -- An Automatic Theorem Prover for Higher-Order Logic 2007 ·Christoph Benzmüller, Lawrence C. Paulson, (unknown), Arnaud Fietzke	5
11	Lightweight relevance filtering for machine-generated resolution problems 2007 ·Journal of Applied Logic ·Meng Jia, Lawrence C. Paulson	44
12	Automation for interactive proof: First prototype 2006 ·Information and Computation ·Meng Jia, (unknown), Lawrence C. Paulson	30
13	Welcome Defects as a Sign of Innovation 2005 ·Communications of the ACM ·David Anderson, Lawrence C. Paulson, (unknown), Günter Rote, (unknown), Thomas F. Stafford, Michael A. Cusumano, Fabio A. Schreiber, (unknown), (unknown)	1
14	Mechanical Proofs about a Non-Repudiation Protocol 2001 ·Giampaolo Bella, Lawrence C. Paulson	5
15	ML for the working programmer (2nd ed.) 1996 ·Cambridge University Press eBooks ·Lawrence C. Paulson	75
16	Isabelle-91 1992 ·Tobias Nipkow, Lawrence C. Paulson	7
17	Natural deduction as higher-order resolution 1986 ·The Journal of Logic Programming ·Lawrence C. Paulson	72
18	Verifying the unification algorithm in LCF 1985 ·Science of Computer Programming ·Lawrence C. Paulson	32
19	Compiler generation from denotational semantics 1984 ·Lawrence C. Paulson	15
20	A higher-order implementation of rewriting 1983 ·Science of Computer Programming ·Lawrence C. Paulson	45

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact