{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:18:30Z","timestamp":1742617110639,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540543176"},{"type":"electronic","value":"9783540475583"}],"license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54317-1_102","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:40:37Z","timestamp":1330209637000},"page":"333-341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Design strategies for rewrite rules"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Antoy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Antoy S., P. Forcheri, and M.T. Molfino, \u201cSpecification-based Code Generation\u201d, 23rd Hawaii Int'l Conf. on System Sciences, Kona, Hawaii, Jan. 3\u20135, 1990, 165\u2013173.","DOI":"10.1109\/HICSS.1990.205185"},{"volume-title":"Algebraic Specifications","year":"1989","key":"26_CR2","unstructured":"Bergstra J.A., J. Heering, and P. Klint, (eds.) Algebraic Specifications, Addison-Wesley, Wokingham, England, 1989."},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1093\/comjnl\/12.1.41","volume":"21-1","author":"L. Burstall","year":"1969","unstructured":"Burstall L., \u201cProving Properties of Programs by Structural Induction\u201d, Computer Journal, 21-1, 1969, 41\u201348.","journal-title":"Computer Journal"},{"key":"26_CR4","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/3-540-15976-2_9","volume-title":"Proc. Rewriting Techniques and Applications","author":"N. Dershowitz","year":"1985","unstructured":"Dershowitz N., \u201cTermination\u201d, Proc. Rewriting Techniques and Applications, Dijon, France, Springer-Verlag, May 1985, 180\u2013223."},{"key":"26_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69962-7","volume-title":"Fundamentals of Algebraic Specification 1","author":"M. Ehrig","year":"1985","unstructured":"Ehrig M. and B. Mahr, Fundamentals of Algebraic Specification 1, Springer-Verlag, Berlin, 1985."},{"key":"26_CR6","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0743-1066(87)90006-9","volume":"4","author":"M. Emden van","year":"1987","unstructured":"van Emden M. and K. Yukawa, \u201cLogic Programming with Equations\u201d, The Journal of Logic Prog., 4, 265\u2013288, 1987.","journal-title":"The Journal of Logic Prog."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Futatsugi K., J.A. Goguen, J. P. Jouannaud, and J. Meseguer, \u201cPrinciples of OBJ2\u201d, in 12th Annual Symp. on Principles of Prog. Languages, 52\u201366, SIGPLAN and SIGACT, 1984.","DOI":"10.1145\/318593.318610"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Garland S.J. and J.V. Guttag, \u201cInductive Methods for Reasoning about Abstract Data Types\u201d Proc. of the 15th ACM Conf. on Principle of Prog. Lang., 219\u2013228, 1988.","DOI":"10.1145\/73560.73579"},{"key":"26_CR9","unstructured":"Goguen J.A., J.W. Thatcher, and E.G. Wagner, \u201cAn Initial Algebra Approach to the Specification, Correctness, and Implementation of Abstract Data Types\u201d, in Current Trends in Programming Methodology 4, 80\u2013149 (Ed. R.T. Yeh), Prentice-Hall, Englewood Cliff, NJ, 1978."},{"key":"26_CR10","volume-title":"\u201cIntroducing OBJ3\u201d, SRI-CSL-88-9","author":"J.A. Goguen","year":"1988","unstructured":"Goguen J.A. and T. Winkler, \u201cIntroducing OBJ3\u201d, SRI-CSL-88-9, SRI International, Menlo Park, CA, 1988"},{"key":"26_CR11","first-page":"60","volume-title":"Current Trends in Programming Methodology 4","author":"J.V. Guttag","year":"1978","unstructured":"Guttag J.V., E. Horowitz, and D. Musser, \u201cThe Design of Data Type Specifications\u201d, in Current Trends in Programming Methodology 4, 60\u201379 (Ed. R.T. Yeh), Prentice-Hall, Englewood Cliff, NJ, 1978."},{"key":"26_CR12","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1145\/359657.359666","volume":"21","author":"J.V. Guttag","year":"1978","unstructured":"Guttag J.V., E. Horowitz, and D. Musser, \u201cAbstract Data Types and Software Validation\u201d, CACM, 21, 1978, 1048\u20131064.","journal-title":"CACM"},{"key":"26_CR13","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF00260922","volume":"10","author":"J.V. Guttag","year":"1978","unstructured":"Guttag J.V. and J.J. Horning, \u201cThe Algebraic Specifications of Abstract Data Types\u201d, Acta Informatica, 10, 1978, 27\u201352.","journal-title":"Acta Informatica"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Guttag J.V., J.J. Horning, and J.M. Wing, \u201cThe Larch Family of Specification Languages\u201d, IEEE Software, Sept 1985, 24\u201336.","DOI":"10.1109\/MS.1985.231756"},{"key":"26_CR15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0167-6423(86)90022-5","volume":"6","author":"J.V. Guttag","year":"1985","unstructured":"Guttag J.V. and Horning J.J., \u201cA Larch Shared Language Handbook\u201d Science of Computer Programming 6\u20132, 135\u2013157, 1985.","journal-title":"Science of Computer Programming"},{"key":"26_CR16","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1002\/spe.4380181006","volume":"18","author":"H. Halme","year":"1988","unstructured":"Halme H. and J. Heilanen, \u201cGNU Emacs as a Dynamically Extensible Programming Environment\u201d, Software\u2014Practice and Experience, 18\u201310, 1988, 999\u20131009.","journal-title":"Software\u2014Practice and Experience"},{"key":"26_CR17","volume-title":"Introduction to Automata Theory, Languages, and Computations","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft J.E. and J.D. Ullman, Introduction to Automata Theory, Languages, and Computations, Addison-Wesley, Reading, MA, 1979."},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Huet G. and D. Oppen, \u201cEquations and rewrite rules: A survey\u201d, in Formal Language Theory (R. Book, ed.), Academic Press, 1980, 349\u2013405.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"26_CR19","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"Huet G., \u201cConfluent Reductions: Abstract Properties and Applications to Term-Rewriting Systems\u201d, JACM, 27, 1980, 797\u2013821.","journal-title":"JACM"},{"key":"26_CR20","first-page":"239","volume":"25","author":"G. Huet","year":"1982","unstructured":"Huet G. and J.-M. Hullot, \u201cProofs by Induction in Equational Theories with Constructors\u201d, JCSS 25, 1982, 239\u2013266.","journal-title":"JCSS"},{"key":"26_CR21","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF00292110","volume":"24","author":"D. Kapur","year":"1987","unstructured":"Kapur D., P. Narendran, and H. Zhang, \u201cOn Sufficient-Completeness and Related Properties of Term Rewriting Systems\u201d, Acta Informatica, 24, 1987, 395\u2013415.","journal-title":"Acta Informatica"},{"key":"26_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5749-3","volume-title":"A Programming Approach to Computability","author":"A. Kfoury","year":"1982","unstructured":"Kfoury A., R. Moll, and M. Arbib, A Programming Approach to Computability, Springer-Verlag, New York, NY, 1982."},{"key":"26_CR23","first-page":"263","volume-title":"Computational Problems in Abstract Algebras","author":"D.E. Knuth","year":"1970","unstructured":"Knuth D.E. and P.B. Bendix, \u201cSimple Word Problems in Universal Algebras\u201d, in Computational Problems in Abstract Algebras, (J. Leech, ed.), Pergamon Press, New York, 1970, 263\u2013297."},{"key":"26_CR24","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/3-540-15984-3_291","volume":"204","author":"E. Kounalis","year":"1985","unstructured":"Kounalis E., \u201cCompleteness in Data Type Specifications\u201d, EUROCAL '85, LNCS 204, 1985, 348\u2013362.","journal-title":"EUROCAL '85"},{"key":"26_CR25","volume-title":"The Logical Basis for Computer Programming","author":"Z. Manna","year":"1985","unstructured":"Manna Z. and R. Waldinger, The Logical Basis for Computer Programming, Addison-Wesley, Reading, MA, 1985."},{"key":"26_CR26","volume-title":"Computation: Finite and Infinite Machines","author":"M. L. Minsky","year":"1967","unstructured":"Minsky M. L., Computation: Finite and Infinite Machines, Prentice-Hall, Englewood Cliffs, NJ, 1967."},{"key":"26_CR27","doi-asserted-by":"crossref","unstructured":"Stallman R., \u201cEmacs: the Extensible, Customizable, Self-documenting Display Editor\u201d, Proc. ACM SIGPLA\/SIGOA Symp. on Text Manipulation, Portland, OR, 1981.","DOI":"10.1145\/800209.806466"},{"key":"26_CR28","volume-title":"GNU Emacs Manual, Sixth ed., Version 18","author":"R. Stallman","year":"1987","unstructured":"Stallman R., GNU Emacs Manual, Sixth ed., Version 18, Free Software Foundation, Cambridge, MA, 1987."},{"key":"26_CR29","doi-asserted-by":"crossref","unstructured":"Thiel J.J., \u201cStop Losing Sleep over Incomplete Data Type Specifications\u201d, in 11th Annual Symp. on Principles of Prog. Languages, 76\u201382, ACM, 1984.","DOI":"10.1145\/800017.800518"},{"key":"26_CR30","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0743-1066(87)90013-6","volume":"4","author":"A. Togashi","year":"1987","unstructured":"Togashi A. and S Noguchi, \u201cA Program Transformation from Equational Programs into Logic Programs\u201d, The Journal of Logic Prog., 4, 85\u2013103, 1987.","journal-title":"The Journal of Logic Prog."}],"container-title":["Lecture Notes in Computer Science","Conditional and Typed Rewriting Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54317-1_102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:16:37Z","timestamp":1742591797000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54317-1_102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540543176","9783540475583"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-54317-1_102","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}