Daniel P. Friedman

	2008
68		Daniel P. Friedman, Mitchell Wand: Essentials of programming languages (3. ed.). MIT Press 2008: I-XXII, 1-410
67		Oleg Kiselyov, William E. Byrd, Daniel P. Friedman, Chung-chieh Shan: Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl). FLOPS 2008: 64-80
66		Joseph P. Near, William E. Byrd, Daniel P. Friedman: alpha-leanTAP: A Declarative Theorem Prover for First-Order Classical Logic. ICLP 2008: 238-252
65		Mitchell Wand, Daniel P. Friedman: Programming languages: fundamental concepts for expanding and disciplining the mind. SIGPLAN Notices 43(11): 133-135 (2008)
	2007
64		Daniel P. Friedman, Abdulaziz Ghuloum, Jeremy G. Siek, Onnie Lynn Winebarger: Improving the lazy Krivine machine. Higher-Order and Symbolic Computation 20(3): 271-293 (2007)
	2005
63		Daniel P. Friedman, William E. Byrd, Oleg Kiselyov: The reasoned schemer. MIT Press 2005: I-X, 1-169
62		Oleg Kiselyov, Chung-chieh Shan, Daniel P. Friedman, Amr Sabry: Backtracking, interleaving, and terminating monad transformers: (functional pearl). ICFP 2005: 192-203
	2002
61		Daniel P. Friedman, Amr Sabry: CPS in little pieces: composing partial continuations. J. Funct. Program. 12(6): 617-622 (2002)
	2001
60		Daniel P. Friedman, Mitchell Wand, Christopher T. Haynes: Essentials of programming languages (2. ed.). MIT Press 2001: I-XVIII, 1-389
	1999
59		Steven E. Ganz, Daniel P. Friedman, Mitchell Wand: Trampolined Style. ICFP 1999: 18-27
	1998
58		Shriram Krishnamurthi, Matthias Felleisen, Daniel P. Friedman: Synthesizing Object-Oriented and Functional Design to Promote Re-Use. ECOOP 1998: 91-113
57		Jonathan Sobel, Daniel P. Friedman: Recycling Continuations. ICFP 1998: 251-260
56		Harold Abelson, R. Kent Dybvig, Christopher T. Haynes, Guillermo Juan Rozas, N. I. Adams IV, Daniel P. Friedman, Eugene E. Kohlbecker, Guy L. Steele Jr., David H. Bartley, Robert H. Halstead Jr., Don Oxley, Gerald J. Sussman, G. Brooks, Chris Hanson, Kent M. Pitman, Mitchell Wand: Revised Report on the Algorithmic Language Scheme. Higher-Order and Symbolic Computation 11(1): 7-105 (1998)
	1996
55		Daniel P. Friedman, Matthias Felleisen: The little schemer (4. ed.). MIT Press 1996: I-XIII, 1-196
54		Daniel P. Friedman, Matthias Felleisen: The seasoned schemer. MIT Press 1996: I-XIII, 1-210
53		Matthias Felleisen, Daniel P. Friedman: A little Java, a few patterns. MIT Press 1996: I-XIV, 1-179
52		Matthias Felleisen, Daniel P. Friedman: The little MLer. MIT Press 1996: I-XVI, 1-181
51		Jonathan G. Rossie Jr., Daniel P. Friedman, Mitchell Wand: Modeling Subobject-based Inheritance. ECOOP 1996: 248-274
50		Shinn-Der Lee, Daniel P. Friedman: Enriching the Lambda Calculus with Contexts: Toward a Theory of Incremental Program Construction. ICFP 1996: 239-250
49		Stanley Jefferson, Daniel P. Friedman: A Simple Reflective Interpreter. Lisp and Symbolic Computation 9(2-3): 181-202 (1996)
	1995
48		Eric Hilsdale, J. Michael Ashley, R. Kent Dybvig, Daniel P. Friedman: Compiler Construction Using Scheme. FPLE 1995: 251-267
47		Jonathan G. Rossie Jr., Daniel P. Friedman: An Algebraic Semantics of Subobjects. OOPSLA 1995: 187-199
	1993
46		Arthur M. Riehl, Daniel P. Friedman, Brian Harvey, Simon M. Kaplan, Richard M. Salter, George Springer: Using Scheme in the Introductory Computer Science Curriculum (abstract). ACM Conference on Computer Science 1993: 533-534
45		Shinn-Der Lee, Daniel P. Friedman: Quasi-Static Scoping: Sharing Variable Bindings Across Multiple Lexical Scopes. POPL 1993: 479-492
44		Arthur M. Riehl, Daniel P. Friedman, Brian Harvey, Simon M. Kaplan, Richard M. Salter, George Springer: Using SCHEME in the introductory computer science curriculum (abstract). SIGCSE 1993: 288
43		Rhys Price Jones, Doug Cooper, Daniel P. Friedman, Richard C. Holt, Peter Robinson: Issues in the choice of programming language for CS 1 (abstract). SIGCSE 1993: 301
	1992
42		Daniel P. Friedman, Mitchell Wand, Christopher T. Haynes: Essentials of programming languages. MIT Press 1992: 1-536
41		Eric T. Freeman, Daniel P. Friedman: Characterizing the Paralation Model using Dynamic Assignment. PARLE 1992: 483-496
40		Shinn-Der Lee, Daniel P. Friedman: First-Class Extents. Lisp and Symbolic Computation 5(4): 343-375 (1992)
	1990
39		Stanley Jefferson, Shinn-Der Lee, Daniel P. Friedman: A Syntactic Theory of Transparent Parameterization. ESOP 1990: 212-226
38		John V. Franco, Daniel P. Friedman, Steven D. Johnson: Multi-Way Streams in Scheme. Comput. Lang. 15(1): 109-125 (1990)
37		John V. Franco, Daniel P. Friedman: Towards a Facility for Lexically Scoped, Dynamic Mutual Recursion in Scheme. Comput. Lang. 15(1): 54-64 (1990)
	1989
36		John V. Franco, Daniel P. Friedman: Creating Efficient Programs by Exchanging Data for Procedures. Comput. Lang. 14(1): 11-23 (1989)
35		Matthias Felleisen, Daniel P. Friedman: A Syntactic Theory of Sequential State. Theor. Comput. Sci. 69(3): 243-287 (1989)
	1988
34		Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, Bruce F. Duba: Abstract Continuations: A Mathematical Semantics for Handling Full Jumps. LISP and Functional Programming 1988: 52-62
33		Mitchell Wand, Daniel P. Friedman: The Mystery of the Tower Revealed: A Nonreflective Description of the Reflective Tower. Lisp and Symbolic Computation 1(1): 11-37 (1988)
32		R. Kent Dybvig, Daniel P. Friedman, Christopher T. Haynes: Expansion-Passing Style: A General Macro Mechanism. Lisp and Symbolic Computation 1(1): 53-75 (1988)
	1987
31		Matthias Felleisen, Daniel P. Friedman: A Reduction Semantics for Imperative Higher-Order Languages. PARLE (2) 1987: 206-223
30		Matthias Felleisen, Daniel P. Friedman: A Calculus for Assignments in Higher-Order Languages. POPL 1987: 314-325
29		Christopher T. Haynes, Daniel P. Friedman: Embedding Continuations in Procedural Objects. ACM Trans. Program. Lang. Syst. 9(4): 582-598 (1987)
28		Christopher T. Haynes, Daniel P. Friedman: Abstracting Timed Preemption with Engines. Comput. Lang. 12(2): 109-121 (1987)
27		Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker, Bruce F. Duba: A Syntactic Theory of Sequential Control. Theor. Comput. Sci. 52: 205-237 (1987)
	1986
26		Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker, Bruce F. Duba: Reasoning with Continuations LICS 1986: 131-141
25		R. Kent Dybvig, Daniel P. Friedman, Christopher T. Haynes: Expansion-Passing Style: Beyond Conventional Macros. LISP and Functional Programming 1986: 143-150
24		Eugene E. Kohlbecker, Daniel P. Friedman, Matthias Felleisen, Bruce F. Duba: Hygienic Macro Expansion. LISP and Functional Programming 1986: 151-161
23		Mitchell Wand, Daniel P. Friedman: The Mystery of the Tower Revealed: A Non-Reflective Description of the Reflective Tower. LISP and Functional Programming 1986: 298-307
22		Matthias Felleisen, Daniel P. Friedman: A Closer Look at Export and Import Statements. Comput. Lang. 11(1): 29-37 (1986)
21		Christopher T. Haynes, Daniel P. Friedman, Mitchell Wand: Obtaining Coroutines with Continuations. Comput. Lang. 11(3/4): 143-153 (1986)
	1985
20		Daniel P. Friedman, Christopher T. Haynes: Constraining Control. POPL 1985: 245-254
	1984
19		Christopher T. Haynes, Daniel P. Friedman: Engines Build Process Abstractions. LISP and Functional Programming 1984: 18-24
18		Christopher T. Haynes, Daniel P. Friedman, Mitchell Wand: Continuations and Coroutines. LISP and Functional Programming 1984: 293-298
17		Daniel P. Friedman, Mitchell Wand: Reification: Reflection without Metaphysics. LISP and Functional Programming 1984: 348-355
	1982
16		Robert E. Filman, Daniel P. Friedman: Models, languages, and heuristics for distributed computing. AFIPS National Computer Conference 1982: 671-677
	1980
15		Daniel P. Friedman, David S. Wise: An Indeterminate Constructor for Applicative Programming. POPL 1980: 245-250
14		Richard M. Salter, Terence J. Brennan, Daniel P. Friedman: Concur: A Language for Continuous, Concurrent Processes. Comput. Lang. 5(3): 163-189 (1980)
	1979
13		Daniel P. Friedman, David S. Wise: An Approach to Fair Applicative Multiprogramming. Semantics of Concurrent Computation 1979: 203-225
12		Daniel P. Friedman, David S. Wise: Reference Counting Can Manage the Circular Environments of Mutual Recursion. Inf. Process. Lett. 8(1): 41-45 (1979)
	1978
11		Daniel P. Friedman, David S. Wise: A Note on Conditional Expressions. Commun. ACM 21(11): 931-933 (1978)
10		Daniel P. Friedman, David S. Wise: Functional Combination. Comput. Lang. 3(1): 31-35 (1978)
9		Mitchell Wand, Daniel P. Friedman: Compiling Lambda-Expressions Using Continuations and Factorizations. Comput. Lang. 3(4): 241-263 (1978)
8		Daniel P. Friedman, David S. Wise: Aspects of Applicative Programming for Parallel Processing. IEEE Trans. Computers 27(4): 289-296 (1978)
7		Daniel P. Friedman, David S. Wise: Unbounded Computational Structures. Softw., Pract. Exper. 8(4): 407-416 (1978)
	1977
6		Daniel P. Friedman, David S. Wise: Aspects of Applicative Programming for File Systems (Preliminary Version). Language Design for Reliable Software 1977: 41-55
5		John D. Lowrance, Daniel P. Friedman: Hendrix's Model for Simultaneous Actions and Continuous Processes: An Introduction and Implementation. International Journal of Man-Machine Studies 9(5): 537-581 (1977)
	1976
4		Daniel P. Friedman, David S. Wise: CONS Should Not Evaluate its Arguments. ICALP 1976: 257-284
3		Daniel P. Friedman, David S. Wise: Output Driven Interpretation of Recursive Programs, or Writing Creates and Destroys Data Structures. Inf. Process. Lett. 5(6): 155-160 (1976)
2		Daniel P. Friedman, David S. Wise: Garbage Collecting a Heap Which Includes a Scatter Table. Inf. Process. Lett. 5(6): 161-164 (1976)
	1971
1		Terrence W. Pratt, Daniel P. Friedman: A Language Extension for Graph Processing and Its Formal Semantics. Commun. ACM 14(7): 460-467 (1971)

Coauthor Index

1	Harold Abelson	[56]
2	N. I. Adams IV	[56]
3	J. Michael Ashley	[48]
4	David H. Bartley	[56]
5	Terence J. Brennan	[14]
6	G. Brooks	[56]
7	William E. Byrd	[63] [66] [67]
8	Doug Cooper	[43]
9	Bruce F. Duba	[24] [26] [27] [34]
10	R. Kent Dybvig	[25] [32] [48] [56]
11	Matthias Felleisen	[22] [24] [26] [27] [30] [31] [34] [35] [52] [53] [54] [55] [58]
12	Robert E. Filman	[16]
13	John V. Franco	[36] [37] [38]
14	Eric T. Freeman	[41]
15	Steven E. Ganz	[59]
16	Abdulaziz Ghuloum	[64]
17	Robert H. Halstead Jr.	[56]
18	Chris Hanson	[56]
19	Brian Harvey	[44] [46]
20	Christopher T. Haynes	[18] [19] [20] [21] [25] [28] [29] [32] [42] [56] [60]
21	Eric Hilsdale	[48]
22	Richard C. Holt	[43]
23	Stanley Jefferson	[39] [49]
24	Steven D. Johnson	[38]
25	Rhys Price Jones	[43]
26	Simon M. Kaplan	[44] [46]
27	Oleg Kiselyov	[62] [63] [67]
28	Eugene E. Kohlbecker	[24] [26] [27] [56]
29	Shriram Krishnamurthi	[58]
30	Shinn-Der Lee	[39] [40] [45] [50]
31	John D. Lowrance	[5]
32	Joseph P. Near	[66]
33	Don Oxley	[56]
34	Kent M. Pitman	[56]
35	Terrence W. Pratt	[1]
36	Arthur M. Riehl	[44] [46]
37	Peter Robinson	[43]
38	Jonathan G. Rossie Jr.	[47] [51]
39	Guillermo Juan Rozas	[56]
40	Amr Sabry	[61] [62]
41	Richard M. Salter	[14] [44] [46]
42	Chung-chieh Shan	[62] [67]
43	Jeremy G. Siek	[64]
44	Jonathan Sobel	[57]
45	George Springer	[44] [46]
46	Guy L. Steele Jr.	[56]
47	Gerald J. Sussman (Gerald Jay Sussman)	[56]
48	Mitchell Wand	[9] [17] [18] [21] [23] [33] [34] [42] [51] [56] [59] [60] [65] [68]
49	Onnie Lynn Winebarger	[64]
50	David S. Wise	[2] [3] [4] [6] [7] [8] [10] [11] [12] [13] [15]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page