Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	2	L.O. Andersen. C program specialization. Master's thesis, DIKU, University of Copenhagen, Denmark, December 1991. DIKU Student Project 91-12-17, 134 pages.
	3	Lars Ole Andersen, Partial Evaluation of C and Automatic Compiler Generation (Extended Abstract), Proceedings of the 4th International Conference on Compiler Construction, p.251-257, October 05-07, 1992
	4	L.O. Andersen. Partial Evaluatzon of C, chapter 11 in Partial Evaluation and Automatic Compiler Generation, N.D. Jones, C.K. Gomard, P. Sestoft. Prentice- Hall, 1993. (To appear).
	5	A. Bondorf, Automatic autoprojection of higher order recursive equations, Proceedings of the third European symposium on programming on ESOP '90, p.70-87, May 1990, Copenhagen, Denmark
	6	A. Bondorf and J. Jorgensen. Efficient analyses for realistic off-line partial evaluation. Journal of Functional Programming, special issue on partial evaluation, 1993.
	7	Charles Consel, Binding time analysis for high order untyped functional languages, Proceedings of the 1990 ACM conference on LISP and functional programming, p.264-272, June 27-29, 1990, Nice, France  [doi>10.1145/91556.91668]
	8	Carsten K. Gomard, Partial type inference for untyped functional programs, Proceedings of the 1990 ACM conference on LISP and functional programming, p.282-287, June 27-29, 1990, Nice, France  [doi>10.1145/91556.91672]
	9	C.K. Gomard and N.D. Jones. A partial evaluator for the untyped lambda-calculus. Journal of Functional Programming, 1(1):21-69, January 1991.
	10	Fritz Henglein, Efficient type inference for higher-order binding-time analysis, Proceedings of the 5th ACM conference on Functional programming languages and computer architecture, p.448-472, June 1991, Cambridge, Massachusetts, United States
	11	Sebastian Hunt , David Sands, Binding time analysis: a new PERspective, ACM SIGPLAN Notices, v.26 n.9, p.154-165, Sept. 1991
	12	ISO/IEC 9899:1990 International Standard. Programming Languages--C, 1990.
	13	N.D. Jones, P. Sestoft, and H. Sendergaard. Mix: A self-applicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation, 2(1):9-50, 1989.
	14	Brian W. Kernighan , Dennis M. Ritchie, The C programming language, Prentice Hall Press, Upper Saddle River, NJ, 1989
	15	J. Launchbury. Projection Factorisat~ons ~n Partial Evaluation. PhD thesis, Dep. of Computing Science, University of Glasgow, Glasgow G12 8QQ, 1990.
	16	T.iE. Mogensen. Binding Time Aspects of Partial Evaluation. PhD thesis, Dept. of Comp. Science, University of Copenhagen, Mar 1989.
	17	H. R. Nielson , F. Nielson, Automatic binding time analysis for a typed &lgr;-calculus, Science of Computer Programming, v.10 n.2, p.139-176, April 1988  [doi>10.1016/0167-6423(88)90025-1]
	18	Robert Endre Tarjan, Data structures and network algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983

• Data structures for quadtree approximation and compression Communications of the ACM   28, 9
  Hanan Samet
  
  
• A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
  Kim S. Lee ,  Huizhu Lu ,  D. D. Fisher
  
  
• The GemStone object database management system Communications of the ACM   34, 10
  Paul Butterworth ,  Allen Otis ,  Jacob Stein
  
  
• Putting innovation to work: adoption strategies for multimedia communication systems Communications of the ACM   34, 12
  Ellen Francik ,  Susan Ehrlich Rudman ,  Donna Cooper ,  Stephen Levine
  
  
• An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE Design Automation Conference on
  Gwo-Dong Chen ,  Daniel D. Gajski