{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T09:51:02Z","timestamp":1658224262813},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540172208","type":"print"},{"value":"9783540474210","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-17220-3_1","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:14:36Z","timestamp":1330197276000},"page":"1-12","source":"Crossref","is-referenced-by-count":7,"title":["Term-rewriting implementation of equational logic programming"],"prefix":"10.1007","author":[{"given":"Michael J.","family":"O'Donnell","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"O. P. Buneman and R. E. Frankel. FQL \u2014 a functional query language. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 52\u201357, SIGMOD, May\u2013June 1979.","DOI":"10.1145\/582103.582104"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013332, 1980.","DOI":"10.1007\/3-540-10007-5_41"},{"key":"1_CR3","unstructured":"N. D. Belnap and T. B. Steel. The Logic of Questions and Answers. Yale University Press, 1976."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"L. P. Chew. An improved algorithm for computing with equations. In 21st Annual Symposium on Foundations of Computer Science, pages 108\u2013117, IEEE, 1980.","DOI":"10.1109\/SFCS.1980.11"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"L. P. Chew. Unique normal forms in term rewriting systems with repeated variables. In 13th Annual ACM Symposium on Theory of Computing, pages 7\u201318, 1981.","DOI":"10.1145\/800076.802452"},{"issue":"2","key":"1_CR6","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/5383.5389","volume":"33","author":"V. J. Digricoli","year":"1986","unstructured":"V. J. Digricoli and M. C. Harrison. Equality-based binary resolution. Journal of the ACM, 33(2):253\u2013289, 1986.","journal-title":"Journal of the ACM"},{"issue":"4","key":"1_CR7","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/322217.322228","volume":"27","author":"P. J. Downey","year":"1980","unstructured":"P. J. Downey, R. Sethi, and R. E. Tarjan. Variations on the common subexpression problem. Journal of the ACM, 27(4):758\u2013771, 1980.","journal-title":"Journal of the ACM"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In 12th Annual Symposium on Principles of Programming Languages, pages 52\u201366, SIGPLAN and SIGACT, 1985.","DOI":"10.1145\/318593.318610"},{"key":"1_CR9","unstructured":"D. Friedman and D. Wise. Cons should not evaluate its arguments. In 3rd International Colloquium on Automata, Languages and Programming, pages 257\u2013284, Edinburgh Unversity Press, 1976."},{"key":"1_CR10","unstructured":"G. Huet and J.-J. L\u00e9vy. Computations in Non-ambiguous Linear Term Rewriting Systems. Technical Report 359, IRIA, 1979."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"P. Henderson and J. H. Morris. A lazy evaluator. In 3rd Annual Symposium on Principles of Programming Languages, pages 95\u2013103, SIGPLAN and SIGACT, 1976.","DOI":"10.1145\/800168.811543"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013179, SIGPLAN and SIGACT, 1979.","DOI":"10.1145\/567752.567768"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"G. Huet and D. Oppen. Equations and rewrite rules: a survey. In R. Book, editor, Formal Languages: Perspectives and Open Problems, Academic Press, 1980.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"issue":"12","key":"1_CR14","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1002\/spe.4380151205","volume":"15","author":"C. M. Hoffmann","year":"1985","unstructured":"C. M. Hoffmann, M. J. O'Donnell, and R. I. Strandh. Implementation of an interpreter for abstract equations. Software \u2014 Practice and Experience, 15(12):1185\u20131203, 1985.","journal-title":"Software \u2014 Practice and Experience"},{"key":"1_CR15","unstructured":"B. Jayaraman. Equational Programming: A Unifying Approach to Functional and Logic Programming. Technical Report 85-030, The University of North Carolina, 1985."},{"key":"1_CR16","first-page":"127","volume-title":"Computational Problems in Abstract Algebra","author":"D. E. Knuth","year":"1970","unstructured":"D. E. Knuth and P. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 127\u2013146, Pergammon Press, Oxford, 1970."},{"key":"1_CR17","volume-title":"Combinatory Reduction Systems","author":"J. W. Klop","year":"1980","unstructured":"J. W. Klop. Combinatory Reduction Systems. PhD thesis, Mathematisch Centrum, Amsterdam, 1980."},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"D. Kozen. Complexity of finitely presented algebras. In 9th Annual ACM Symposium on Theory of Computing, pages 164\u2013177, 1977.","DOI":"10.1145\/800105.803406"},{"issue":"2","key":"1_CR19","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1145\/322186.322198","volume":"27","author":"G. Nelson","year":"1980","unstructured":"G. Nelson and D. C. Oppen. Fast decision algorithms based on congruence closure. Journal of the ACM, 27(2):356\u2013364, 1980.","journal-title":"Journal of the ACM"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"M. J. O'Donnell. Computing in Systems Described by Equations. Volume 58 of Lecture Notes in Computer Science, Springer-Verlag, 1977.","DOI":"10.1007\/3-540-08531-9"},{"key":"1_CR21","volume-title":"Equational Logic as a Programming Language","author":"M. J. O'Donnell","year":"1985","unstructured":"M. J. O'Donnell. Equational Logic as a Programming Language. MIT Press, Cambridge, MA, 1985."},{"key":"1_CR22","unstructured":"M. J. O'Donnell. Survey of the equational logic programming project. In Colloquium on Resolution of Equations in Algebraic Structures, 1987."},{"key":"1_CR23","unstructured":"R. I. Strandh. Incremental Suffix Trees with Multiple Subject Strings. Technical Report JHU\/EECS-84\/18, The Johns-Hopkins University, 1984."}],"container-title":["Rewriting Techniques and Applications","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-17220-3_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:12:55Z","timestamp":1605643975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-17220-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540172208","9783540474210"],"references-count":23,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-17220-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[1987]]}}}