1. A. Asperti. δo!∈ = 1: Optimizing optimal λ-calculus implementations. In Rewriting Techniques and Applications, pages 102–116, Kaiserslautern, Germany, 1995.
2. Lect Notes Comput Sci;A. Asperti,1993
3. A. Bawden. Implementing distributed systems using linear naming. TR 1627, MIT AI Lab, March 1993. (PhD thesis, originally titled Linear Graph Reduction: Confronting the Cost of Naming. MIT, May 1992).
4. C. Bruggeman, O. Waddell, and R.K. Dybvig. Representing control in the presence of one-shot continuations. In Proceedings of the ACM SIGPLAN’96 Conference on Programming Language Design and Implementation, volume 31(5), pages 99–107, Philadephia, Pennsylvania, May 1996. SIGPLAN Notices.
5. O. Danvy. Back to direct style. Science of Computer Programming, 22(3):183–195, 1994.