Search
Now showing items 61-70 of 160
Recent Improvements in DDT
(1963-11-01)
This paper will report new developments and recent improvements to DDT. "Window DDT" now will remember undefined symbols and define them on a later command. Using sequence breaks, it can change the contents of memory while ...
Arithmetic in LISP 1.5
(1961-04-01)
As of the present, the following parts of LISP 1.5 are working. This is an excerpt from the forth coming LISP 1.5 Programmer's Manual.
LISP Error Stops as of May 10, 1961
(1961-05-01)
no abstract
A Proposal for a Geometry Theorem Proving Program
(1963-09-01)
During the last half of the nineteenth century the need for formal methods of proof became evident to mathematicians who were making such confidence-shaking discoveries as non-Euclidean geometry. The demand is not to be ...
Universality of TAG Systems with P-2
(1963-04-01)
In the following sections we show, by a simple direct construction, that computations done by Turing machines can be duplicated by a very simple symbol manipulation process. The process is described by a simple form of ...
Operation of a Semantic Question-Answering System
(1963-11-01)
A computer program has been written in the LISP programming language which accepts information and answers questions presented to it in a restricted form of natural English language. The program achieves its effects by ...
Proposal for a FAP Language Debugging Program
(1963-06-01)
A time-sharing system for the 7090 computer is being developed at the M.I.T. Computation Center whereby many users can communicate simultaneously with the computer through individual consoles. In the time-sharing ...
METEOR: A LISP Interpreter for String Transformations
(1963-04-01)
Conditional expressions, composition and recursion are the basic operations used in LISP to define functions on list structures. Any computable function of arbitrarily complex list structures may be described using these ...
MACRO Definitions for LISP
(1963-10-01)
In LISP 1.5 special forms are used for three logically separate purposes: a) to reach the alist, b) to allow functions to have an indefinite number of arguments, and c) to keep arguments from being evaluated. New LISP ...
String Manipulation in the New Language
(1964-07-01)
String manipulation can be made convenient within the *** language by implementing two functions: 1) match [workspace; pattern] and 2) construct {format;pmatch]. In this memo I describe how I think these two functions can ...