1. G. Bilardi and A. Nicolau. Adaptive bitonic sorting: An optimal parallel algorithm for shared-memory machines. SIAM Journal of Computing, 12(2):216–228, April 1989.
2. D. Bobrow and B. Wegbreit. A model and stack implementation of multiple environments. Communications of the ACM, 16(10):591–603, 1973.
3. D. Callahan and B. Smith. A future-based parallel language for a general-purpose highly-parallel computer. In Papers from the Second Workshop on Languages and Compilers for Parallel Computing, pages 95–113. University of Illinois at Urbana-Champaign, 1989.
4. M. Feeley, M. Turcotte, and G. Lapalme. Using Multilisp for solving constraint satisfaction problems: an application to nucleic acid 3D structure determination. Lisp and Symbolic Computation, 7(2/3):231–246, 1994.
5. M. Feeley. An Efficient and General Implementation of Futures on Large Scale Shared-Memory Multiprocessors. PhD thesis, Brandeis University Department of Computer Science, 1993. Available as publication #869 from département d'informatique et recherche opérationnelle de l'Université de Montréal.