{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:23:43Z","timestamp":1725456223008},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540627814"},{"type":"electronic","value":"9783540685173"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0030593","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:10:41Z","timestamp":1133417441000},"page":"153-164","source":"Crossref","is-referenced-by-count":0,"title":["Simulating forward-branching systems with constructor systems"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Salinier","sequence":"first","affiliation":[]},{"given":"Robert","family":"Strandh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"issue":"4","key":"12_CR1","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1006\/jsco.1994.1050","volume":"18","author":"I. Durand","year":"1994","unstructured":"Ir\u00e8ne Durand. Bounded, strongly sequential and forward-branching term rewriting systems. Journal of Symbolic Computation, 18(4):319\u2013352, October 1994.","journal-title":"Journal of Symbolic Computation"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(93)90236-3","volume":"47","author":"I. Durand","year":"1993","unstructured":"Ir\u00e8ne Durand and Bruno Salinier. Constructor equivalent term rewriting systems. Inform. Processing Letters, 47:131\u2013137, 1993.","journal-title":"Inform. Processing Letters"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0020-0190(94)00122-7","volume":"52","author":"I. Durand","year":"1994","unstructured":"Ir\u00e8ne Durand and Bruno Salinier. Constructor equivalent term rewriting systems are strongly sequential: a direct proof. Inform. Processing Letters, 52:137\u2013145, 1994.","journal-title":"Inform. Processing Letters"},{"key":"12_CR4","unstructured":"G\u00e9rard Huet and Jean-Jacques L\u00e9vy. Computations in orthogonal term rewriting systems. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson, chapter 11\u201312, pages 397\u2013443. MIT Press, 1991."},{"key":"12_CR5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0747-7171(08)80124-1","volume":"12","author":"J. W. Klop","year":"1991","unstructured":"Jan Willem Klop and Aart Middeldorp. Sequentially in orthogonal term rewriting systems. Journal of Symbolic Computation, 12:161\u2013195, 1991.","journal-title":"Journal of Symbolic Computation"},{"volume-title":"Th\u00e8se de doctorat","year":"1995","author":"B. Salinier","key":"12_CR6","unstructured":"Bruno Salinier. Simulation de syst\u00e8mes de r\u00e9\u00e9criture de termes par des syst\u00e8mes constructeurs. Th\u00e8se de doctorat, Universit\u00e9 Bordeaux I, 351 cours de la Lib\u00e9ration, 33405 Talence, France, December 1995."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Robert I. Strandh. Classes of equational programs that compile into efficient machine code. In RTA 89, Rewriting Techniques and Applications, volume 355 of LNCS, pages 449\u2013461. Springer-Verlag, 1989.","DOI":"10.1007\/3-540-51081-8_125"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0020-0190(85)90068-7","volume":"20","author":"S. Thatte","year":"1985","unstructured":"Satish Thatte. On the correspondence between two classes of reduction systems. Inform. Processing Letters, 20:83\u201385, 1985.","journal-title":"Inform. Processing Letters"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '97: Theory and Practice of Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030593","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:20:19Z","timestamp":1586593219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030593"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540627814","9783540685173"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0030593","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}