Roger Hindley
About
In The Last Decade
Roger Hindley
15 papers receiving 409 citations
Peers
Comparison fields: 5 of 27
- Artificial Intelligence 473
- Computational Theory and Mathematics 334
- Hardware and Architecture 71
- Computer Networks and Communications 62
- Information Systems 51
Countries citing papers authored by Roger Hindley
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
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
| # | Title | Journal | Authors | Indexed citations |
|---|---|---|---|---|
| 1 | History of Lambda-calculus and Combinatory Logic | Roger Hindley et al. | 10 | |
| 2 | The completeness theorem for typing λ-terms | Theoretical Computer Science | Roger Hindley | 57 |
| 3 | Curry's type-rules are complete with respect to the F-semantics too | Theoretical Computer Science | Roger Hindley | 17 |
| 4 | Lambda‐Calculus Models and Extensionality | Mathematical logic quarterly | Roger Hindley, G. Longo | 68 |
| 5 | Standard and normal reductions | Transactions of the American Mathematical Society | Roger Hindley | 10 |
| 6 | Reductions of residuals are finite | Transactions of the American Mathematical Society | Roger Hindley | 13 |
| 7 | The equivalence of complete reductions | Transactions of the American Mathematical Society | Roger Hindley | 7 |
| 8 | Some remarks about the connections between Combinatory Logic and axiomatic recursion theory | Archive for Mathematical Logic | Roger Hindley et al. | 1 |
| 9 | Combinatory Reductions and Lambda Reductions Compared | Mathematical logic quarterly | Roger Hindley | 10 |
| 10 | An abstract Church-Rosser theorem. II: Applications | Journal of Symbolic Logic | Roger Hindley | 14 |
| 11 | A short proof of Curry’s normal form theorem | Proceedings of the American Mathematical Society | Roger Hindley et al. | 4 |
| 12 | A Short Proof of Curry's Normal Form Theorem | Proceedings of the American Mathematical Society | Roger Hindley et al. | 2 |
| 13 | An Abstract form of the church-rosser theorem. I | Journal of Symbolic Logic | Roger Hindley | 20 |
| 14 | The principle type-scheme of an object in combinatory logic | Transactions of the American Mathematical Society | Roger Hindley | 257 |
| 15 | Axioms for strong reduction in combinatory logic | Journal of Symbolic Logic | Roger Hindley | 10 |
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.