Programming with Equations

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Programming with Equations

Full text

Pdf (1.64 MB)

Source

ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 4 , Issue 1 (January 1982) table of contents

Pages: 83 - 112

Year of Publication: 1982

ISSN:0164-0925

Authors

Christoph M. Hoffmann	Department of Computer Sciences, Purdue University, West Lafayette, IN
Michael J. O'Donnell	Department of Computer Sciences, Purdue University, West Lafayette, IN

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 40, Citation Count: 23

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/357153.357158 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Alfred V. Aho , Jeffrey D. Ullman, The Theory of Parsing, Translation, and Compiling, Prentice Hall Professional Technical Reference, 1972
	2	E. A. Ashcroft , W. W. Wadge, Lucid, a nonprocedural language with iteration, Communications of the ACM, v.20 n.7, p.519-526, July 1977 [doi>10.1145/359636.359715]
	3	ASMCRO~r, E., AND WADGF., W. Lucid--A formal system for writing and proving programs. SIAM J. Comput. 5, 3 (1976), 336-354.
	4	John Backus, Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs, Communications of the ACM, v.21 n.8, p.613-641, Aug. 1978 [doi>10.1145/359576.359579]
	5	John Backus, Programming language semantics and closed applicative languages, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.71-86, October 01-03, 1973, Boston, Massachusetts [doi>10.1145/512927.512934]
	6	Friedrich L. Bauer , Manfred Broy , Rupert Gnatz , Wolfgang Hesse , Bernd Krieg-Brückner , Helmuth Partsch , Peter Pepper , Hans Wössner, Towards a Wide Spectrum Language to Support Program Specification and Program Development, Program Construction, International Summer Schoo, p.543-552, July 26-August 06, 1978
	7	Gérard Berry , Jean-Jacques Lévy, Minimal and optimal computations of recursive programs, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.215-226, January 17-19, 1977, Los Angeles, California [doi>10.1145/512950.512971]
	8	BJORNER, D. Finite state tree computations, pt. I. IBM Res. Tech. Rep. RJ 1053 (#17598), 1972.
	9	BRUYNOOGHE, M. An interpreter for predicate logic programs, pt. I. Rep. CW10, Applied Math. and Programming Div., Katholieke Univ., Leuven, Belgium, 1976.
	10	Jean-Marie Cadiou, Recursive definitions of partial functions and their computations, 1972
	11	CARGILL, T. Deterministic operational semantics for Lucid. Res. Rep. CS-76-19, Univ. Waterloo, Ontario, 1976.
	12	CHEW, L.P. An improved algorithm for computing with equations. In 21st Ann. IEEE Symp. Foundations of Computer Science, 1980, Syracuse, N.Y., pp. 108-117.
	13	DOWNEY, P., AND SETHI, R. Correct computation rules for recursive languages. SIAM J. Comput. 5, 3 (1976), 378-401.
	14	Mansour Farah, Correct compilation of a useful subset of lucid., 1977
	15	FRIEDMAN, D., AND WISE, D. Cons should not evaluate its arguments. In 3rd Int. Colloq. Automata, Languages and Programming. Edinburgh University Press, Edinburgh, Scotland, 1976, pp. 257-284.
	16	GOGUEN, J. Abstract errors for abstract data types. In IFIP Working Conference on Formal Description of Programming Concepts, E.J. Neuhold (Ed.). Elsevier North-Holland, New York, 1977, pp. 491-522.
	17	GUIBAS, L.,'AND SEDGEWICK, R. A dichromatic framework for balanced trees. In 19th IEEE Symp. Foundations of Computer Science, Ann Arbor, Mich., 1978, pp. 8-21.
	18	GUTTAG, J., HOROWITZ, E., AND MUSSER, D. Abstract data types and software validation. Information Science Res. Rep. ISI/RR-76-48, Univ. Southern Calif., Los Angeles, 1976.
	19	Peter Henderson , James H. Morris, Jr., A lazy evaluator, Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages, p.95-103, January 19-21, 1976, Atlanta, Georgia [doi>10.1145/800168.811543]
	20	HOFFMAN, C. Design and correctness of a compiler for a nonprocedural language. Acta Inf. 9, 3 (1978), 217-241.
	21	Christoph M. Hoffmann , Michael J. O'Donnell, Pattern Matching in Trees, Journal of the ACM (JACM), v.29 n.1, p.68-95, Jan. 1982 [doi>10.1145/322290.322295]
	22	Christoph M. Hoffmann , Michael J. O'Donnell, An interpreter generator using tree pattern matching, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.169-179, January 29-31, 1979, San Antonio, Texas [doi>10.1145/567752.567768]
	23	HUET, G., AND Li~vY, J.-J. Computations in nonambiguous linear term rewriting systems. IRIA Tech. Rep. 359, 1979.
	24	JOHNSON, S.D. An interpretive model for a language based on suspended construction. Tech. Rep. 68, Dep. Computer Science, Indiana Univ., Bloomington, Ind., 1977.
	25	KNUTH, D., AND BENDIX, P. Simple word problems in universal algebras. In Computational Problems in Abstract Algebra, J. Leech (Ed.). Pergamon Press, Elmsford, N.Y., pp. 263-297.
	26	Robert Kowalski, Algorithm = logic + control, Communications of the ACM, v.22 n.7, p.424-436, July 1979 [doi>10.1145/359131.359136]
	27	John McCarthy, Recursive functions of symbolic expressions and their computation by machine, Part I, Communications of the ACM, v.3 n.4, p.184-195, April 1960 [doi>10.1145/367177.367199]
	28	Greg Nelson , Derek C. Oppen, Fast Decision Procedures Based on Congruence Closure, Journal of the ACM (JACM), v.27 n.2, p.356-364, April 1980 [doi>10.1145/322186.322198]
	29	Greg Nelson , Derek C. Oppen, A simplifier based on efficient decision algorithms, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.141-150, January 23-25, 1978, Tucson, Arizona [doi>10.1145/512760.512775]
	30	Michael J. O'Donnell, Computing in Systems Described by Equations, Springer-Verlag New York, Inc., Secaucus, NJ, 1977
	31	ROBERTS, G. An Implementation of PROLOG. M.S. thesis, Dep. Computer Science, Univ. Waterloo, Ontario, 1977.
	32	Barry K. Rosen, Tree-Manipulating Systems and Church-Rosser Theorems, Journal of the ACM (JACM), v.20 n.1, p.160-187, Jan. 1973 [doi>10.1145/321738.321750]
	33	STAPLES, J. A class of replacement systems with simple optimality theory. Bull. Aust. Math. Soc. 17, 3 (1977), 335-350.
	34	VUXLL~.MXN, J. Correct and optimal implementations of recursion in a simple programming language. J. Comput. Syst. Sci. 9, 3 (1974), 332-354.
	35	WAND, M. First order identities as a defining language. Tech. Rep. 29, Dep. Computer Science, indiana Univ., Bloomington, Ind., 1976.
	36	WARREN, D. Implementing PROLOG. Res. Reps. 39, 40, Dep. Artificial Intelligence, Univ. Edinburgh, Scotland, 1977.

CITED BY 23

	R. C. Sekar , Shaunak Pawagi , I. V. Ramarkrishnan, Small domains spell fast strictness analysis, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.169-183, December 1989, San Francisco, California, United States
	Christoph M. Hoffmann , Michael J. O'Donnell, Pattern Matching in Trees, Journal of the ACM (JACM), v.29 n.1, p.68-95, Jan. 1982
	R. Kent Dybvig , Bruce T. Smith, A semantic editor, ACM SIGPLAN Notices, v.18 n.6, p.74-82, June 1983
	Rakesh M. Verma, A theory of using history for equational systems with applications, Journal of the ACM (JACM), v.42 n.5, p.984-1020, Sept. 1995
	Christoph M. Hoffmann , Michael J. O`Donnell, Implementation of an interpreter for abstract equations, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.111-121, January 15-18, 1984, Salt Lake City, Utah, United States
	Kazuhiro Ogata , Shigenori Ioroi , Kokichi Futatsugi, Optimizing term rewriting using discrimination nets with specialization, Proceedings of the 1999 ACM symposium on Applied computing, p.511-518, February 28-March 02, 1999, San Antonio, Texas, United States
	Kokichi Futatsugi , Koji Okada, A hierarchical structuring method for functional software systems, Proceedings of the 6th international conference on Software engineering, p.393-402, September 13-16, 1982, Tokyo, Japan
	Jerald S. Schwarz , Dean Rubine, Treat - an applicative code generator, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.133-139, January 15-18, 1984, Salt Lake City, Utah, United States
	David Sherman , Robert Strandh , Irène Durand, Optimization of equational programs using partial evaluation, ACM SIGPLAN Notices, v.26 n.9, p.72-82, Sept. 1991
	Bharat Jayaraman , Frank S. K. Silbermann, Equations, sets, and reduction semantics for functional and logic programming, Proceedings of the 1986 ACM conference on LISP and functional programming, p.320-331, August 1986, Cambridge, Massachusetts, United States
	Paul R Eggert , D Val Schorre, Logic enhancement: A method for extending logic programming languages, Proceedings of the 1982 ACM symposium on LISP and functional programming, p.74-80, August 15-18, 1982, Pittsburgh, Pennsylvania, United States
	Robert G. Bandes, Constraining-unification and the programming language unicorn, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.106-110, January 15-18, 1984, Salt Lake City, Utah, United States
	Satish R. Thatte, Towards a semantic theory for equational programming languages, Proceedings of the 1986 ACM conference on LISP and functional programming, p.332-342, August 1986, Cambridge, Massachusetts, United States
	Wan Fokkink , Jasper Kamperman , Pum Walters, Lazy rewriting on eager machinery, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.1, p.45-86, Jan. 2000
	Jia-Huai You , P. A. Subrahmanyam, Equational logic programming: an extension to equational programming, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.209-218, January 01, 1986, St. Petersburg Beach, Florida
	Wolfgang Küchlin, Some reduction strategies for algebraic term rewriting, ACM SIGSAM Bulletin, v.16 n.4, p.13-23, November 1982
	Bharat Jayaraman , Gopal Gupta, EQL: The Language and its Implementation, IEEE Transactions on Software Engineering, v.15 n.6, p.771-779, June 1989
	Bharat Jayaraman, Semantics of EqL, IEEE Transactions on Software Engineering, v.14 n.4, p.472-480, April 1988
	Prateek Mishra , Robert M. Keller, Static inference of properties of applicative programs, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.235-244, January 15-18, 1984, Salt Lake City, Utah, United States
	Kokichi Futatsugi , Joseph A. Goguen , Jean-Pierre Jouannaud , José Meseguer, Principles of OBJ2, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.52-66, January 14-16, 1985, New Orleans, Louisiana, United States
	E Mark Gold, Incremental reduction with nested constraints, ACM SIGPLAN Notices, v.26 n.2, p.25-34, Feb. 1991
	S. T. Shebs , R. R. Kessler, Automatic design and implementation of language data types, ACM SIGPLAN Notices, v.22 n.7, p.26-37, July 1987
	Nachum Dershowitz, Synthesis by completion, Proceedings of the 9th international joint conference on Artificial intelligence, p.208-214, August 18-23, 1985, Los Angeles, California