bibliography george



  1. George Lal, MLRISC Customizable and Reusable Code Generators, Bell Labs, Dec 1996, (submitted to PLDI) .
  2. George Lal and Appel Andrew W., Iterated Register Coalescing, ACM transacations on programming languages and systems., Vol. 18, 3, pp. 300-324, May 1996, (also in POPL 96) .
  3. Ball Thomas J. and Coplien James O. and George Lal and Godefroid Patrice and Heintze Nevin C. and Jagadeesan Lalita and Jagadeesan Radhakrishnan and Riecke Jon G., Temporal Interfaces for Module Composition in Telecommunications Software, BL011277-960925-09TM, Bell Labs, September 1996.
  4. George Lal and Necula George, Accounting for the performance of S tandard ML on the DEC A lpha, BL0112610-940912-29, AT&T Bell Labs., Sept. 1994, Technical Report.
  5. George Lal and Guillame Florent and Reppy John H., A portable and optimizing back end for the SML NJ compiler, Compiler Construction, Ed. Fritzson Peter A., 786, pp. 83-97, Springer-Verlag, LNCS, 1994.
  6. George Lal and Guillame Florent and Reppy John H., A portable and optimizing back end for the SML NJ compiler, BL112610-931103-38TM, AT&T Bell Laboratories, November 1993.
  7. Guillaume Florent and George Lal, ML-B urg Documentation, 1.0, AT&T Bell Laboratories, 600 Mountain Ave Murray Hill NJ 07974, 1993.
  8. Lal George and Gary Lindstrom, Using a Functional Language and Graph Reduction to Program Multiprocessor Machines Or Functional Control of Imperative Programs, Sixth International Parallel Processing Symposium, pp. 370-373, IEEE Computer Society, Beverly Hills CA, April 1992, (Funding ack ASC-9016131 and CCR-8920971) .
  9. George L., An Abstract Machine for Parallel Graph Reduction, Proc. Symposium on Functional Languages and Computer Architecture, Ed. David MacQueen, pp. 214-229, Springer-Verlag, London, September 11-13 1989.
  10. George L., A Scheduling Strategy for Nonuniform Access Shared Memory Multiprocessors, Proc. of the 1990 International Conference on Parallel Processing, IEEE Computer Society, August 1990.
  11. Lindstrom G. and L. George and D. Yeh, Generating Efficient Code from Strictness Annotations, TAPSOFT 87: Proc. Second International Joint Conference on Theory and Practice of Software Development, pp. 140-154, Pisa Italy, March 1987, (DCR-8506000) .

Go to the Computing Sciences Research Center home page.
Modified: October 17, 1997.
Copyright © 1997 Lucent Technologies. All rights reserved.