{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:42:38Z","timestamp":1725496958405},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540418641"},{"type":"electronic","value":"9783540453154"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45315-6_13","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T01:28:39Z","timestamp":1196645319000},"page":"199-213","source":"Crossref","is-referenced-by-count":3,"title":["On the Modularity of Deciding Call-by-Need"],"prefix":"10.1007","author":[{"given":"Ir\u00e8ne","family":"Durand","sequence":"first","affiliation":[]},{"given":"Aart","family":"Middeldorp","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,23]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9781139172752"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1006\/inco.1999.2838","volume":"157","author":"H. Comon","year":"2000","unstructured":"H. Comon. Sequentiality, monadic second-order logic and tree automata. Information and Computation, 157:25\u201351, 2000.","journal-title":"Information and Computation"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17:279\u2013301, 1982.","journal-title":"Theoretical Computer Science"},{"key":"13_CR4","first-page":"243","volume":"B","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In Handbook of Theoretical Computer Science, volume B, pages 243\u2013320. Elsevier, 1990.","journal-title":"Handbook of Theoretical Computer Science"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1006\/jsco.1994.1050","volume":"18","author":"I. Durand","year":"1994","unstructured":"I. Durand. Bounded, strongly sequential and forward-branching term rewriting systems. Journal of Symbolic Computation, 18:319\u2013352, 1994.","journal-title":"Journal of Symbolic Computation"},{"key":"13_CR6","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/3-540-63104-6_2","volume":"1249","author":"I. Durand","year":"1997","unstructured":"I. Durand and A. Middeldorp. Decidable decidable call by need computations in term rewriting (extended abstract). In Proceedings of the 14th International Conference on Automated Deduction, volume 1249 of LNAI, pages 4\u201318, 1997.","journal-title":"Proceedings of the 14th International Conference on Automated Deduction"},{"key":"13_CR7","unstructured":"I. Durand and A. Middeldorp. On the complexity of deciding call-by-need. Technical Report 1194-98, LaBRI, Universit\u00e9 de Bordeaux I, 1998."},{"key":"13_CR8","unstructured":"B. Gramlich. Termination and Confluence Properties of Structured Rewrite Systems. PhD thesis, Universit\u00e4t Kaiserslautern, 1996."},{"key":"13_CR9","unstructured":"G. Huet and J.-J. L\u00e9vy. Computations in orthogonal rewriting systems, I and II. In Computational Logic, Essays in Honor of Alan Robinson, pages 396\u2013443. The MIT Press, 1991. Original version: Report 359, Inria, 1979."},{"key":"13_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/3-540-61464-8_65","volume-title":"Proceedings of the 7th International Conference on Rewriting Techniques and Applications","author":"F. Jacquemard","year":"1996","unstructured":"F. Jacquemard. Decidable approximations of term rewriting systems. In Proceedings of the 7th International Conference on Rewriting Techniques and Applications, volume 1103 of LNCS, pages 362\u2013376, 1996."},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1006\/jsco.1996.0002","volume":"21","author":"R. Kennaway","year":"1996","unstructured":"R. Kennaway, J.W. Klop, R. Sleep, and F.-J. de Vries. Comparing curried and uncurried rewriting. Journal of Symbolic Computation, 21(1):15\u201339, 1996.","journal-title":"Journal of Symbolic Computation"},{"key":"13_CR12","first-page":"1","volume":"2","author":"J.W. Klop","year":"1992","unstructured":"J.W. Klop. Term rewriting systems. In Handbook of Logic in Computer Science, Vol. 2, pages 1\u2013116. Oxford University Press, 1992.","journal-title":"Handbook of Logic in Computer Science"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0747-7171(08)80124-1","volume":"12","author":"J.W. Klop","year":"1991","unstructured":"J.W. Klop and A. Middeldorp. Sequentiality in orthogonal term rewriting systems. Journal of Symbolic Computation, 12:161\u2013195, 1991.","journal-title":"Journal of Symbolic Computation"},{"key":"13_CR14","volume-title":"Modular Properties of Term Rewriting Systems","author":"A. Middeldorp","year":"1990","unstructured":"A. Middeldorp. Modular Properties of Term Rewriting Systems. PhD thesis, Vrije Universiteit, Amsterdam, 1990."},{"key":"13_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-48685-2_22","volume-title":"Proceedings of the 10th International Conference on Rewriting Techniques and Applications","author":"T. Nagaya","year":"1999","unstructured":"T. Nagaya and Y. Toyama. Decidability for left-linear growing term rewriting systems. In Proceedings of the 10th International Conference on Rewriting Techniques and Applications, volume 1631 of LNCS, pages 256\u2013270, 1999."},{"key":"13_CR16","unstructured":"E. Ohlebusch. Modular Properties of Composable Term Rewriting Systems. PhD thesis, Universitat Bielefeld, 1994."},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1137\/0222010","volume":"22","author":"M. Oyamaguchi","year":"1993","unstructured":"M. Oyamaguchi. NV-sequentiality: A decidable condition for call-by-need computations in term rewriting systems. SIAM Journal on Computation, 22:114\u2013135, 1993.","journal-title":"SIAM Journal on Computation"},{"key":"13_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/3-540-51081-8_125","volume-title":"Proceedings of the 3rd International Conference on Rewriting Techniques and Applications","author":"R. Strandh","year":"1989","unstructured":"R. Strandh. Classes of equational programs that compile into efficient machine code. In Proceedings of the 3rd International Conference on Rewriting Techniques and Applications, volume 355 of LNCS, pages 449\u2013461, 1989."},{"key":"13_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/10721975_17","volume-title":"Proceedings of the 11th International Conference on Rewriting Techniques and Applications","author":"T. Takai","year":"2000","unstructured":"T. Takai, Y. Kaji, and H. Seki. Right-linear finite path overlapping term rewriting systems effectively preserve recognizability. In Proceedings of the 11th International Conference on Rewriting Techniques and Applications, volume 1833 of LNCS, pages 246\u2013260, 2000."},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Y. Toyama. Strong sequentiality of left-linear overlapping term rewriting systems. In Proceedings of the 7th IEEE Annual Symposium on Logic in Computer Science, pages 274\u2013284, 1992.","DOI":"10.1109\/LICS.1992.185540"},{"key":"13_CR21","unstructured":"Y. Toyama, S. Smetsers, M. van Eekelen, and R. Plasmeijer. The functional strategy and transitive term rewriting systems. In Term Graph Rewriting: Theory and Practice, pages 61\u201375. Wiley, 1993."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45315-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,2]],"date-time":"2019-03-02T11:39:19Z","timestamp":1551526759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45315-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418641","9783540453154"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45315-6_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}