Subtree replacement systems: A unifying theory for recursive equations, LISP, lucid and combinatory logic

Authors:
Mike O'Donnell
Affiliations:
-
Venue:
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Year:
1977

Citing 6
Cited 0

Tree-Manipulating Systems and Church-Rosser Theorems

Journal of the ACM (JACM)
Recursive functions of symbolic expressions and their computation by machine, Part I

Communications of the ACM
A lazy evaluator

POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Recursive definitions of partial functions and their computations

Recursive definitions of partial functions and their computations
Reduction strategies in subtree replacement systems.

Reduction strategies in subtree replacement systems.
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)

The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent work on computation of functions defined by sets of recursive equations by Cadiou [Ca72], Vuillemin [Vu74] and Downey and Sethi [DS76] depends on semantic interpretations of such equations. A purely syntactic, combinatory approach yields similar results for a much wider class of sets of equations, including sets of defining equations for LISP, Lucid and the combinator calculus. The application to LISP proves several conjectures of Henderson and Morris [HM76].