The LISP70 pattern matching system
Lawrence G. Tester, Horace Enea, David Canfield Smith · International Joint Conference on Artificial Intelligence · 1973
LISP70 is a descendant of LISP which emphasizes pattern-directed computation and extensibility. A function can be defined by a set of pattern rewrite rules as well as by the normal LAMBDA method. New rewrite rules can be added to a previously defined function; thus a LISP70 function is said to be extensible. It is possible to have new rules merged in automatically such that special cases are checked before general cases. Some of the facilities of the rewrite system are described and a variety of applications are demonstrated.
Cited by 18 works.
Authors
References
- Recursive functions of symbolic expressions and their computation by machine, Part I
- ELIZA — a computer program for the study of natural language communication between man and machine
- The next 700 programming languages
- PLANNER: A Language for Manipulating Models and Proving Theorems in a Robot
- A model and stack implementation of multiple environments
- Procedural embedding of knowledge in planner
- Heuristic methods for computer understanding of natural language in context-restricted on-line dialogues
- Toward a programming laboratory
- Why Conniving is Better than Planning
- Programming in POP-2