Now showing items 1-4 of 4

    • The Incremental Garbage Collection of Processes 

      Hewitt, Carl; Baker, Henry G. Jr. (MIT Artificial Intelligence Laboratory, 1977-06)
      This paper investigates some problems associated with an argument evaluation order that we call "future" order, which is different from both call-by-name and call-by-value. In call-by-future, each formal parameter of a ...
    • List Processing in Real Time on a Serial Computer 

      Baker, Henry G. Jr. (MIT Artificial Intelligence Laboratory, 1977-04-01)
      A real-time list processing system is one in which the time required by each elementary list operation (CONS, CAR, CDR, RPLACA, RPLACD, EQ, and ATOM in LISP) is bounded by a (small) constant. Classical list processing ...
    • A Note on the Optimal Allocation of Spaces in MACLISP 

      Baker, Henry G. Jr. (MIT Artificial Intelligence Laboratory, 1977-03-16)
      This note describes a method for allocating storage among the various spaces in the MACLISP Implementation of LISP. The optimal strategy which minimizes garbage collector effort allocates free storage among the various ...
    • Shallow Binding in LISP 1.5 

      Baker, Henry G. Jr. (MIT Artificial Intelligence Laboratory, 1977-01)
      Shallow binding is a scheme which allows the value of a variable to be accessed in a bounded amount of computation. An elegant model for shallow binding in LISP 1.5 is presented in which context-switching is an environment ...