{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T21:04:13Z","timestamp":1648587853443},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540613770","type":"print"},{"value":"9783540685074","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61377-3_29","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:35:38Z","timestamp":1330292138000},"page":"16-35","source":"Crossref","is-referenced-by-count":0,"title":["Semantics of non-terminating rewrite systems using minimal coverings"],"prefix":"10.1007","author":[{"given":"Jos\u00e9","family":"Barros","sequence":"first","affiliation":[]},{"given":"Joseph","family":"Goguen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"2_CR1","unstructured":"Jos\u00e9 Barros. Semantics of non-terminating systems through term rewriting. Technical Report PRG-TR-21-95, Programming Research Group, Oxford University, June 1995. D.Phil. Thesis. Available through FTP at ftp.comlab.ox.ac.uk\/pub\/Documents\/techreports\/TR-21-95.ps.gz."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Jan Bergstra and John Tucker. Characterization of computable data types by means of a finite equational specification method. In Automata, Languages and Programming, Seventh Colloquium, pages 76\u201390. Springer-Verlag, July 1980. Lecture Notes in Computer Science, Volume 85; also, Preprint IW 124, Mathematisch Centrum, Department of Computer Science, Amsterdam, November, 1979.","DOI":"10.1007\/3-540-10003-2_61"},{"key":"2_CR3","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/S0022-0000(76)80030-X","volume":"13","author":"S. Bloom","year":"1976","unstructured":"Steven Bloom. Varieties of ordered algebras. Journal of Computer and System Sciences, 13:200\u2013212, 1976.","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR4","unstructured":"G. Boudol. Computational semantics of term rewriting systems. In Algebraic Methods in Semantics, pages 167\u2013236. Cambridge University Press, 1985."},{"key":"2_CR5","unstructured":"Y. Chen and M. O'Donnell. Infinite terms and infinite rewritings. In 2nd International Workshop on Conditional and Typed Rewriting Systems, pages 45\u201352, 1990."},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01744293","volume":"13","author":"B. Courcelle","year":"1979","unstructured":"Bruno Courcelle. Infinite trees in normal form and recursive equations having a unique solution. Mathematical Systems Theory, 13:131\u2013180, 1979.","journal-title":"Mathematical Systems Theory"},{"issue":"1","key":"2_CR7","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0304-3975(91)90040-9","volume":"83","author":"N. Dershowitz","year":"1991","unstructured":"Nachum Dershowitz, Stephane Kaplan, and David Plaisted. Rewrite, rewrite, rewrite, .... Theoretical Computer Science, 83(1):71\u201396, 1991. Preliminary versions appear in Proceedings of the 16th ACM Symposium on Principles of Programming Languages, 1989 and in Proceedings of the 16th EATCS International Colloquium on Automata, Languages and Programming, Volume 372 of the Lecture Notes in Computer Science, 1989.","journal-title":"Theoretical Computer Science"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Joseph Goguen. How to prove algebraic inductive hypotheses without induction: with applications to the correctness of data type representations. In Proceedings, Fifth Conference on Automated Deduction, pages 356\u2013373. Springer-Verlag, 1980. Lecture Notes in Computer Science, Volume 87.","DOI":"10.1007\/3-540-10009-1_27"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Joseph Goguen. What is unification? \u2014 A categorical view of substitution, equation and solution. In Resolution of Equations in Algebraic Systems, volume 1. Academic Press, 1989. Preliminary version in Proceedings, Colloquium on the Resolution of Equations in Algebraic Structures, held in Lakeway, Texas, USA, May 1987.","DOI":"10.1016\/B978-0-12-046370-1.50012-7"},{"key":"2_CR10","unstructured":"Joseph Goguen. Theorem Proving and Algebra. MIT Press, To appear 1994."},{"key":"2_CR11","unstructured":"Joseph Goguen, James Thatcher, and Eric Wagner. An initial algebra approach to the specification, correctness and implementation of abstract data types. Technical Report RC 6487, IBM Watson Research Center, October 1976. Appears in Current Trends in Programming Methodology, IV, Raymond Yeh, Ed., Prentice-Hall, 1978, pages 80\u2013149."},{"issue":"1","key":"2_CR12","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"J. Goguen","year":"1977","unstructured":"Joseph Goguen, James Thatcher, Eric Wagner, and Jesse Wright. Initial algebra semantics and continuous algebras. Journal of the Association for Computing Machinery, 24(1):68\u201395, January 1977.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"2_CR13","unstructured":"Matthew Hennessy. Algebraic Theory of Processes. MIT Press, 1988."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Gerard Huet and Derek Oppen. Equations and rewrite rules: A survey. In Ronald Book, editor, Formal Language Theory: Perspectives and Open Problems, pages 349\u2013405. Academic Press, 1980. Also Technical Report No. STAN-CS-80-785, Computer Science Department, Stanford University.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"2_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-53904-2_81","volume":"488","author":"J. Kennaway","year":"1991","unstructured":"J. Kennaway, J. W. Klop, M. Sleep, and F. de Vries. Transfinite reductions in orthogonal term rewriting systems. Lecture Notes in Computer Science, 488:1\u201312, 1991. Extended abstract.","journal-title":"Lecture Notes in Computer Science"},{"issue":"2","key":"2_CR17","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1137\/0211016","volume":"11","author":"M. Levy","year":"1982","unstructured":"Michael Levy and T. S. E. Maibaum. Continuous data types. SIAM Journal on Computing, 11(2):201\u2013216, 1982.","journal-title":"SIAM Journal on Computing"},{"key":"2_CR18","unstructured":"N. Mart\u00ed-Oliet and Jos\u00e9 Meseguer. Rewriting logic as a logical and semantical framework. Technical report, SRI International, 1994."},{"key":"2_CR19","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"Jos\u00e9 Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96:73\u2013155, 1992. Preliminary version appears as SRI International technical report n. SRI-CSL-90-02R.","journal-title":"Theoretical Computer Science"},{"key":"2_CR20","unstructured":"T. Naoi and Y. Inagaki. Free continuous algebras and semantics of term rewriting systems. Technical report, Department of Information Science, Nagoya University, 1986."},{"key":"2_CR21","unstructured":"Maurice Nivat. On the interpretation of polyadic recursive schemes. In Symposia Mathematica, volume 15. Academic Press, 1975."},{"issue":"4","key":"2_CR22","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1145\/322217.322229","volume":"27","author":"J.-C. Raoult","year":"1980","unstructured":"J.-C. Raoult and Jean Vuillemin. Operational and semantic equivalence between recursive programs. Journal of the Association for Computing Machinery, 27(4):772\u2013796, 1980.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"David Turner. Miranda: A non-strict functional language with polymorphic types. In Jean-Pierre Jouannaud, editor, Functional Programming Languages and Computer Architectures, pages 1\u201316. Springer-Verlag, 1985. Lecture Notes in Computer Science, Volume 201.","DOI":"10.1007\/3-540-15975-4_26"}],"container-title":["Computer Science Logic","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61377-3_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T10:33:48Z","timestamp":1640946828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61377-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613770","9783540685074"],"references-count":23,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-61377-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}