乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T19:48:08Z","timestamp":1730317688757,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,10,26]]},"DOI":"10.1145\/2814251.2814266","type":"proceedings-article","created":{"date-parts":[[2020,12,23]],"date-time":"2020-12-23T23:19:10Z","timestamp":1608765550000},"page":"161-166","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["The whiley rewrite language (WyRL)"],"prefix":"10.1145","author":[{"given":"David J.","family":"Pearce","sequence":"first","affiliation":[{"name":"Victoria University of Wellington, New Zealand"}]}],"member":"320","published-online":{"date-parts":[[2015,10,26]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2012.06.003"},{"key":"e_1_3_2_2_2_1","first-page":"362","volume-title":"Proc. RTA","author":"Visser Eelco","year":"2001","unstructured":"Eelco Visser . Stratego : A language for program transformation based on rewriting strategies . In Proc. RTA , pages 357\u2013 362 , 2001 . Eelco Visser. Stratego: A language for program transformation based on rewriting strategies. In Proc. RTA, pages 357\u2013362, 2001."},{"issue":"1","key":"e_1_3_2_2_3_1","first-page":"1","article-title":"Program transformation with scoped dynamic rewrite rules","volume":"69","author":"Bravenboer M.","year":"2006","unstructured":"M. Bravenboer , A. van Dam , K. Olmos , and E. Visser . Program transformation with scoped dynamic rewrite rules . Fundamenta Informaticae , 69 ( 1-2 ): 1 \u2013 56 , Winter 2006 . M. Bravenboer, A. van Dam, K. Olmos, and E. Visser. Program transformation with scoped dynamic rewrite rules. Fundamenta Informaticae, 69(1-2):1\u201356, Winter 2006.","journal-title":"Fundamenta Informaticae"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM.2009.28"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00361-9"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)82536-8"},{"key":"e_1_3_2_2_7_1","volume-title":"editors","author":"van Deursen Arie","year":"1996","unstructured":"Arie van Deursen , Jan Heering , and Paul Klint , editors . Language Prototyping : An Algebraic Specification Approach. AMAST. 1996 . Arie van Deursen, Jan Heering, and Paul Klint, editors. Language Prototyping: An Algebraic Specification Approach. AMAST. 1996."},{"key":"e_1_3_2_2_8_1","volume-title":"Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification. AMAST.","author":"Diaconescu R.","year":"1998","unstructured":"R. Diaconescu and K. Futatsugi . CafeOBJ Report. The Language , Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification. AMAST. 1998 . R. Diaconescu and K. Futatsugi. CafeOBJ Report. The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification. AMAST. 1998."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00358-9"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00359-0"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1759148.1759156"},{"key":"e_1_3_2_2_12_1","first-page":"18","volume-title":"Proc. AMAST","author":"Brand M.","year":"1996","unstructured":"M. Brand , A. Deursen , P. Klint , S. Klusener , and E. Meulen . Industrial applications of ASF+SDF . In Proc. AMAST , pages 9\u2013 18 , 1996 . M. Brand, A. Deursen, P. Klint, S. Klusener, and E. Meulen. Industrial applications of ASF+SDF. In Proc. AMAST, pages 9\u201318, 1996."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066100.1066102"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1770351.1770397"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00768-2_16"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-02654-1_13"},{"key":"e_1_3_2_2_18_1","first-page":"159","volume-title":"Proc. FTSCS","author":"Pearce D. J.","year":"2013","unstructured":"D. J. Pearce and Lindsay Groves . Reflections on verifying software with Whiley . In Proc. FTSCS , pages 142\u2013 159 , 2013 . D. J. Pearce and Lindsay Groves. Reflections on verifying software with Whiley. In Proc. FTSCS, pages 142\u2013159, 2013."},{"key":"e_1_3_2_2_19_1","volume-title":"Types and Programming Languages","author":"Pierce B. C.","year":"2002","unstructured":"B. C. Pierce . Types and Programming Languages . MIT Press , 2002 . B. C. Pierce. Types and Programming Languages. MIT Press, 2002."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(200003)30:3%3C259::AID-SPE298%3E3.0.CO;2-Y"},{"key":"e_1_3_2_2_21_1","volume-title":"Introduction to Automata Theory Languages and Computation","author":"Hopcroft J. E.","year":"1979","unstructured":"J. E. Hopcroft and J. D. Ullman . Introduction to Automata Theory Languages and Computation . Addison-Wesley , 1979 . J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory Languages and Computation. Addison-Wesley, 1979."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0333-9","volume-title":"The Graph Isomorphism Problem: Its Structural Complexity","author":"Kobler J.","year":"1993","unstructured":"J. Kobler , U. Schoning , and J. Toran . The Graph Isomorphism Problem: Its Structural Complexity . Birkhauser , Boston , 1993 . J. Kobler, U. Schoning, and J. Toran. The Graph Isomorphism Problem: Its Structural Complexity. Birkhauser, Boston, 1993."},{"key":"e_1_3_2_2_23_1","first-page":"87","volume-title":"NMC","author":"McKay B.","year":"1981","unstructured":"B. McKay . Practical graph isomorphism . In NMC , pages 45\u2013 87 , 1981 . B. McKay. Practical graph isomorphism. In NMC, pages 45\u201387, 1981."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322198"},{"issue":"7","key":"e_1_3_2_2_25_1","first-page":"816","article-title":"On the church-rosser and coherence properties of conditional order-sorted rewrite theories","volume":"81","author":"Dur\u00e1n F.","year":"2012","unstructured":"F. Dur\u00e1n and J. Meseguer . On the church-rosser and coherence properties of conditional order-sorted rewrite theories . JLAP , 81 ( 7-8 ): 816 \u2013 850 , 2012 . F. Dur\u00e1n and J. Meseguer. On the church-rosser and coherence properties of conditional order-sorted rewrite theories. JLAP, 81(7-8):816\u2013 850, 2012.","journal-title":"JLAP"},{"issue":"11","key":"e_1_3_2_2_26_1","first-page":"1618","article-title":"Introducing the ITP tool: a tutorial","volume":"12","author":"Clavel M.","year":"2006","unstructured":"M. Clavel , M. Palomino , and A. Riesco . Introducing the ITP tool: a tutorial . JUCS , 12 ( 11 ): 1618 \u2013 1650 , 2006 . M. Clavel, M. Palomino, and A. Riesco. Introducing the ITP tool: a tutorial. JUCS, 12(11):1618\u20131650, 2006.","journal-title":"JUCS"},{"key":"e_1_3_2_2_27_1","first-page":"225","volume-title":"Proc. AMAST","author":"Riesco A.","year":"2010","unstructured":"A. Riesco , A. Verdejo , and N. Mart\u00b4\u0131-Oliet . A complete declarative debugger for Maude . In Proc. AMAST , pages 216\u2013 225 , 2010 . A. Riesco, A. Verdejo, and N. Mart\u00b4\u0131-Oliet. A complete declarative debugger for Maude. In Proc. AMAST, pages 216\u2013225, 2010."}],"event":{"name":"SLE '15: Software Language Engineering","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Pittsburgh PA USA","acronym":"SLE '15"},"container-title":["Proceedings of the 2015 ACM SIGPLAN International Conference on Software Language Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2814251.2814266","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T11:33:38Z","timestamp":1673436818000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2814251.2814266"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,26]]},"references-count":27,"alternative-id":["10.1145\/2814251.2814266","10.1145\/2814251"],"URL":"https:\/\/doi.org\/10.1145\/2814251.2814266","relation":{},"subject":[],"published":{"date-parts":[[2015,10,26]]},"assertion":[{"value":"2015-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}