{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:05:11Z","timestamp":1725559511403},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540266556"},{"type":"electronic","value":"9783540316831"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11506676_7","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T12:07:52Z","timestamp":1279454872000},"page":"101-116","source":"Crossref","is-referenced-by-count":1,"title":["Natural Rewriting for General Term Rewriting Systems"],"prefix":"10.1007","author":[{"given":"Santiago","family":"Escobar","sequence":"first","affiliation":[]},{"given":"Jos\u00e9","family":"Meseguer","sequence":"additional","affiliation":[]},{"given":"Prasanna","family":"Thati","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BFb0013825","volume-title":"Algebraic and Logic Programming","author":"S. Antoy","year":"1992","unstructured":"Antoy, S.: Definitional trees. In: Kirchner, H., Levi, G. (eds.) ALP 1992. LNCS, vol.\u00a0632, pp. 143\u2013157. Springer, Heidelberg (1992)"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1145\/773184.773205","volume-title":"Proc. of 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP2001","author":"S. Antoy","year":"2001","unstructured":"Antoy, S.: Constructor-based conditional narrowing. In: Proc. of 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP2001, September 2001, pp. 199\u2013206. ACM Press, Florence (2001)"},{"key":"7_CR3","first-page":"138","volume-title":"Proc. of the Fourteenth International Conference on Logic Programming (ICLP1997)","author":"S. Antoy","year":"1997","unstructured":"Antoy, S., Echahed, R., Hanus, M.: Parallel evaluation strategies for functional logic languages. In: Proc. of the Fourteenth International Conference on Logic Programming (ICLP1997), pp. 138\u2013152. MIT Press, Cambridge (1997)"},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1145\/347476.347484","volume":"47","author":"S. Antoy","year":"2000","unstructured":"Antoy, S., Echahed, R., Hanus, M.: A needed narrowing strategy. Journal of the ACM\u00a047(4), 776\u2013822 (2000)","journal-title":"Journal of the ACM"},{"key":"7_CR5","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Proc. of the 11th Int\u2019l Workshop on Functional and (Constraint) Logic Programming WFLP2002","author":"S. Antoy","year":"2002","unstructured":"Antoy, S., Lucas, S.: Demandness in rewriting and narrowing. In: Comini, M., Falaschi, M. (eds.) Proc. of the 11th Int\u2019l Workshop on Functional and (Constraint) Logic Programming WFLP2002. Electronic Notes in Theoretical Computer Science, vol.\u00a076. Elsevier, Amsterdam (2002)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0304-3975(01)00358-9","volume":"285","author":"P. Borovansk\u00fd","year":"2002","unstructured":"Borovansk\u00fd, P., Kirchner, C., Kirchner, H., Moreau, P.-E.: ELAN from a rewriting logic point of view. Theoretical Computer Science\u00a0285, 155\u2013185 (2002)","journal-title":"Theoretical Computer Science"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0304-3975(01)00359-0","volume":"285","author":"M. Clavel","year":"2002","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Quesada, J.: Maude: specification and programming in rewriting logic. Theoretical Computer Science\u00a0285, 187\u2013243 (2002)","journal-title":"Theoretical Computer Science"},{"key":"7_CR8","doi-asserted-by":"crossref","DOI":"10.1142\/3163","volume-title":"Language Prototyping: An Algebraic Specification Approach","author":"A. Deursen","year":"1996","unstructured":"Deursen, A., Heering, J., Klint, P.: Language Prototyping: An Algebraic Specification Approach. World Scientific, Singapore (1996)"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/888251.888263","volume-title":"Proc. of 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP2003","author":"S. Escobar","year":"2003","unstructured":"Escobar, S.: Refining weakly outermost-needed rewriting and narrowing. In: Miller, D. (ed.) Proc. of 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP2003, pp. 113\u2013123. ACM Press, New York (2003)"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-24754-8_12","volume-title":"Functional and Logic Programming","author":"S. Escobar","year":"2004","unstructured":"Escobar, S.: Implementing natural rewriting and narrowing efficiently. In: Kameyama, Y., Stuckey, P.J. (eds.) FLOPS 2004. LNCS, vol.\u00a02998, pp. 147\u2013162. Springer, Heidelberg (2004)"},{"key":"7_CR11","unstructured":"Escobar, S., Meseguer, J., Thati, P.: Natural narrowing as a general unified mechanism for programming and proving. Technical Report DSIC-II\/16\/04, DSIC, Universidad Polit\u00e9cnica de Valencia (2004), Available at http:\/\/www.dsic.upv.es\/users\/elp\/papers.html"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32033-3_21","volume-title":"Term Rewriting and Applications","author":"S. Escobar","year":"2005","unstructured":"Escobar, S., Meseguer, J., Thati, P.: Natural narrowing for general term rewriting systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467. Springer, Heidelberg (2005)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Futatsugi, K., Diaconescu, R.: CafeOBJ Report. World Scientific, AMAST Series (1998)","DOI":"10.1142\/3831"},{"issue":"2","key":"7_CR14","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0022-0000(91)90009-T","volume":"42","author":"E. Giovannetti","year":"1991","unstructured":"Giovannetti, E., Levi, G., Moiso, C., Palamidessi, C.: Kernel Leaf: A Logic plus Functional Language. Journal of Computer and System Sciences\u00a042(2), 139\u2013185 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR15","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-1-4757-6541-0_1","volume-title":"Software Engineering with OBJ: Algebraic Specification in Action","author":"J. Goguen","year":"2000","unstructured":"Goguen, J., Winkler, T., Meseguer, J., Futatsugi, K., Jouannaud, J.-P.: Introducing OBJ. In: Software Engineering with OBJ: Algebraic Specification in Action, pp. 3\u2013167. Kluwer, Dordrecht (2000)"},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0743-1066(98)10029-8","volume":"40","author":"J.C. Gonz\u00e1lez-Moreno","year":"1999","unstructured":"Gonz\u00e1lez-Moreno, J.C., Hortal\u00e1-Gonz\u00e1lez, M.T., L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Artalejo, M.: An approach to declarative programming based on a rewriting logic. Journal of Logic Programming\u00a040(1), 47\u201387 (1999)","journal-title":"Journal of Logic Programming"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/jsco.1994.1005","volume":"17","author":"D. Hofbauer","year":"1994","unstructured":"Hofbauer, D., Huber, M.: Linearizing term rewriting systems using test sets. Journal of Symbolic Computation\u00a017, 91\u2013129 (1994)","journal-title":"Journal of Symbolic Computation"},{"key":"7_CR18","first-page":"395","volume-title":"Computational logic: Essays in honour of J. Alan Robinson","author":"G. Huet","year":"1992","unstructured":"Huet, G., L\u00e9vy, J.-J.: Computations in Orthogonal Term Rewriting Systems, Part I + II. In: Computational logic: Essays in honour of J. Alan Robinson, pp. 395\u2013414, 415\u2013443. The MIT Press, Cambridge (1992)"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/3-540-57186-8_79","volume-title":"Programming Language Implementation and Logic Programming","author":"R. Loogen","year":"1993","unstructured":"Loogen, R., L\u00f3pez-Fraguas, F., Rodr\u00edguez-Artalejo, M.: A Demand Driven Computation Strategy for Lazy Narrowing. In: Penjam, J., Bruynooghe, M. (eds.) PLILP 1993. LNCS, vol.\u00a0714, pp. 184\u2013200. Springer, Heidelberg (1993)"},{"issue":"1","key":"7_CR20","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science\u00a096(1), 73\u2013155 (1992)","journal-title":"Theoretical Computer Science"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/263699.263711","volume-title":"Proceedings of the 24th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"A. Middeldorp","year":"1997","unstructured":"Middeldorp, A.: Call by need computations to root-stable form. In: Proceedings of the 24th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 94\u2013105. ACM Press, New York (1997)"},{"key":"7_CR22","volume-title":"The Implementation of Functional Programming Languages","author":"S. Peyton-Jones","year":"1987","unstructured":"Peyton-Jones, S.: The Implementation of Functional Programming Languages. Prentice Hall International, London (1987)"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1006\/jsco.1996.0058","volume":"22","author":"B. Salinier","year":"1996","unstructured":"Salinier, B., Strandh, R.: Efficient simulation of forward-branching systems with constructor systems. Journal of Symbolic Computation\u00a022, 381\u2013399 (1996)","journal-title":"Journal of Symbolic Computation"},{"issue":"1","key":"7_CR24","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1006\/inco.1993.1026","volume":"104","author":"R. Sekar","year":"1993","unstructured":"Sekar, R., Ramakrishnan, I.: Programming in equational logic: Beyond strong sequentiality. Information and Computation\u00a0104(1), 78\u2013109 (1993)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Logic Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11506676_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:03:29Z","timestamp":1605625409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11506676_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540266556","9783540316831"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11506676_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}