Search
Now showing items 51-60 of 71
Actors and Continuous Functionals
(1977-07-01)
This paper presents precise versions of some "laws" that must be satisfied by computations involving communicating parallel processes. The laws take the form of stating plausible restrictions on the histories of ...
List Processing in Real Time on a Serial Computer
(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 ...
Shallow Binding in LISP 1.5
(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 ...
Laws for Communicating Parallel Processes
(MIT Artificial Intelligence Laboratory, 1977-05-10)
This paper presents some laws that must be satisfied by computations involving communicating parallel processes. The laws are stated in the context of the actor theory, a model for distributed parallel computation, and ...
A Note on the Optimal Allocation of Spaces in MACLISP
(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 ...
A Theory of Plans for Electronic Circuits
(MIT Artificial Intelligence Laboratory, 1977-04)
A plan for a device assigns purposes to each of the more primitive components and explains how these components interact to achieve the desired behavior of the composite device. Such an information structure is critically ...
Plan Recognition in a Programmer's Apprentice
(MIT Artificial Intelligence Laboratory, 1977-05)
Brief Statement of the Problem:
Stated most generally, the proposed research is concerned with understanding and representing the teleological structure of engineered devices. More specifically, I propose to study the ...
A History Keeping Debugging System for PLASMA
(MIT Artificial Intelligence Laboratory, 1977-05)
PLASMA (for PLAnner-like System Modeled on Actors) is a message-passing computer language based on actor semantics. Since every event in the system is the receipt of a message actor by a target actor, a complete history ...
Mapping Sentences to Case Frames
(MIT Artificial Intelligence Laboratory, 1977-03)
This paper describes a range of phenomena that a case frame system should be able to handle and proposes generalizations to capture this behavior which are formulated as a set of production-like rules. These rules allow ...
A Birthday Party Frame System
(MIT Artificial Intelligence Laboratory, 1977-02)
This paper is an experimental investigation of the utility of the MIT-AI frames system. Using this system, a birthday party planning system was written, representing the basic decisions that comprise such a plan as frames. ...