Symbol manipulation by threaded lists

@article{Perlis1960SymbolMB,
  title={Symbol manipulation by threaded lists},
  author={Alan J. Perlis and Charles Thornton},
  journal={Communications of the ACM},
  year={1960},
  volume={3},
  pages={195 - 204}
}
Lisp is that the extraction of subexpressions is a fairly involved, rather than an elementary, operation. It is not !lard to write, in linear LrsP, functions that correspond to.he basic functions of LISP, so that, mathematically, inear Lisp includes LISP. This turns out to be the most:onvenient way of programming, in linear Lrsp, the moreomplicated manipulations. However, if the functionsre to be represented by computer routines, Lisp is essen­:ally faster. 
The use of threaded lists in constructing a combined ALGOL and machine-like assembly processor
As the emphasis of this paper indicates, the MADCAP project is striving to make the computer a convenient working tool of the typicM research scientist. Of primary importance to this end is, ofExpand
Symmetric list processor
A list processing system in which each list cell contains both a forward and a backward link as well as a datum is described. This system is intended for imbedding in higher level languages capableExpand
A generalized technique for symbol manipulation and numerical calculation
TLDR
An unusual use of index registers is described which provides a computer technique that appears to include all known symbol manipulation techniques as simple subcases and is ideally suited to both symbolic and numerical operations. Expand
Computer Languages for Symbol Manipulation
TLDR
These particular list-processing languages have been used to write game-playing, problem-solving, and other ``intelligent'' programs. Expand
Computer Languages for Symbol Manipulation
  • B. Green
  • Computer Science
  • IRE Trans. Electron. Comput.
  • 1961
TLDR
These particular languages have been used to write game-playing, problem-solving, and other ``intelligent'' Programs. Expand
Developing algebraic specifications of threaded data structure implementations
  • A. Laut
  • Computer Science
  • Werkzeuge der Programmiertechnik
  • 1981
TLDR
An algebraic specification of a data structure with “construction history” evolves, which may be viewed as a formal description of an implementation using pointers. Expand
A Machine Organization for a General Purpose List Processor
A general purpose list processor organized machine is postulated that: 1) carries out directly the basic processes involved in list processing, 2) includes arithmetic and other features needed for aExpand
An Abstract Machine for Symbolic Computation
The design of an abstract machine with a recursive function programming language which avoids the predicate type of conditional is described. It is shown that trough the adoption of list processingExpand
One-bit counts between unique and sticky
TLDR
Stoye's one-bit reference tagging scheme can be extended to local counts of two or more via two strategies, motivated by runtime stacks that duplicate references and one that avoids counting any references from the stack. Expand
Symbol Manipulation Languages
TLDR
It appears likely that symbol manipulation languages will stabilize as their use becomes more widespread, in much the same way as scientific and commercial languages have stabilized. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 31 REFERENCES
Recursive functions of symbolic expressions and their computation by machine, Part I
A programming system called LISP (for LISt 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 withExpand
General recursive functions
where the symbol on the right denotes the smallest y such that A (X, y) = 0, under the assumption that there is such a y for each g. Kleene showed that this definition of general recursive functionExpand
Primitive recursive functions
1. Definition of recursive functions. In this paper, we shall consider certain reductions in the recursion scheme for defining primitive recursive functions. Hereafter, we shall refer to suchExpand
A command structure for complex information processing
The general purpose digital computer, by virtue of its large capacity and general-purpose nature, has opened the possibility of research, into the nature of complex mechanisms per se. The challengeExpand
A command structure for complex irifof t ~ marion processing
  • Proceedings of the I958 We.stcr~l ,Io~,~ { f Computer Conference
  • 1958
General reeursive functions, proc. A,~er
  • Math. Soc
  • 1950
Primitive recur!!ive funct ions
  • Bull. Amer. 1 llath. Soc
  • 1950
Primitive recursive fu
  • netions. Btd[. A~ezer Math. Soc
  • 1950
Primitive recursive fu . netions
  • Btd [ . A ~ ezer Math . Soc .
  • 1950
)) I Zt -~("+
    ...
    1
    2
    3
    4
    ...