J. B. Wells

1.5k total citations
45 papers, 528 citations indexed

About

J. B. Wells is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Software. According to data from OpenAlex, J. B. Wells has authored 45 papers receiving a total of 528 indexed citations (citations by other indexed papers that have themselves been cited), including 37 papers in Artificial Intelligence, 24 papers in Computational Theory and Mathematics and 10 papers in Software. Recurrent topics in J. B. Wells's work include Logic, programming, and type systems (37 papers), Formal Methods in Verification (15 papers) and Logic, Reasoning, and Knowledge (12 papers). J. B. Wells is often cited by papers focused on Logic, programming, and type systems (37 papers), Formal Methods in Verification (15 papers) and Logic, Reasoning, and Knowledge (12 papers). J. B. Wells collaborates with scholars based in United States, United Kingdom and Malaysia. J. B. Wells's co-authors include A. J. Kfoury, Christian Haack, Franklyn Turbak, Fairouz Kamareddine, Vincent Rahli, Harry G. Mairson, Geoffrey Washburn, Robert J. Peters, Elaine Pimentel and M. J. Keck and has published in prestigious journals such as SAE technical papers on CD-ROM/SAE technical paper series, Theoretical Computer Science and ACM SIGPLAN Notices.

In The Last Decade

J. B. Wells

39 papers receiving 453 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
J. B. Wells United States 13 501 311 139 89 80 45 528
Stuart F. Allen United States 6 552 1.1× 398 1.3× 67 0.5× 67 0.8× 61 0.8× 10 618
Douglas J. Howe United States 8 673 1.3× 486 1.6× 64 0.5× 74 0.8× 65 0.8× 14 727
Andrzej Filinski Denmark 10 609 1.2× 333 1.1× 99 0.7× 51 0.6× 162 2.0× 22 628
Judicaël Courant France 3 369 0.7× 263 0.8× 58 0.4× 45 0.5× 58 0.7× 5 447
Edwin Brady United Kingdom 9 299 0.6× 166 0.5× 98 0.7× 53 0.6× 89 1.1× 25 352
Eduardo Giménez 2 368 0.7× 267 0.9× 53 0.4× 46 0.5× 57 0.7× 2 444
Janis Voigtländer Germany 12 318 0.6× 172 0.6× 88 0.6× 52 0.6× 43 0.5× 38 348
W. R. Cleaveland United States 4 426 0.9× 316 1.0× 48 0.3× 61 0.7× 53 0.7× 6 481
Jan Midtgaard Denmark 12 441 0.9× 251 0.8× 102 0.7× 86 1.0× 132 1.6× 27 494
N. P. Mendler United Kingdom 5 542 1.1× 408 1.3× 55 0.4× 62 0.7× 58 0.7× 6 594

Countries citing papers authored by J. B. Wells

Since Specialization
Citations

This map shows the geographic impact of J. B. Wells'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 J. B. Wells with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites J. B. Wells more than expected).

Fields of papers citing papers by J. B. Wells

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by J. B. Wells. 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 J. B. Wells. The network helps show where J. B. Wells may publish in the future.

Co-authorship network of co-authors of J. B. Wells

This figure shows the co-authorship network connecting the top 25 collaborators of J. B. Wells. A scholar is included among the top collaborators of J. B. Wells 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 J. B. Wells. J. B. Wells is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
2.
Rahli, Vincent, et al.. (2016). Skalpel: A constraint-based type error slicer for Standard ML. Journal of Symbolic Computation. 80. 164–208. 3 indexed citations
3.
Kamareddine, Fairouz, Vincent Rahli, & J. B. Wells. (2012). Reducibility Proofs in the λ-Calculus. Fundamenta Informaticae. 121(1-4). 121–152. 1 indexed citations
4.
Kamareddine, Fairouz, et al.. (2012). On Realisability Semantics for Intersection Types with Expansion Variables. Fundamenta Informaticae. 121(1-4). 153–184.
5.
Rahli, Vincent, et al.. (2010). A constraint system for a SML type error slicer. Open Repository and Bibliography (University of Luxembourg). 12 indexed citations
6.
Kamareddine, Fairouz & J. B. Wells. (2008). Computerizing Mathematical Text with MathLang. Electronic Notes in Theoretical Computer Science. 205. 5–30. 17 indexed citations
7.
Kamareddine, Fairouz, et al.. (2007). Gradual Computerisation/Formalisation of Mathematical Texts into Mizar. 1 indexed citations
8.
Haack, Christian & J. B. Wells. (2004). Type error slicing in implicitly typed higher-order languages. Science of Computer Programming. 50(1-3). 189–224. 73 indexed citations
10.
Kfoury, A. J. & J. B. Wells. (2003). Principality and type inference for intersection types using expansion variables. Theoretical Computer Science. 311(1-3). 1–70. 33 indexed citations
11.
Kfoury, A. J. & J. B. Wells. (2002). New notions of reduction and non-semantic proofs of strong β-normalization in typed λ-calculi. 311–321. 13 indexed citations
12.
Turbak, Franklyn, et al.. (2001). Functioning without closure. 14–25. 8 indexed citations
13.
Wells, J. B.. (1999). Typability and type checking in System F are equivalent and undecidable. Annals of Pure and Applied Logic. 98(1-3). 111–156. 71 indexed citations
14.
Kamareddine, Fairouz, et al.. (1998). Calculi of Generalized beta-Reduction and Explicit Substitutions: The Type-Free and Simply Typed Versions.. 1998. 7 indexed citations
15.
Turbak, Franklyn, et al.. (1997). Strongly Typed Flow-Directed Representation Transformations.. 11–24. 17 indexed citations
16.
Wells, J. B.. (1995). The undecidability of Mitchell's subtyping relationship. OpenBU (Boston University). 2 indexed citations
17.
Kfoury, A. J. & J. B. Wells. (1994). A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus. VII(3). 196–207. 3 indexed citations
18.
Kfoury, A. J. & J. B. Wells. (1994). A direct algorithm for type inference in the rank-2 fragment of the second-order λ-calculus. 196–207. 44 indexed citations
19.
Wells, J. B.. (1993). Typability and type checking in the second-order Λ-calculus are equivalent and undecidable (Preliminary Draft). OpenBU (Boston University). 1 indexed citations
20.
Wells, J. B., et al.. (1987). A National Study Of Recommended Curricula For Extension Education Methods Classes And Student Internship Programs. Journal of Agricultural Education. 28(4). 9–14.

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

Rankless by CCL
2026