{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:25:45Z","timestamp":1725456345482},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634379"},{"type":"electronic","value":"9783540695479"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":[[1997]]},"DOI":"10.1007\/bfb0029968","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:24:59Z","timestamp":1133418299000},"page":"249-258","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Simulation as a correct transformation of rewrite systems"],"prefix":"10.1007","author":[{"given":"Wan","family":"Fokkink","sequence":"first","affiliation":[]},{"given":"Jaco","family":"van de Pol","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"25_CR1","unstructured":"J.A. Bergstra, J. Heering, and P. Klint, eds. Algebraic Specification. ACM Press in cooperation with Addison Wesley, 1989."},{"key":"25_CR2","unstructured":"R.M. Burstall and P.J. Landin. Programs and their proofs: an algebraic approach. In Machine Intelligence, Volume 4, pp. 17\u201343. Edinburgh University Press, 1969."},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Volume B, pp. 243\u2013320. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"H. Ehrig, H.-J. Kreowski, and P. Padawitz. Stepwise specification and implementation of abstract data types. In Proceedings ICALP'78, LNCS 62, pp. 205\u2013226. Springer, 1978.","DOI":"10.1007\/3-540-08860-1_16"},{"key":"25_CR5","unstructured":"W.J. Fokkink and J.C. van de Pol. Correct transformation of rewrite systems for implementation purposes. Logic Group Preprint Series 164, Utrecht University, 1996. Available at http:\/\/www.phil.ruu.nl."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"J.F.Th. Kamperman. Compilation of Term Rewriting Systems. PhD thesis, University of Amsterdam, 1996.","DOI":"10.1007\/3-540-61629-2_48"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"J.F.Th. Kamperman and H.R. Walters. Minimal term rewriting systems. In Proceedings WADT'95, LNCS 1130, pp. 274\u2013290. Springer, 1996.","DOI":"10.1007\/3-540-61629-2_48"},{"key":"25_CR8","unstructured":"J.F.Th. Kamperman and H.R. Walters. Simulating TRSs by minimal TRSs: a simple, efficient, and correct compilation technique. Report CS-119605, CWI, 1996. Available at http:\/\/www.cwi.nl\/epic."},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"J.W. Klop. Term rewriting systems. In Handbook of Logic in Computer Science, Volume I, pp. 1\u2013116. Oxford University Press, 1992.","DOI":"10.1093\/oso\/9780198537618.003.0001"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"A. Laville.Lazy pattern matching in the ML language. In Proceedings FSTTCS'87, LNCS 287, pp. 400\u2013419. Springer, 1987.","DOI":"10.1007\/3-540-18625-5_64"},{"key":"25_CR11","unstructured":"B. Luttik. Transformation of reduction systems: a view on proving correctness. Master's Thesis, University of Amsterdam, 1996."},{"key":"25_CR12","unstructured":"J. McCarthy. Towards a mathematical science of computation. In Proceedings Information Processing '62, pp. 21\u201328. North-Holland, 1963."},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"F.L. Morris. Advice on structuring compilers and proving them correct. In Proceedings POPL'73, pp. 144\u2013152. ACM Press, 1973.","DOI":"10.1145\/512927.512941"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1145\/322374.322381","volume":"30","author":"C.F. Nourani","year":"1983","unstructured":"C.F. Nourani. Abstract implementations and their correctness proofs. Journal of the ACM, 30:343\u2013359, 1983.","journal-title":"Journal of the ACM"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"M.J. O'Donnell. Equational Logic as a Programming Language. MIT Press, 1985.","DOI":"10.1007\/3-540-15648-8_20"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"R.C. Sekar, S. Pawagi, and I.V. Ramakrishnan. Transforming strongly sequential rewrite systems with constructors for efficient parallel execution. In Proceedings RTA'89, LNCS 355, pp. 404\u2013418. Springer, 1989.","DOI":"10.1007\/3-540-51081-8_122"},{"issue":"2","key":"25_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0020-0190(85)90068-7","volume":"20","author":"S.R. Thatte","year":"1985","unstructured":"S.R. Thatte. On the correspondence between two classes of reduction systems. Information Processing Letters, 20(2):83\u201385, 1985.","journal-title":"Information Processing Letters"},{"issue":"1","key":"25_CR18","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(88)90109-0","volume":"61","author":"S.R. Thatte","year":"1988","unstructured":"S.R. Thatte. Implementing first-order rewriting with constructor systems. Theoretical Computer Science, 61(1):83\u201392, 1988.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"25_CR19","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0304-3975(94)00255-0","volume":"152","author":"R.M. Verma","year":"1995","unstructured":"R.M. Verma. Transformations and confluence for rewrite systems. Theoretical Computer Science, 152(2):269\u2013283, 1995.","journal-title":"Theoretical Computer Science"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"H.R. Walters and J.F.Th. Kamperman. EPIC: an equational language \u2014 abstrac machine and supporting tools. In Proceedings RTA'96, LNCS 1103, pp. 424\u2013427. Springer, 1996.","DOI":"10.1007\/3-540-61464-8_72"},{"key":"25_CR21","unstructured":"H.R. Walters and J.F.Th. Kamperman. EPIC 1.0 (unconditional), an equational programming language. Report CS-119604, CWI, 1996. Available at http:\/\/www.cwi.nl\/epic."},{"issue":"12","key":"25_CR22","doi-asserted-by":"crossref","first-page":"89","DOI":"10.3233\/FI-1995-24124","volume":"24","author":"H. Zantema","year":"1995","unstructured":"H. Zantema. Termination of term rewriting by semantic labelling. Fundamenta Informaticae, 24(1,2):89\u2013105, 1995.","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1997"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029968","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T06:59:07Z","timestamp":1706770747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029968"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634379","9783540695479"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0029968","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"17 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}