{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:28:02Z","timestamp":1720625282016},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3406,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1016\/s1571-0661(05)82529-0","type":"journal-article","created":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T09:46:30Z","timestamp":1116495990000},"page":"70-89","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["Correct and Complete (Positive) Strategy Annotations for OBJ"],"prefix":"10.1016","volume":"71","author":[{"given":"Mar\u00eda","family":"Alpuente","sequence":"first","affiliation":[]},{"given":"Santiago","family":"Escobar","sequence":"additional","affiliation":[]},{"given":"Salvador","family":"Lucas","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)82529-0_BIB1","series-title":"Term Rewriting and All That","author":"Baader","year":"1998"},{"key":"10.1016\/S1571-0661(05)82529-0_BIB2","first-page":"314","article-title":"Recursive Path Orderings can be Context-Sensitive","volume":"2392","author":"Borralleras","year":"2002"},{"key":"10.1016\/S1571-0661(05)82529-0_BIB3","article-title":"Principles of Maude","volume":"4","author":"Clavel","year":"1996"},{"key":"10.1016\/S1571-0661(05)82529-0_BIB4","article-title":"Term Rewriting with Operator Evaluation Strategies","volume":"15","author":"Eker","year":"1998"},{"key":"10.1016\/S1571-0661(05)82529-0_BIB5","article-title":"Induction for termination with local strategies","volume":"58","author":"Fissore","year":"2001"},{"key":"10.1016\/S1571-0661(05)82529-0_BIB6","series-title":"Conference Record of the 12th Annual ACM Symposium on Principles of Programming Languages, POPL\u203285","first-page":"52","article-title":"Principles of OBJ2","author":"Futatsugi","year":"1985"},{"key":"10.1016\/S1571-0661(05)82529-0_BIB7","doi-asserted-by":"crossref","unstructured":"K. Futatsugi, A. Nakagawa. An Overview of CAFE Specification Environment \u2013 An algebraic approach for creating, verifying, and maintaining formal specification over networks -. In Proc. of 1st International Conference on Formal Engineering Methods, 1997.","DOI":"10.1109\/ICFEM.1997.630424"},{"key":"10.1016\/S1571-0661(05)82529-0_BIB8","series-title":"Software Engineering with OBJ: algebraic specification in action","article-title":"Introducing OBJ","author":"Goguen","year":"2000"},{"key":"10.1016\/S1571-0661(05)82529-0_BIB9","first-page":"1","article-title":"Context-sensitive computations in functional and functional logic programs","volume":"1","author":"Lucas","year":"1998"},{"key":"10.1016\/S1571-0661(05)82529-0_BIB10","doi-asserted-by":"crossref","unstructured":"S. Lucas. Context-sensitive rewriting strategies. Information and Computation, Academic Press, to appear.","DOI":"10.1016\/S0890-5401(02)93176-7"},{"key":"10.1016\/S1571-0661(05)82529-0_BIB11","unstructured":"S. Lucas. Rewriting with replacement restrictions. PhD Thesis, DSIC, Universidad Polit\u00e9cnica de Valencia, in spanish, October 1998."},{"key":"10.1016\/S1571-0661(05)82529-0_BIB12","series-title":"Proc. 13th International Conference on Rewriting Techniques and Applications (RTA\u203202)","first-page":"296","article-title":"Termination of (Canonical) Context-Sensitive Rewriting","author":"Lucas","year":"2002"},{"key":"10.1016\/S1571-0661(05)82529-0_BIB13","series-title":"Proc. of 3rd International Conference on Principles and Practice of Declarative Programming, PPDP\u203201","first-page":"82","article-title":"Termination of on-demand rewriting and termination of OBJ programs","author":"Lucas","year":"2001"},{"key":"10.1016\/S1571-0661(05)82529-0_BIB14","series-title":"Proc. of 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR\u203201, L0NAI 2250","first-page":"669","article-title":"Termination of Rewriting With Strategy Annotations","author":"Lucas","year":"2001"},{"key":"10.1016\/S1571-0661(05)82529-0_BIB15","series-title":"Proc. of 12th International Conference on Rewriting Techniques and Applications, RTA\u203201, LNCS 2051","first-page":"216","article-title":"Transfinite Rewriting Semantics for Term Rewriting Systems","author":"Lucas","year":"2001"},{"key":"10.1016\/S1571-0661(05)82529-0_BIB16","series-title":"Proc of 9th International Symposium on Programming Languages, Implementations, Logics and Programs, PLILP\u203297, LNCS 1292","first-page":"127","article-title":"Transformations for Efficient Evaluations in Functional Programming","author":"Lucas","year":"1997"},{"key":"10.1016\/S1571-0661(05)82529-0_BIB17","unstructured":"T. Nagaya. Reduction Strategies for Term Rewriting Systems. PhD Thesis, School of Information Science, Japan Advanced Institute of Science and Technology, March 1999."},{"key":"10.1016\/S1571-0661(05)82529-0_BIB18","series-title":"Proc. of 1th International Workshop on Rewriting y Proof and Computation, RPC\u203201","first-page":"80","article-title":"Completeness and strictness analysis for the evaluation strategy","author":"Nakamura","year":"2001"},{"key":"10.1016\/S1571-0661(05)82529-0_BIB19","article-title":"The evaluation strategy for head normal form with and without on-demand flags","volume":"36","author":"Nakamura","year":"2001"},{"key":"10.1016\/S1571-0661(05)82529-0_BIB20","series-title":"Proc of 9th International Symposium on Programming Languages, Implementations, Logics and Programs, PLILP\u203297, LNCS 1292","first-page":"225","article-title":"Implementation of Term Rewritings with the Evaluation Strategy","author":"Ogata","year":"1997"},{"key":"10.1016\/S1571-0661(05)82529-0_BIB21","article-title":"Just-in-time: on Strategy Annotations","volume":"57","author":"van de Pol","year":"2001"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825290?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825290?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T05:57:57Z","timestamp":1548482277000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105825290"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":21,"alternative-id":["S1571066105825290"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)82529-0","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}