Abstract
In 1975 I started a small project to explore the consequences of implementing equational programs with no semantic compromises. Latest results include a compiler that executes exactly the logical consequences of an equational program, with run-time speed comparable to compiled Franz LISP. This paper describes the accomplishments of the project very briefly, concentrating on shortcomings and directions for future work.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
O. P. Buneman and R. E. Frankel. FQL — a functional query language. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 52–57, SIGMOD, May–June 1979.
R. M. Burstall and J. A. Goguen. The semantics of Clear, a specification language. In Proceedings of the 1979 Copenhagen Winter School on Abstract Software Specification, pages 292–332, 1980.
N. D. Belnap and T. B. Steel. The Logic of Questions and Answers. Yale University Press, 1976.
L. P. Chew. An improved algorithm for computing with equations. In 21st Annual Symposium on Foundations of Computer Science, pages 108–117, IEEE, 1980.
L. P. Chew. Unique normal forms in term rewriting systems with repeated variables. In 13th Annual ACM Symposium on Theory of Computing, pages 7–18, 1981.
V. J. Digricoli and M. C. Harrison. Equality-based binary resolution. Journal of the ACM, 33(2):253–289, 1986.
P. J. Downey, R. Sethi, and R. E. Tarjan. Variations on the common subexpression problem. Journal of the ACM, 27(4):758–771, 1980.
K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In 12th Annual Symposium on Principles of Programming Languages, pages 52–66, SIGPLAN and SIGACT, 1985.
D. Friedman and D. Wise. Cons should not evaluate its arguments. In 3rd International Colloquium on Automata, Languages and Programming, pages 257–284, Edinburgh Unversity Press, 1976.
G. Huet and J.-J. Lévy. Computations in Non-ambiguous Linear Term Rewriting Systems. Technical Report 359, IRIA, 1979.
P. Henderson and J. H. Morris. A lazy evaluator. In 3rd Annual Symposium on Principles of Programming Languages, pages 95–103, SIGPLAN and SIGACT, 1976.
C. M. Hoffmann and M. J. O'Donnell. Interpreter generation using tree pattern matching. In 6th Annual Symposium on Principles of Programming Languages, pages 169–179, SIGPLAN and SIGACT, 1979.
G. Huet and D. Oppen. Equations and rewrite rules: a survey. In R. Book, editor, Formal Languages: Perspectives and Open Problems, Academic Press, 1980.
C. M. Hoffmann, M. J. O'Donnell, and R. I. Strandh. Implementation of an interpreter for abstract equations. Software — Practice and Experience, 15(12):1185–1203, 1985.
B. Jayaraman. Equational Programming: A Unifying Approach to Functional and Logic Programming. Technical Report 85-030, The University of North Carolina, 1985.
D. E. Knuth and P. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 127–146, Pergammon Press, Oxford, 1970.
J. W. Klop. Combinatory Reduction Systems. PhD thesis, Mathematisch Centrum, Amsterdam, 1980.
D. Kozen. Complexity of finitely presented algebras. In 9th Annual ACM Symposium on Theory of Computing, pages 164–177, 1977.
G. Nelson and D. C. Oppen. Fast decision algorithms based on congruence closure. Journal of the ACM, 27(2):356–364, 1980.
M. J. O'Donnell. Computing in Systems Described by Equations. Volume 58 of Lecture Notes in Computer Science, Springer-Verlag, 1977.
M. J. O'Donnell. Equational Logic as a Programming Language. MIT Press, Cambridge, MA, 1985.
M. J. O'Donnell. Survey of the equational logic programming project. In Colloquium on Resolution of Equations in Algebraic Structures, 1987.
R. I. Strandh. Incremental Suffix Trees with Multiple Subject Strings. Technical Report JHU/EECS-84/18, The Johns-Hopkins University, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
O'Donnell, M.J. (1987). Term-rewriting implementation of equational logic programming. In: Lescanne, P. (eds) Rewriting Techniques and Applications. RTA 1987. Lecture Notes in Computer Science, vol 256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17220-3_1
Download citation
DOI: https://doi.org/10.1007/3-540-17220-3_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17220-8
Online ISBN: 978-3-540-47421-0
eBook Packages: Springer Book Archive