Daniel P. Friedman

5.0k total citations
88 papers, 2.9k citations indexed

About

Daniel P. Friedman is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Hardware and Architecture. According to data from OpenAlex, Daniel P. Friedman has authored 88 papers receiving a total of 2.9k indexed citations (citations by other indexed papers that have themselves been cited), including 61 papers in Artificial Intelligence, 35 papers in Computational Theory and Mathematics and 25 papers in Hardware and Architecture. Recurrent topics in Daniel P. Friedman's work include Logic, programming, and type systems (53 papers), Parallel Computing and Optimization Techniques (25 papers) and Formal Methods in Verification (20 papers). Daniel P. Friedman is often cited by papers focused on Logic, programming, and type systems (53 papers), Parallel Computing and Optimization Techniques (25 papers) and Formal Methods in Verification (20 papers). Daniel P. Friedman collaborates with scholars based in United States, Mexico and Israel. Daniel P. Friedman's co-authors include Matthias Felleisen, Christopher T. Haynes, Robert E. Filman, David S. Wise, Mitchell Wand, Eugene E. Kohlbecker, Bruce F. Duba, M. Wand, R. Kent Dybvig and Guy L. Steele and has published in prestigious journals such as Communications of the ACM, Expert Systems with Applications and Theoretical Computer Science.

In The Last Decade

Daniel P. Friedman

83 papers receiving 2.5k citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Daniel P. Friedman United States	26	2.4k	1.1k	878	775	710	88	2.9k
Mads Tofte Denmark	17	2.6k 1.1×	1.3k 1.3×	1.2k 1.4×	605 0.8×	832 1.2×	29	3.2k
Gilad Bracha United States	17	2.0k 0.8×	434 0.4×	541 0.6×	1.2k 1.6×	788 1.1×	27	2.5k
R. M. Burstall United Kingdom	21	2.1k 0.9×	1.4k 1.3×	401 0.5×	473 0.6×	406 0.6×	40	2.7k
Tim Teitelbaum United States	23	1.3k 0.6×	411 0.4×	566 0.6×	957 1.2×	594 0.8×	45	2.2k
Hanne Riis Nielson Denmark	21	1.6k 0.7×	1.0k 1.0×	494 0.6×	754 1.0×	728 1.0×	140	2.5k
Flemming Nielson Denmark	23	1.8k 0.8×	1.2k 1.1×	548 0.6×	785 1.0×	758 1.1×	147	2.7k
Martin Odersky Switzerland	33	2.8k 1.2×	975 0.9×	1.6k 1.9×	1.1k 1.4×	1.4k 2.0×	142	4.0k
Gilles Kahn France	16	1.0k 0.4×	762 0.7×	1.2k 1.4×	387 0.5×	928 1.3×	29	2.3k
Bowen Alpern United States	20	1.3k 0.5×	732 0.7×	1.0k 1.1×	484 0.6×	1.2k 1.6×	45	2.4k
Jens Palsberg United States	31	2.5k 1.0×	1.1k 1.1×	1.0k 1.2×	1.1k 1.5×	1.1k 1.5×	202	3.6k

Countries citing papers authored by Daniel P. Friedman

Since Specialization

Citations

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

Fields of papers citing papers by Daniel P. Friedman

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Daniel P. Friedman

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

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Friedman, Daniel P., et al.. (2016). A small embedding of logic programming with a simple complete search. 96–107. 3 indexed citations

Friedman, Daniel P. & Mitchell Wand. (2008). Essentials of Programming Languages, 3rd Edition. The MIT Press eBooks. 7 indexed citations

Friedman, Daniel P. & Yishai Feldman. (2005). Automated cinematic reasoning about camera behavior. Expert Systems with Applications. 30(4). 694–704. 12 indexed citations

Friedman, Daniel P., Christopher T. Haynes, & Mitchell Wand. (2001). Essentials of programming languages (2nd ed.). 16 indexed citations

Filman, Robert E. & Daniel P. Friedman. (2000). Aspect-Oriented Programming is Quantification and Obliviousness. NASA Technical Reports Server (NASA). 328 indexed citations

Friedman, Daniel P. & Matthias Felleisen. (1996). The little Schemer (4th ed.). MIT Press eBooks. 1 indexed citations

Friedman, Daniel P., et al.. (1993). Quasi-static scoping. 479–492. 17 indexed citations

Felleisen, Matthias & Daniel P. Friedman. (1989). A syntactic theory of sequential state. Theoretical Computer Science. 69(3). 243–287. 35 indexed citations

Felleisen, Matthias, Daniel P. Friedman, Eugene E. Kohlbecker, & Bruce F. Duba. (1987). A syntactic theory of sequential control. Theoretical Computer Science. 52(3). 205–237. 116 indexed citations

10.

Felleisen, Matthias & Daniel P. Friedman. (1987). Control operators, the SECD-machine, and the λ-calculus.. 193–222. 107 indexed citations

11.

Clinger, William, Daniel P. Friedman, & M. Wand. (1986). A scheme for a higher-level semantic algebra. Cambridge University Press eBooks. 237–250. 38 indexed citations

12.

Felleisen, Matthias, Daniel P. Friedman, Eugene E. Kohlbecker, & Bruce F. Duba. (1986). Reasoning with Continuations. 131–141. 44 indexed citations

13.

Friedman, Daniel P. & Christopher T. Haynes. (1985). Constraining control. 245–254. 37 indexed citations

14.

Haynes, Christopher T., Daniel P. Friedman, & Mitchell Wand. (1984). Continuations and coroutines. 293–298. 58 indexed citations

15.

Salter, Richard, et al.. (1980). CONCUR: A language for continuous, concurrent processes. Computer Languages. 5(3-4). 163–189. 3 indexed citations

16.

Friedman, Daniel P. & David S. Wise. (1979). Reference counting can manage the circular invironments of mutual recursion. Information Processing Letters. 8(1). 41–45. 19 indexed citations

17.

Wand, Mitchell & Daniel P. Friedman. (1978). Compiling lambda-expressions using continuations and factorizations. Computer Languages. 3(4). 241–263. 9 indexed citations

18.

Friedman, Daniel P. & David S. Wise. (1977). Aspects of applicative programming for file systems (Preliminary Version). 41–55. 6 indexed citations

19.

Friedman, Daniel P. & David S. Wise. (1976). CONS Should Not Evaluate its Arguments.. International Colloquium on Automata, Languages and Programming. 257–284. 184 indexed citations

20.

Friedman, Daniel P., David S. Wise, & Mitchell Wand. (1976). Recursive programming through table look-up. 85–89. 16 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