Add temporary content files.

These files will be automatically generated in the production version.

Author: stumbo

content/en/publications/1959-09-01_LISP_A_Programming_System_for.md

@@ -0,0 +1,8 @@
+---
+title: "_LISP_: A Programming System for Symbolic Manipulations"
+date: '1959-09-01'
+authors: 
+    - John McCarthy
+abstract: "LISP (for LISt Processor) is a programming system for the IBM 704 being developed by the Artificial Intelligence Group at MIT. We are developing it in order to program the Advice Taker which is to be a system for instructing a machine in a combination of declarative and imperative sentences."
+---
+

content/en/publications/1960-01-01_PDP-1_Lisp_.md

@@ -0,0 +1,8 @@
+---
+title: "_PDP-1 Lisp_"
+date: '1960-01-01'
+authors: 
+    - L. Peter Deutsch
+abstract: "A program has been written for the PDP-1 providing a subset of the features of the LISP interpreter for the IBM 709/7090. This program, which contains no known bugs, will run on any PDP-1 with automatic divide. On machines with more than 4K of memory, it must be run in memory field 0. It is assumed that the reader is familiar with 709 LISP in general and with the LISP 1.5 Programmer's Manual in particular."
+---
+

content/en/publications/1960-04-01_Recursive_Functions_of_Symbol.md

@@ -0,0 +1,8 @@
+---
+title: "Recursive Functions of Symbolic Expressions and Their Computation by Machine, _Part I_"
+date: '1960-04-01'
+authors: 
+    - John McCarthy
+abstract: "A programming system called LISP (for Lisp Processor) has been developed for the IBM 704 computer by the Artificial Intelligence group at M.I.T. The system was designed to facilitate experiments with a proposed system called the Advice Taker, whereby a machine could be instructed to handle declarative as well as imperative sentences and could exhibit, 'common sense'  in carrying out its instructions. The original proposal for the Advice Taker was made in November l958. The main requirement was a programming system for manipulating expressions representing formalized declarative and imperative sentences so that the Advice Taker system could make deductions."
+---
+

content/en/publications/1963-10-01_A_Heuristic_Program_That_Solv.md

@@ -0,0 +1,8 @@
+---
+title: "A _Heuristic Program_ That _Solves Symbolic Integration Problems_ in _Freshman Calculus_"
+date: '1963-10-01'
+authors: 
+    - James R. Slagle
+abstract: "A large high-speed general-purpose digital computer (IBM 7090) was programmed to solve elementary symbolic integration problems at approximately the level of a good college freshman. The program is called SAINT, an acronym for 'Symbolic Automatic INTegrator.' This paper discusses the SAINT program and its performance. SAINT performs indefinite integration. It also performs definite and multiple integration when these are trivial extensions of indefinite integration. It uses many of the methods and heuristics of students attacking the same prombles. SAINT took an average of two minutes each to solve 52 of the 54 attempted problems taken from the Massachusetts Institute of Technology freshman calculus final examinations. Based on this and other experiments with SAINT, some conclusions coneering computer solution of such problems are: (1) Pattern recognition is of fundamental importance. (2) Great benefit would have been derived from a large memory and more convenient symbol manipulating facilities. (3) The solution of a symbolic integration problem by a commercially available computer is far cheaper and faster than by man."
+---
+

content/en/publications/1965-06-05_930_LISP_Reference_Manual_.md

@@ -0,0 +1,9 @@
+---
+title: "930 _LISP Reference Manual_"
+date: '1965-06-05'
+authors: 
+    - L. Peter Deutsch
+    - Butler W. Lampson
+abstract: "(Abstract not available)"
+---
+

content/en/publications/1966-01-01_ELIZA_,_a_Computer_Program_fo.md

@@ -0,0 +1,8 @@
+---
+title: "_ELIZA_, a Computer Program for the Study of Natural Language Communication between Man and Machine"
+date: '1966-01-01'
+authors: 
+    - Joseph Weizenbaum
+abstract: "Eliza is a program operating within the MAC time-sharing system at MIT which makes certain kinds of natural language conversation between man and computer possible. Input sentences are analyzed on the basis of decomposition rules which are triggered by key words appearing in the input text. Responses are generated by reassembly rules associated with selected decomposition rules. The fundamental technical problems with which ELIZA is concerned are: (1) the identification of key words, (2) the discovery of minimal context, (3) the choice of appropriate transformations, (4) generation of reponses in the abscence of key words, and (5) the provision of an editing capability for ELIZA 'scripts'. A discussion of some pyschological issues relevant to the ELIZA approach as well as of future developments concludes the paper."
+---
+

content/en/publications/1966-01-01_Format-Directed_List_Processi.md

@@ -0,0 +1,9 @@
+---
+title: "Format-Directed List Processing in _LISP_"
+date: '1966-01-01'
+authors: 
+    - Daniel G. Bobrow
+    - Warren Teitelman
+abstract: "This article describes a notation and a programming language for expressing, from within a LISP system, string transformations such as those performed in COMIT or SNOBOL. A simple transformation (or transformation rule) is specified by providing a pattern which must match the structure to be transformed and a format which specifies how to construct a new structure according to the segmentation specified by the pattern. The patterns and formats are greatly generalized versions of the left-half and right-half rules of COMIT and SNOBOL. For example, elementary patterns and formats can be variable names, results of computations, disjunctive sets, or repeating subpatterns; predicates can be associated with elementary patterns which check relationships among separated elements of the match; it is no longer necessary to restrict the operations to linear strings since elementary patterns can themselves match structures. The FLIP language has been implemented in LISP 1.5, and has been successfully used in such disparate tasks as editing LISP functions and parsing Kleene regular expressions."
+---
+

content/en/publications/1966-01-01_The_Programming_Language_LISP.md

@@ -0,0 +1,9 @@
+---
+title: "The Programming Language _LISP_: _Its_ Operation and Applications"
+date: '1966-01-01'
+authors: 
+    - Edmund Callis Berkeley
+    - Daniel Gureasko Bobrow
+abstract: "Among the new languages for instructing computers is a remarkable one called LISP. The name cornes from the first three letters of LIST and the first letter of PROCESSING. Not only is LISP a language for instructing computers but it is also a formal mathematical language, in the same way as elëmentary algebra when rigorously defined and used is a formal mathematical language.  LISP is designed primarily for processing data consisting of lists of symbols. It has been used for symbolic calculations in differential and integral calculus, electrical circuit theory, mathematical logic, game playing, and other fields of intelligent handling of symbols.  The purpose of the present article is to make a bridge between the ideas and terms of ordinary English and elementary mathematics, and the ideas and terms known and used by LISP programmers."
+---
+

content/en/publications/1966-06-01_Storage_Management_in_LISP_.md

@@ -0,0 +1,8 @@
+---
+title: "Storage _Management_ in _LISP_"
+date: '1966-06-01'
+authors: 
+    - Daniel G. Bobrow
+abstract: "Storage allocation, maintenance, and reclamation are handled automatically in LISP systems.  Storage is allocated as needed, and a garbage collection process periodically reclaims storage no longer in use.  A number of different garbage collection algorithms are described.  A common property of most of these algorithms is that during garbage collection all other computation ceases.  This is an untenable situation for programs which must respond to real time interrupts.  The paper concludes with a proposal for an incremental garbage collection scheme which allows simultaneous computation and storage reclamation."
+---
+

content/en/publications/1966-09-01_PILOT_A_Step_Toward_Man-Compu.md

@@ -0,0 +1,8 @@
+---
+title: "_PILOT_: _A Step Toward Man-Computer Symbiosis_"
+date: '1966-09-01'
+authors: 
+    - Warren Teitelman
+abstract: "PILOT is a programming system constructed  in LISP. It is designed to facilitate the  development of programs by easing the  familiar sequence: write some code, run the  program, make some changes, write some  more code, run the program again, etc. As a  program becomes more complex, making  these changes becomes harder and harder  because the implications of changes are  harder to anticipate. In the PILOT system, the  computer plays an active role in this  evolutionary process by providing the means  whereby changes can be effected  immediately, and in ways that seem natural to  the user. The user of PILOT feels that he is  giving advice, or making suggestions, to the  computer about the operation of his  programs, and that the system then performs  the work necessary. The PILOT system is  thus an interface between the user and his  program, monitoring both in the requests of  the user and operation of his program. The  user may easily modify the PILOT system  itself by giving it advice about its own  operation. This allows him to develop his own  language and to shift gradually onto PILOT the  burden of performing routine but increasingly  complicated tasks. In this way, he can  concentrate on the conceptual difficulties in  the original problem, rather than on the  niggling tasks of editing, rewriting, or adding  to his programs. Two detailed examples are  presented. PILOT is a first step toward  computer systems that will help man to  formulate problems in the same way they now  help him to solve them. Experience with it  supports the claim that such 'symbiotic  systems' allow the programmer to attack and  solve more difficult problems."
+---
+