| Searching for PHRASE daniel p friedman. |
522 citations found. Only retrieving 500 citations (System busy - maximum reduced). Only a fraction of citations to each article may be shown. Retrieving citations...
Context Doc 45 (4): Daniel P. Friedman, Mitchell Wand, and Christopher T. Haynes. Essentials of Programming Languages, second edition. The MIT Press, 2001.
Context Doc 25 (7): Eugene Kohlbecker, Daniel P. Friedman, Matthias Felleisen, and Bruce Duba. Hygienic macro expansion. In Proceedings of the ACM Conference on LISP and Functional Programming, pages 151--181, 1986.
Context Doc 23 (3): Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, and Bruce F. Duba. Abstract continuations: A mathematical semantics for handling full functional jumps. In Robert (Corky) Cartwright, editor, Proceedings of the 1988.
Context Doc 16 (1): Matthias Felleisen, Daniel P. Friedman, Eugene Kohlbecker, and Bruce Duba. A syntactic theory of sequential control. Theoretical Computer Science, 52:205--237, 1987.
Context Doc 15 (1): Mitchell Wand and Daniel P. Friedman. The mystery of the tower revealed: A non-reflective description of the reflective tower. Lisp and Symbolic Computation, 1(1), May 1988.
Context Doc 14 (1): William Clinger, Daniel P. Friedman, and Mitchell Wand. A scheme for a higher-level semantic algebra. In John Reynolds and Maurice Nivat, editors, Algebraic Methods in Semantics, pages 237--250. Cambridge University Press, 1985.
Context Doc 13 (2): Chris T. Haynes and Daniel P. Friedman. Abstracting timed preemption with engines. Computer Languages, Vol. 12, No. 2 (1987), 109--121..
Context Doc 11 (1): Christopher T. Haynes, Daniel P. Friedman, and Mitchell Wand. Continuations and coroutines. In Conference Record of the 1984 ACM Symposium on Lisp and Functional Programming, pages 293--298, Austin, TX., 1984.
Context Doc 11 (2): George Springer and Daniel P. Friedman. Scheme and the Art of Programming. MIT Press, 1989.
Context Doc 10 (0): Matthias Felleisen and Daniel P. Friedman. Control operators, the SECD-machine and the -calculus. In Formal Description of Programming Concepts III, pages 193-217, 1986.
Context Doc 10 (1): Matthias Felleisen and Daniel P. Friedman. A Reduction Semantics for Imperative Higher-Order Languages. In Proc. Conf. on Parallel Architecture and Languages Europe, pages 206-223. Lecture Notes 259 in Computer Science. Springer-Verlag, 1987.
Context Doc 10 (0): Christopher T. Haynes and Daniel P. Friedman. Embedding continuations in procedural objects. ACM Transactions on Programming Languages and Systems, 9(4):582--598, 1987.
Context Doc 10 (1): Christopher T. Haynes, Daniel P. Friedman, and Mitchell Wand. Obtaining coroutines with continuations. Journal of Computer Languages, 11(3/4):143--153, 1986.
Context Doc 10 (1): Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker, and Bruce Duba. Reasoning with continuations. In Proceedings of the Symposium on Logic in Computer Science, pages 131--141, Washington DC, June 1986. IEEE Computer Society Press.
Context Doc 9 (2): Matthias Felleisen and Daniel P. Friedman. Control operators, the SECD-machine, and the lambda-calculus. In 3rd Working Conference on the Formal Description of Programming Concepts, pages 193--219, Ebberup, Denmark, August 1986.
Context Doc 8 (0): Christopher T. Haynes, Daniel P. Friedman, and Mitchell Wand. Obtaining coroutines from continuations. Journal of Computer Languages, 11:143--153, 1986.
Context Doc 8 (0): John Hughes. Super combinators: A new implementation method for applicative languages. In Daniel P. Friedman and David S. Wise, editors, Programming, pages 1--10, Pittsburgh, Pennsylvania, August 1982. ACM Press.
Context Doc 8 (1): Christopher T. Haynes and Daniel P. Friedman. Engines Build Process Abstractions. In Proceedings of the 1984 ACM Conference on Lisp and Functional Programming, pages 18--24. ACM, 1984.
Context Doc 8 (0): Matthias Felleisen and Daniel P. Friedman. Control operators, the SECD machine, and the #-calculus. In Martin Wirsing, editor, Formal Description of Programming Concepts III, pages 193--217. Elsevier Science Publishers B.V. (North-Holland), Amsterdam, 1986.
Context Doc 7 (1): R. Kent Dybvig, Daniel P. Friedman, and Christopher T. Haynes. "Expansion-passing style: Beyond conventional macros." 1936 ACM Conference on Lisp and Functional Programming, pp. 143-150.
Context Doc 7 (0): Shiram Krishnamurti, Matthias Felleisen, and Daniel P. Friedman. Synthesizing object-oriented and functional design to promote re-use. In Eric Jul, editor, European Conference in Object-Oriented Programming, volume 1445 of Lecture Notes in Computer Science, pages 91-113. Springer Verlag, 1998.
Context Doc 7 (1): Daniel P. Friedman, Christopher T. Haynes, and Eugene Kohlbecker. Programming with continuations. In P. Pepper, editor, Program Transformation and Programming Environments, NATO ASI Series F V8, pages 263--274. Springer Verlag, 1984. Cited on page 81.
Context Doc 7 (2): Daniel P. Friedman and Matthias Felleisen. The Little LISPer. MIT Press, 1987.
Context Doc 6 (0): Stanley Jefferson and Daniel P. Friedman. A simple reflective interpreter. In Yonezawa and Smith [131], pp. 48--55.
Context Doc 6 (0): Christopher T. Haynes, Daniel P. Friedman, Embedding Continuations in Procedural Objects, ACM TOPLAS, Volume 9, # 4, October 1987, pp 582--598.
Context Doc 5 (0): Shinn-Der Lee and Daniel P. Friedman. Quasi-static scoping: Sharing variable bindings across multiple lexical scopes. In Proc. 20th POPL, pages 479--492, 1993.
Context Doc 5 (0): Daniel P. Friedman and Mitchell Wand. Reification: Reflection without Metaphysics. In Proceedings of the 1984 ACM Symposium on LISP and functional programming, pages 348--355, 1984.
Context Doc 5 (6): R. Kent Dybvig, Daniel P. Friedman, and Christopher T. Haynes. Expansion passing style: A general macro mechanism. Lisp and Symbolic Computation, 1(1):53-- 75, June 1988.
Context Doc 5 (1): Matthias Felleisen and Daniel P. Friedman. A closer look at export and import statements. Journal of Computer Languages, 11(1):29--37, 1986.
Context Doc 4 (0): Matthias Felleisen, Daniel P. Friedman, Bruce Duba, John Merrill: Beyond Continuations, Technical Report No 216, Computer Science Department, Indiana University, Bloomington, Indiana (February 1987)
Context Doc 4 (0): Daniel P. Friedman and David S. Wise. CONS should not evaluate its arguments. In S. Michaelson and Robin Milner, editors, Third International Colloquium on Automata, Languages, and Programming, pages 257--284. Edinburgh University Press, Edinburgh, Scotland, July 1976.
Context Doc 4 (0): Shinn-Der Lee and Daniel P. Friedman. Quasi-static scoping: Sharing variable bindings across multiple lexical scopes. In Conference Record of the Twentieth ACM SIGPLAN--SIGACT Symposium on Principles of Programming Languages, pages 479--492. ACM Press, 1993. (POPL '93; Charleston, USA; 10--13 January).
Context Doc 4 (1): Daniel P. Friedman and Christopher T. Haynes. Constraining control. In Proceedings of the Twelfth Annual Symposium on Principles of Programming Languages, pages 245--254. ACM, January 1985.
Context Doc 4 (0): Eugene E. Kohlbecker, Daniel P. Friedman, Matthias Felleisen, and Bruce Duba. Hygienic macro expansion. Symposium on LISP and Functional Programming, pages 151--161, August 1986.
Context Doc 4 (1): Daniel P. Friedman and Mitchell Wand. Reification: Reflection without Metaphysics. In Proceedings of 1984 ACM Symposium on Lisp and Functional Programming, pages 348--355, 1984.
Context Doc 4 (0): Matthias Felleisen and Daniel P. Friedman. A Little Java, A Few Patterns. MIT Press, 1998.
Context Doc 3 (0): Matthias Felleisen and Daniel P. Friedman, \A Syntactic Theory of Sequential State", Theoretical Computer Science 69 no. 3 (18 December 1989), pp. 243-287.
Context Doc 3 (1): Jr. Jonathan G. Rossie and Daniel P. Friedman. An algebraic semantics of subobjects. In Tenth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '95, page 187, Austin, Texas, Oct. 1995.
Context Doc 3 (1): Daniel P. Friedman and Matthias Felleisen. The Little LISPer. Science Research Associates, second edition 1986. Bibliography 39
Context Doc 3 (0): Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, and Bruce F. Duba: Abstract Continuations: A Mathematical Semantics for Handling Full Functional Jumps. In Proceedings of the 1988 ACM Conference on Lisp and Functional Programming, Snowbird, Utah (July 1988).
Context Doc 3 (0): Matthias Felleisen and Daniel P Friedman. The Little MLer. MIT Press, 1998.
Context Doc 3 (2): Steven E. Ganz, Daniel P. Friedman, and Mitchell Wand. Trampolined style. In Peter Lee, editor, Proceedings of the 1999.
Context Doc 3 (0): Daniel P. Friedman and David S. Wise. Functional combination. Computer Languages, 3(1):31-35, 1978.
Context Doc 3 (0): Friedman, Daniel P., Haynes, Christopher T., and Wand, Mitchell. Obtaining coroutines with continuations. Computer Languages, 11, 3/4 (1986) 143--153.
Context Doc 3 (1): Matthias Felleisen and Daniel P. Friedman. A calculus for assignments in higher-order languages. In Thirteenth ACM Symposium on Principles of Programming Languages, January 1987.
Context Doc 3 (0): Robert E. Filman and Daniel P. Friedman. Aspect-oriented programming is quantification and obliviousness. In Workshop on Advanced Separation of Concerns, OOPSLA, October 2000.
Context Doc 3 (0): Matthias Felleisen and Daniel P. Friedman. The Seasoned Schemer. MIT Press, 1996.
Context Doc 3 (0): David S. Wise and Daniel P. Friedman. The one-bit reference count. BIT, 17(3):351--359, September 1977.
Context Doc 3 (0): Daniel P. Friedman and David S. Wise. Aspects of applicative programming for parallel processing. IEEE Transactions on Computers, 27(4):289--296, April 1978.
Context Doc 2 (0): Daniel P. Friedman, Christopher T. Haynes, Eugene Kohlbecker: Programming with Continuations, NATO ASI Series, Vol. F8, Program Transformation and Programming Environments pp 263-274, P. Pepper (ed.), Springer-Verlag Berlin Heidelberg (1984)
First 50 documents Next 50
The numbers before each article are the number of citations (excluding self-citations), and the predicted number of self-citations. 522 citations were found, of which 67 were predicted to be self-citations. Self-citations are not included in the graph.
Try your query at: Google (CiteSeer) Google (Web) Yahoo! MSN CSB DBLP
CiteSeer.IST - Copyright Penn State and NEC