Daniel P. Friedman

According to our database1, Daniel P. Friedman authored at least 75 papers between 1971 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
A Framework for Extending microKanren with Constraints.
Proceedings of the Proceedings 29th and 30th Workshops on (Constraint) Logic Programming and 24th International Workshop on Functional and (Constraint) Logic Programming, 2017

A Simple Complete Search for Logic Programming.
Proceedings of the Technical Communications of the 33rd International Conference on Logic Programming, 2017

2016
A small embedding of logic programming with a simple complete search.
Proceedings of the 12th Symposium on Dynamic Languages, 2016

2012
miniKanren, live and untagged: quine generation via relational interpreters (programming pearl).
Proceedings of the 2012 Annual Workshop on Scheme and Functional Programming, 2012

2008
Programming languages: fundamental concepts for expanding and disciplining the mind.
ACM SIGPLAN Notices, 2008

alpha-leanTAP: A Declarative Theorem Prover for First-Order Classical Logic.
Proceedings of the Logic Programming, 24th International Conference, 2008

Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl).
Proceedings of the Functional and Logic Programming, 9th International Symposium, 2008

Essentials of programming languages (3. ed.).
MIT Press, ISBN: 978-0-262-06279-4, 2008

2007
Improving the lazy Krivine machine.
High. Order Symb. Comput., 2007

2005
Backtracking, interleaving, and terminating monad transformers: (functional pearl).
Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, 2005

The reasoned schemer.
MIT Press, ISBN: 978-0-262-56214-0, 2005

2002
CPS in little pieces: composing partial continuations.
J. Funct. Program., 2002

2001
Essentials of programming languages (2. ed.).
MIT Press, ISBN: 978-0-262-06217-6, 2001

1999
Trampolined Style.
Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP '99), 1999

1998
Revised Report on the Algorithmic Language Scheme.
High. Order Symb. Comput., 1998

Teaching Nondeterministic and Universal Automata Using SCHEME.
Comput. Sci. Educ., 1998

Recycling Continuations.
Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP '98), 1998

Synthesizing Object-Oriented and Functional Design to Promote Re-Use.
Proceedings of the ECOOP'98, 1998

1996
A Simple Reflective Interpreter.
LISP Symb. Comput., 1996

Enriching the Lambda Calculus with Contexts: Toward a Theory of Incremental Program Construction.
Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, 1996

Modeling Subobject-based Inheritance.
Proceedings of the ECOOP'96, 1996

A little Java, a few patterns.
MIT Press, ISBN: 978-0-262-56115-0, 1996

The little MLer.
MIT Press, ISBN: 978-0-262-56114-3, 1996

The little schemer (4. ed.).
MIT Press, ISBN: 978-0-262-56099-3, 1996

The seasoned schemer.
MIT Press, ISBN: 978-0-262-56100-6, 1996

1995
An Algebraic Semantics of Subobjects.
Proceedings of the OOPSLA'95, 1995

Compiler Construction Using Scheme.
Proceedings of the Functional Programming Languages in Education, 1995

1993
Issues in the choice of programming language for CS 1 (abstract).
Proceedings of the 24th SIGCSE Technical Symposium on Computer Science Education, 1993

Quasi-Static Scoping: Sharing Variable Bindings Across Multiple Lexical Scopes.
Proceedings of the Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1993

Using Scheme in the Introductory Computer Science Curriculum (abstract).
Proceedings of the ACM 21th Conference on Computer Science, 1993

1992
First-Class Extents.
LISP Symb. Comput., 1992

Characterizing the Paralation Model using Dynamic Assignment.
Proceedings of the PARLE '92: Parallel Architectures and Languages Europe, 1992

Essentials of programming languages.
MIT Press, ISBN: 978-0-262-06145-2, 1992

1990
Multi-Way Streams in Scheme.
Comput. Lang., 1990

Towards a Facility for Lexically Scoped, Dynamic Mutual Recursion in Scheme.
Comput. Lang., 1990

A Syntactic Theory of Transparent Parameterization.
Proceedings of the ESOP'90, 1990

1989
A Syntactic Theory of Sequential State.
Theor. Comput. Sci., 1989

Creating Efficient Programs by Exchanging Data for Procedures.
Comput. Lang., 1989

1988
The Mystery of the Tower Revealed: A Nonreflective Description of the Reflective Tower.
LISP Symb. Comput., 1988

Expansion-Passing Style: A General Macro Mechanism.
LISP Symb. Comput., 1988

Abstract Continuations: A Mathematical Semantics for Handling Full Jumps.
Proceedings of the 1988 ACM Conference on LISP and Functional Programming, 1988

1987
Embedding Continuations in Procedural Objects.
ACM Trans. Program. Lang. Syst., 1987

A Syntactic Theory of Sequential Control.
Theor. Comput. Sci., 1987

Abstracting Timed Preemption with Engines.
Comput. Lang., 1987

A Calculus for Assignments in Higher-Order Languages.
Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987

A Reduction Semantics for Imperative Higher-Order Languages.
Proceedings of the PARLE, 1987

Control operators, the SECD-machine, and the λ-calculus.
Proceedings of the Formal Description of Programming Concepts - III: Proceedings of the IFIP TC 2/WG 2.2 Working Conference on Formal Description of Programming Concepts, 1987

1986
Obtaining Coroutines with Continuations.
Comput. Lang., 1986

A Closer Look at Export and Import Statements.
Comput. Lang., 1986

Reasoning with Continuations
Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

The Mystery of the Tower Revealed: A Non-Reflective Description of the Reflective Tower.
Proceedings of the 1986 ACM Conference on LISP and Functional Programming, 1986

Hygienic Macro Expansion.
Proceedings of the 1986 ACM Conference on LISP and Functional Programming, 1986

Expansion-Passing Style: Beyond Conventional Macros.
Proceedings of the 1986 ACM Conference on LISP and Functional Programming, 1986

1985
Constraining Control.
Proceedings of the Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, 1985

1984
Continuations and Coroutines.
Proceedings of the 1984 ACM Conference on LISP and Functional Programming, 1984

Engines Build Process Abstractions.
Proceedings of the 1984 ACM Conference on LISP and Functional Programming, 1984

Reification: Reflection without Metaphysics.
Proceedings of the 1984 ACM Conference on LISP and Functional Programming, 1984

1982
Models, languages, and heuristics for distributed computing.
Proceedings of the American Federation of Information Processing Societies: 1982 National Computer Conference, 1982

1980
Concur: A Language for Continuous, Concurrent Processes.
Comput. Lang., 1980

An Indeterminate Constructor for Applicative Programming.
Proceedings of the Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, 1980

1979
Reference Counting Can Manage the Circular Environments of Mutual Recursion.
Inf. Process. Lett., 1979

An Approach to Fair Applicative Multiprogramming.
Proceedings of the Semantics of Concurrent Computation, 1979

1978
Aspects of Applicative Programming for Parallel Processing.
IEEE Trans. Computers, 1978

Unbounded Computational Structures.
Softw. Pract. Exp., 1978

Compiling Lambda-Expressions Using Continuations and Factorizations.
Comput. Lang., 1978

Functional Combination.
Comput. Lang., 1978

A Note on Conditional Expressions.
Commun. ACM, 1978

1977
Hendrix's Model for Simultaneous Actions and Continuous Processes: An Introduction and Implementation.
Int. J. Man Mach. Stud., 1977

Aspects of Applicative Programming for File Systems (Preliminary Version).
Proceedings of an ACM Conference on Language Design for Reliable Software (LDRS), 1977

1976
Garbage Collecting a Heap Which Includes a Scatter Table.
Inf. Process. Lett., 1976

Output Driven Interpretation of Recursive Programs, or Writing Creates and Destroys Data Structures.
Inf. Process. Lett., 1976

Recursive programming through table look-up.
Proceedings of the SYMSAC 1976, 1976

CONS Should Not Evaluate its Arguments.
Proceedings of the Third International Colloquium on Automata, 1976

General interest (Paper Session).
Proceedings of the 1976 Annual Conference, Houston, Texas, USA, October 20-22, 1976, 1976

1971
A Language Extension for Graph Processing and Its Formal Semantics.
Commun. ACM, 1971


  Loading...