Roger Hindley

934 total citations
15 papers, 500 citations indexed

About

Roger Hindley is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Applied Mathematics. According to data from OpenAlex, Roger Hindley has authored 15 papers receiving a total of 500 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Artificial Intelligence, 11 papers in Computational Theory and Mathematics and 2 papers in Applied Mathematics. Recurrent topics in Roger Hindley's work include Logic, Reasoning, and Knowledge (11 papers), Advanced Algebra and Logic (10 papers) and Logic, programming, and type systems (9 papers). Roger Hindley is often cited by papers focused on Logic, Reasoning, and Knowledge (11 papers), Advanced Algebra and Logic (10 papers) and Logic, programming, and type systems (9 papers). Roger Hindley collaborates with scholars based in United Kingdom, Germany and United States. Roger Hindley's co-authors include G. Longo and has published in prestigious journals such as Transactions of the American Mathematical Society, Theoretical Computer Science and Proceedings of the American Mathematical Society.

In The Last Decade

Roger Hindley

15 papers receiving 409 citations

Peers

Roger Hindley
N. P. Mendler United Kingdom
W. R. Cleaveland United States
Stuart F. Allen United States
G. Huet France
Douglas J. Howe United States
Harry G. Mairson United States
Daniël Leivant United States
N. P. Mendler United Kingdom
Roger Hindley
Citations per year, relative to Roger Hindley Roger Hindley (= 1×) peers N. P. Mendler

Countries citing papers authored by Roger Hindley

Since Specialization
Citations

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

Fields of papers citing papers by Roger Hindley

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Roger Hindley

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

All Works

15 of 15 papers shown
1.
Hindley, Roger, et al.. (2006). History of Lambda-calculus and Combinatory Logic. 10 indexed citations
2.
Hindley, Roger. (1983). The completeness theorem for typing λ-terms. Theoretical Computer Science. 22(1-2). 1–17. 57 indexed citations
3.
Hindley, Roger. (1983). Curry's type-rules are complete with respect to the F-semantics too. Theoretical Computer Science. 22(1-2). 127–133. 17 indexed citations
4.
Hindley, Roger & G. Longo. (1980). Lambda‐Calculus Models and Extensionality. Mathematical logic quarterly. 26(19-21). 289–310. 68 indexed citations
5.
Hindley, Roger. (1978). Standard and normal reductions. Transactions of the American Mathematical Society. 241(0). 253–271. 10 indexed citations
6.
Hindley, Roger. (1978). Reductions of residuals are finite. Transactions of the American Mathematical Society. 240(0). 345–361. 13 indexed citations
7.
Hindley, Roger. (1977). The equivalence of complete reductions. Transactions of the American Mathematical Society. 229(0). 227–248. 7 indexed citations
8.
Hindley, Roger, et al.. (1977). Some remarks about the connections between Combinatory Logic and axiomatic recursion theory. Archive for Mathematical Logic. 18(1). 99–103. 1 indexed citations
9.
Hindley, Roger. (1977). Combinatory Reductions and Lambda Reductions Compared. Mathematical logic quarterly. 23(7-12). 169–180. 10 indexed citations
10.
Hindley, Roger. (1974). An abstract Church-Rosser theorem. II: Applications. Journal of Symbolic Logic. 39(1). 1–21. 14 indexed citations
11.
Hindley, Roger, et al.. (1970). A short proof of Curry’s normal form theorem. Proceedings of the American Mathematical Society. 24(4). 808–810. 4 indexed citations
12.
Hindley, Roger, et al.. (1970). A Short Proof of Curry's Normal Form Theorem. Proceedings of the American Mathematical Society. 24(4). 808–808. 2 indexed citations
13.
Hindley, Roger. (1969). An Abstract form of the church-rosser theorem. I. Journal of Symbolic Logic. 34(4). 545–560. 20 indexed citations
14.
Hindley, Roger. (1969). The principle type-scheme of an object in combinatory logic. Transactions of the American Mathematical Society. 146. 29–29. 257 indexed citations
15.
Hindley, Roger. (1967). Axioms for strong reduction in combinatory logic. Journal of Symbolic Logic. 32(2). 224–236. 10 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