James McKinna

1.5k total citations
42 papers, 481 citations indexed

About

James McKinna is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, James McKinna has authored 42 papers receiving a total of 481 indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Artificial Intelligence, 17 papers in Computational Theory and Mathematics and 10 papers in Computer Networks and Communications. Recurrent topics in James McKinna's work include Logic, programming, and type systems (25 papers), Logic, Reasoning, and Knowledge (14 papers) and Formal Methods in Verification (12 papers). James McKinna is often cited by papers focused on Logic, programming, and type systems (25 papers), Logic, Reasoning, and Knowledge (14 papers) and Formal Methods in Verification (12 papers). James McKinna collaborates with scholars based in United Kingdom, Netherlands and Belgium. James McKinna's co-authors include Conor McBride, Robert Pollack, Jeremy Gibbons, Perdita Stevens, James Chapman, James Cheney, J. Garrett Morris, Edwin Brady, Paul D. Callaghan and Kevin Hammond and has published in prestigious journals such as ACM SIGPLAN Notices, Lecture notes in computer science and Science of Computer Programming.

In The Last Decade

James McKinna

35 papers receiving 442 citations

Peers

James McKinna
Edwin Brady United Kingdom
Ian Stark United Kingdom
C. R. Murthy United States
James McKinna
Citations per year, relative to James McKinna James McKinna (= 1×) peers Paola Giannini

Countries citing papers authored by James McKinna

Since Specialization
Citations

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

Fields of papers citing papers by James McKinna

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of James McKinna

This figure shows the co-authorship network connecting the top 25 collaborators of James McKinna. A scholar is included among the top collaborators of James McKinna 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 James McKinna. James McKinna 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
1.
McKinna, James, et al.. (2025). Barendregt Convenes with Knaster and Tarski: Strong Rule Induction for Syntax with Bindings. Proceedings of the ACM on Programming Languages. 9(POPL). 1687–1718.
2.
Schrijvers, Tom, et al.. (2023). Forward- or Reverse-Mode Automatic Differentiation: What's the Difference?. SSRN Electronic Journal. 2 indexed citations
3.
Cheney, James, et al.. (2018). Introduction to bidirectional transformations. Oxford University Research Archive (ORA) (University of Oxford). 1 indexed citations
4.
Atkey, Robert, et al.. (2018). A type and scope safe universe of syntaxes with binding: their semantics and proofs. Proceedings of the ACM on Programming Languages. 2(ICFP). 1–30. 13 indexed citations
5.
McKinna, James, et al.. (2017). Coalgebraic Aspects of Bidirectional Computation.. The Journal of Object Technology. 16(1). 1:1–1:1.
6.
Chapman, James, et al.. (2016). Type-and-scope safe programs and their proofs. Strathprints: The University of Strathclyde institutional repository (University of Strathclyde). 195–207. 24 indexed citations
7.
McKinna, James, et al.. (2015). The encode-decode method, relationally. 63–64. 2 indexed citations
8.
Cheney, James, et al.. (2014). Entangled State Monads. Oxford University Research Archive (ORA) (University of Oxford). 1133. 108–111. 2 indexed citations
9.
Cheney, James, James McKinna, Perdita Stevens, & Jeremy Gibbons. (2014). Towards a Repository of BX Examples. Oxford University Research Archive (ORA) (University of Oxford). 1133. 87–91. 12 indexed citations
10.
Geuvers, Herman, Robbert Krebbers, & James McKinna. (2012). TheλμT-calculus. Annals of Pure and Applied Logic. 164(6). 676–701.
11.
McBride, Conor, et al.. (2010). Type inference in context. Radboud Repository (Radboud University). 43–54. 11 indexed citations
12.
Kaliszyk, Cezary, et al.. (2008). A real semantic web for mathematics deserves a real semantics. TU/e Research Portal. 62–66. 2 indexed citations
13.
Brady, Edwin, James McKinna, & Kevin Hammond. (2007). Constructing Correct Circuits: Verification of Functional Aspects of Hardware Specifications with Dependent Types.. 159–176. 5 indexed citations
14.
McKinna, James. (2006). Why dependent types matter. ACM SIGPLAN Notices. 41(1). 1–1. 5 indexed citations
15.
McBride, Conor, Healfdene Goguen, & James McKinna. (2005). A few constructions on constructors.
16.
McBride, Conor & James McKinna. (2004). The view from the left. Journal of Functional Programming. 14(1). 69–111. 173 indexed citations
17.
McBride, Conor & James McKinna. (2004). Functional pearl. 1–9. 23 indexed citations
18.
Callaghan, Paul D., Zhaohui Luo, James McKinna, & Robert Pollack. (2002). Types for Proofs and Programs : International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000 : selected papers. Springer eBooks. 2 indexed citations
19.
McKinna, James & Robert Pollack. (1999). Some Lambda Calculus and Type Theory Formalized. Journal of Automated Reasoning. 23(3). 373–409. 64 indexed citations
20.
McKinna, James & Robert Pollack. (1997). Some Lambda Calculus and Type Theory Formalized. BRICS Report Series. 4(51). 19 indexed citations

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