Home
Contact Information
Publications
Researchers
Focus Areas
FoxNet
Typed Intermediate Languages
Proof-Carrying Code
Logical Frameworks
Staged Computation
Language Design
 
Fox_Project@cs.cmu.edu
http://www.cs.cmu.edu/~fox/
  

The Fox Project
Miscellaneous Publications

This is a bibliography of research papers and reports from the Fox project at Carnegie Mellon University. These publications did not seem to fit smoothly into any of the more focused bibliographies. The BibTeX source is available. Papers with known URLs in the World-Wide Web have been annotated with their location and can be previewed or retrieved directly. Corrections, additions, and new URLs for papers and implementations are welcome.

Last updated: Fri May 4 2001

  1. Guy E. Blelloch and Perry Cheng. On bounding time and space for multiprocessor garbage collection. In Proceedings of the Conference on Programming Language Design and Implementation, pages 104-117, Atlanta, Georgia, May 1999. ACM Press. Available electronically (Abstract, Postscript, PDF).

  2. Gerth Stølting Brodal and Chris Okasaki. Optimal purely functional priority queues. Journal of Funtional Programming, 6(6):839-857, November 1996. Available electronically.

  3. Christopher Colby. Semantics-based Program Analysis via Symbolic Composition of Transfer Relations. PhD thesis, School of Computer Science, Carnegie Mellon University, August 1996. Available as Technical Report CMU-CS-96-162. Available electronically (Abstract, Postscript).

  4. Christopher Colby and Peter Lee. Trace-based program analysis. Technical Report CMU-CS-95-179, School of Computer Science, Carnegie Mellon University, July 1995. Available electronically (Abstract, Postscript).

  5. Christopher Colby and Peter Lee. Trace-based program analysis. In Proceedings of the Symposium on Principles of Programming Languages, pages 195-207, St. Petersburg Beach, Florida, January 1996. ACM Press. Available electronically.

  6. Eric Cooper, Robert Harper, and Peter Lee. The {Fox} project: Advanced development of systems software. Technical Report CMU-CS-91-178, School of Computer Science, Carnegie Mellon University, August 1991. Available electronically (Abstract, Postscript).

  7. Amer Diwan, David Tarditi, and Eliot Moss. Memory subsystem performance of programs using copying garbage collection. Technical Report CMU-CS-93-210, School of Computer Science, Carnegie Mellon University, December 1993. Available electronically.

  8. Amer Diwan, David Tarditi, and Eliot Moss. Memory subsystem performance of programs with intensive heap allocation. Technical Report CMU-CS-93-227, School of Computer Science, Carnegie Mellon University, December 1993. Available electronically.

  9. Amer Diwan, David Tarditi, and Eliot Moss. Memory subsystem performance of programs using copying garbage collection. In Proceedings of the Symposium on Principles of Programming Languages, pages 1-14, Portland, Oregon, January 1994. ACM Press. Available electronically.

  10. Amer Diwan, David Tarditi, and Eliot Moss. Memory-system performance of programs with intensive heap allocation. ACM Transactions on Computer Systems, 13(3):244-273, August 1995. Available electronically.

  11. Andrzej Filinski. Controlling Effects. PhD thesis, School of Computer Science, Carnegie Mellon University, May 1996. Available as Technical Report CMU-CS-96-119. Available electronically.

  12. John Greiner. {Standard ML} weak polymorphism can be sound. Technical Report CMU-CS-93-160R, School of Computer Science, Carnegie Mellon University, September 1993. Available electronically (Abstract, Postscript).

  13. John Greiner. {Standard ML} weak polymorphism can be sound. Technical Report CMU-CS-93-160, School of Computer Science, Carnegie Mellon University, May 1993. Available electronically.

  14. John Greiner. Semantics-based Parallel Cost Models and their Use in Provably Efficient Implementations. PhD thesis, School of Computer Science, Carnegie Mellon University, April 1997. Available as Technical Report CMU-CS-97-113. Available electronically.

  15. Joseph Y. Halpern, Robert Harper, Neil Immerman, Phokion G. Kolaitis, Moshe Y. Vardi, and Victor Vianu. On the unusual effectiveness of logic in computer science. Submitted for publication to the Bulletin of Symbolic Logic. Available electronically (Postscript, PDF).

  16. Robert Harper. Functional pearl: Proof-directed debugging. Journal of Functional Programming, 9(4):463-469, July 1999. Available electronically (Abstract, DVI, Postscript).

  17. Robert Harper and Peter Lee. Advanced languages for systems software: The {Fox} project in 1994. Technical Report CMU-CS-94-104, School of Computer Science, Carnegie Mellon University, January 1994. Available electronically (Abstract, Postscript).

  18. Robert Harper, Peter Lee, and Frank Pfenning. The {Fox} project: Advanced language technology for extensible systems. Technical Report CMU-CS-98-107, School of Computer Science, Carnegie Mellon University, January 1998. Available electronically (Abstract, Postscript).

  19. Nevin Heintze. Practical aspects of set-based analysis. In Krzysztof R. Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 765-779, Washington, DC, November 1992. MIT Press. Available electronically.

  20. Nevin Heintze. Set Based Program Analysis. PhD thesis, School of Computer Science, Carnegie Mellon University, 1992. Available as Technical Report CMU-CS-92-201. Available electronically.

  21. Nevin Heintze. Set based analysis of arithmetic. Technical Report CMU-CS-93-221, School of Computer Science, Carnegie Mellon University, December 1993. Available electronically.

  22. Nevin Heintze. Set based analysis of {ML} programs (extended abstract). Technical Report CMU-CS-93-193, School of Computer Science, Carnegie Mellon University, July 1993. Available electronically.

  23. Nevin Heintze. Control-flow analysis and type systems. Technical Report CMU-CS-94-227, School of Computer Science, Carnegie Mellon University, December 1994. Available electronically.

  24. Nevin Heintze. Set-based analysis of {ML} programs (extended abstract). In Proceedings of the {ACM} Conference on {LISP} and Functional Programming, pages 306-317, Orlando, Florida, June 1994. ACM Press. Available electronically.

  25. Haim Kaplan, Chris Okasaki, and Robert E. Tarjan. Simple confluently persistent catenable lists (extended abstract). In Proceedings of the Scandinavian Workshop on Algorithm Theory, pages 119-130, Stockholm, Sweden, July 1998. Springer-Verlag LNCS 1432. Available electronically.

  26. Philip J. {Koopman, Jr.}, Peter Lee, and Daniel P. Siewiorek. Cache behavior of combinator graph reduction. Transactions on Programming Languages and Systems, 14(2):265-297, April 1992. Available electronically.

  27. Mark Lillibridge. Exceptions are strictly more powerful than call/{CC}. Technical Report CMU-CS-95-178, School of Computer Science, Carnegie Mellon University, July 1995. Available electronically.

  28. Spiro Michaylov. Design and Implementation of Practical Constraint Logic Programming Systems. PhD thesis, School of Computer Science, Carnegie Mellon University, May 1992. Available as Technical Report CMU-CS-92-168.

  29. Greg Morrisett and Maurice Herlihy. Optimistic parallelization. Technical Report CMU-CS-93-171, School of Computer Science, Carnegie Mellon University, October 1993. Available electronically.

  30. J. Gregory Morrisett. Refining first-class stores. In Paul Hudak, editor, Proceedings of the {ACM} {SIGPLAN} Workshop on State in Programming Languages, pages 73-87, Copenhagen, Denmark, June 1993. Proceedings published as Yale Technical Report YALE/DCS/tr968. Available electronically (Abstract, Postscript).

  31. J. Gregory Morrisett and Andrew Tolmach. A portable multiprocessor interface for {S}tandard {ML} of {N}ew {J}ersey. Technical Report CMU-CS-92-155, School of Computer Science, Carnegie Mellon University, June 1992. Available electronically (Abstract, Postscript).

  32. J. Gregory Morrisett and Andrew Tolmach. Procs and locks: {A} portable multiprocessing interface for {S}tandard {ML} of {N}ew {J}ersey. In Proceedings of the Symposium on Principles and Practice of Parallel Programming, pages 198-207, San Diego, California, May 1993. ACM Press. Available electronically (Abstract, Postscript).

  33. Scott Nettles and James O'Toole. Real-time replication garbage collection. In Proceedings of the Conference on Programming Language Design and Implementation, pages 217-226, Albuquerque, New Mexico, June 1993. ACM Press. Available electronically.

  34. Scott Nettles, James O'Toole, and David Gifford. Concurrent garbage collection of persistent heaps. Technical Report CMU-CS-93-137, School of Computer Science, Carnegie Mellon University, April 1993. Available electronically.

  35. Scott Nettles, James O'Toole, David Pierce, and Nicholas Haines. Replication-based incremental copying collection. Technical Report CMU-CS-93-135, School of Computer Science, Carnegie Mellon University, April 1993. Available electronically.

  36. Scott M. Nettles, James W. O'Toole, David Pierce, and Nicholas Haines. Replication-based incremental copying collection. In J. Cohen and Y. Bekkers, editors, Proceedings of the International Workshop on Memory Management, pages 357-364, St. Malo, France, September 1992. Springer-Verlag LNCS 637.

  37. Chris Okasaki. Amortization, lazy evaluation, and persistence: Lists with catenation via lazy linking. In Proceedings of the Symposium on Foundations of Computer Science, pages 646-654, Milwaukee, Wisconsin, October 1995. IEEE. Available electronically (DVI, Postscript).

  38. Chris Okasaki. Purely functional random-access lists. In Proceedings of the International Conference on Functional Programming Languages and Computer Architecture, pages 86-95, La Jolla, California, June 1995. ACM Press. Available electronically (DVI, Postscript).

  39. Chris Okasaki. Simple and efficient purely functional queues and deques. Journal of Functional Programming, 5(4):583-592, October 1995. Available electronically (DVI, Postscript).

  40. Chris Okasaki. Functional data structures. In Proceedings of the International Summer School on Advanced Functional Programming Techniques, pages 131-158. Springer-Verlag LNCS 1129, August 1996. Available electronically (DVI, Postscript).

  41. Chris Okasaki. Purely Functional Data Structures. PhD thesis, School of Computer Science, Carnegie Mellon University, September 1996. Available as Technical Report CMU-CS-96-177. Available electronically.

  42. Chris Okasaki. The role of lazy evaluation in amortized data structures. In Proceedings of the International Conference on Functional Programming, pages 62-72, Philadelphia, Pennsylvania, May 1996. ACM Press. Available electronically (DVI, Postscript).

  43. Chris Okasaki. Catenable double-ended queues. In Proceedings of the International Conference on Functional Programming, pages 66-74, Amsterdam, the Netherlands, June 1997. ACM Press. Available electronically (DVI, Postscript).

  44. Chris Okasaki. Three algorithms on braun trees. Journal of Functional Programming, 7(6):661-666, November 1997. Available electronically (DVI, Postscript).

  45. Chris Okasaki. Even higher-order functions for parsing or why would anyone ever want to use a sixth-order function? Journal of Functional Programming, 8(2):195-199, March 1998. Available electronically (DVI, Postscript).

  46. Chris Okasaki, Peter Lee, and David Tarditi. Call-by-need and continuation-passing style. Lisp and Symbolic Computationj, 7(1):57-82, January 1994. Available electronically (Abstract, DVI, Postscript).

  47. James O'Toole, Scott Nettles, and David Gifford. Concurrent compacting garbage collection of a persistent heap. In Proceedings of the {ACM} Symposium on Operating Systems Principles, pages 161-174, Asheville, North Carolina, December 1993.

  48. David Tarditi and Amer Diwan. The full cost of a generational copying garbage collection implementation. In Eliot Moss, Paul Wilson, and Ben Zorn, editors, Informal Proceedings of the {OOPSLA} Workshop on Memory Management and Garbage Collection, Washington, USA, September 1993. Available electronically.

  49. David Tarditi and Amer Diwan. Measuring the cost of storage management. Technical Report CMU-CS-94-201, School of Computer Science, Carnegie Mellon University, May 1995. Available electronically (Abstract, Postscript).

  50. David Tarditi and Amer Diwan. Measuring the cost of storage management. Lisp and Symbolic Computation, 9(4):323-342, December 1996. Available electronically.

  51. David Tarditi, Peter Lee, and Anurag Acharya. No assembly required: Compiling {ML} to {C}. {ACM} Letters on Programming Languages and Systems, 1(2):161-177, June 1992. Available electronically (Abstract, Postscript).

[ Home | Contact Information | Publications | Researchers ]
[ FoxNet | Typed Intermediate Languages | Proof-Carrying Code ]
[ Logical Frameworks | Staged Computation | Language Design ]

Fox_Project@cs.cmu.edu
http://www.cs.cmu.edu/~fox/