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.
Report on the programming language Haskell
1992527 citationsPaul Hudak, Simon Peyton Jones et al.ACM SIGPLAN Noticesprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Joseph H. Fasel
Since
Specialization
Citations
This map shows the geographic impact of Joseph H. Fasel'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 Joseph H. Fasel with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Joseph H. Fasel more than expected).
This network shows the impact of papers produced by Joseph H. Fasel. 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 Joseph H. Fasel. The network helps show where Joseph H. Fasel may publish in the future.
Co-authorship network of co-authors of Joseph H. Fasel
This figure shows the co-authorship network connecting the top 25 collaborators of Joseph H. Fasel.
A scholar is included among the top collaborators of Joseph H. Fasel 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 Joseph H. Fasel. Joseph H. Fasel is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
9 of 9 papers shown
1.
Hudak, Paul, Simon Jones, Philip Wadler, et al.. (1992). Report on the Programming Language Haskell, A Non-strict, Purely Functional Language.. ACM SIGPLAN Notices. 27. 1.148 indexed citations
2.
Fasel, Joseph H., Paul Hudak, Simon Jones, & Philip Wadler. (1992). SIGPLAN Notices Special Issue on the Functional Programming Language Haskell.. ACM SIGPLAN Notices. 27. 1.7 indexed citations
Hudak, Paul, Simon Peyton Jones, Philip Wadler, et al.. (1992). Report on the programming language Haskell. ACM SIGPLAN Notices. 27(5). 1–164.527 indexed citations breakdown →
5.
Fasel, Joseph H. & Robert Keller. (1987). Graph Reduction: Proceedings of a Workshop Santa Fe, New Mexico, USA, September 29 - October 1, 1986. Medical Entomology and Zoology.
6.
Fasel, Joseph H. & Robert Keller. (1987). Proc. of a workshop on Graph reduction.7 indexed citations
7.
Fasel, Joseph H. & W Brauer. (1987). Graph Reduction. Lecture notes in computer science.1 indexed citations
8.
Fasel, Joseph H. & Robert Keller. (1986). Proceedings of the Workshop on Graph Reduction.8 indexed citations
9.
Fasel, Joseph H.. (1980). PROGRAMMING LANGUAGES AS ABSTRACT DATA TYPES: DEFINITION AND IMPLEMENTATION. Purdue e-Pubs (Purdue University System).
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.