Convert "The dream of a lifetime"

It was published as a MIT technical report, and also as an ACM paper.
The two SHA sums refer to these two versions. They seem equivalent.
The bibliography entry kept is the ACM one.

page8.md

@@ -2,8 +2,6 @@
 
 ### Basic Techniques
 
-  * Guy Lewis Steele, Jr. and Gerald Jay Sussman. "The Dream of a Lifetime: a Lazy Variable Extent Mechanism". _Conference Record of the 1980 Lisp Conference_. 1980. Available online: [ACM Digital Library](http://portal.acm.org/citation.cfm?id=802802&coll=portal&dl=ACM).
-  * Guy Lewis Steele, Jr. and Gerald Jay Sussman. "The Dream of a Lifetime: a Lazy Variable Extent Mechanism". 1979. Available online: [ps](https://raw.githubusercontent.com/scheme-live/library.readscheme.org/master/repository.readscheme.org/ftp/papers/ai-lab-pubs/AIM-527.ps.gz) [pdf](https://raw.githubusercontent.com/scheme-live/library.readscheme.org/master/repository.readscheme.org/ftp/papers/ai-lab-pubs/AIM-527.pdf).
   * Drew McDermott. "An Efficient Environment Allocation Scheme in an Interpreter for a Lexically-Scoped Lisp". _Conference Record of the 1980 Lisp Conference_. 1980. Available online: [ACM Digital Library](http://portal.acm.org/citation.cfm?id=802801&coll=portal&dl=ACM).
   * Steven R. Vegdahl and Uwe F. Pleban. "The Runtime Environment for Screme, a Scheme Implementation on the 88000". _Proceedings of the Third International Conference on Architectural Support for Programming Languages and Operating Systems_. April 1989. Available online: [ACM Digital Library](http://portal.acm.org/citation.cfm?id=68199&coll=portal&dl=ACM).
   * Barak A. Pearlmutter and Kevin J. Lang. "The Implementation of Oaklisp". _Topics in Advanced Language Implementation_. 1991.

page8.scm

@@ -378,6 +378,18 @@
 (book "Artificial Intelligence: An MIT Perspective")
 (publisher "MIT Press")
 
+(id steele1980dream)
+(type inproceedings)
+(title "The dream of a lifetime: A lazy variable extent mechanism")
+(author "Steele Jr, Guy Lewis")
+(author "Sussman, Gerald Jay")
+(booktitle "Proceedings of the 1980 ACM conference on LISP and functional programming")
+(pages "163--172")
+(year 1980)
+(pdf-sha1 "31de1ed42e183a99d6645e316cfb0cd716364f0b")
+(pdf-sha1 "3cb34b298d5aba1f5fd07a6a4adbc9b024ffa0a3")
+(abstract "We define a \"rack\", a data abstraction hybrid of a register and a stack. It is used for encapsulating the behavior of the kind of register whose contents may have an extent which requires that it be saved during the execution of an unknown piece of code. A rack can be implemented cleverly to achieve performance benefits over the usual implementation of a stack discipline. The basic idea is that we interpose a state machine controller between the rack abstraction and its stack/registers. This controller can act as an on-the-fly run-time peephole optimizer, eliding unnecessary stack operations." "We demonstrate the sorts of savings one might expect by using cleverly implemented racks in the context of a particular caller-saves implementation of an interpreter for the SCHEME dialect of LISP. For sample problems we can expect that only one out of every four pushes that would be done by a conventional machine will be done by the clever version.")
+
 (end-group)
 
 (end-group)