{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T08:09:25Z","timestamp":1649146165716},"reference-count":15,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.42.4","type":"journal-article","created":{"date-parts":[[2010,12,21]],"date-time":"2010-12-21T07:02:04Z","timestamp":1292914924000},"page":"39-53","source":"Crossref","is-referenced-by-count":1,"title":["Towards Correctness of Program Transformations Through Unification and Critical Pair Computation"],"prefix":"10.4204","volume":"42","author":[{"given":"Conrad","family":"Rau","sequence":"first","affiliation":[]},{"given":"Manfred","family":"Schmidt-Schau\u00df","sequence":"additional","affiliation":[]}],"member":"2720","published-online":{"date-parts":[[2010,12,21]]},"reference":[{"issue":"3","key":"ariola:97","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1017\/S0956796897002724","article-title":"The call-by-need lambda calculus","volume":"7","author":"Zena M. Ariola","year":"1997","journal-title":"J. Funct. Program."},{"key":"baaderschulz:92-short","series-title":"LNCS","first-page":"50","article-title":"Unification in the union of disjoint equational theories: Combining decision procedures","volume-title":"Proc. of 11th CADE","volume":"607","author":"Franz Baader","year":"1992"},{"key":"baadersnyder:2001","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/B978-044450813-3\/50010-2","article-title":"Unification Theory","volume-title":"Handbook of Automated Reasoning","author":"Franz Baader","year":"2001"},{"key":"dantsin-voronkov:99","series-title":"LNCS","first-page":"180","article-title":"A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees","volume-title":"Proc. of 2nd FoSSaCS","volume":"1578","author":"Evgeny Dantsin","year":"1999"},{"issue":"6","key":"dovier-pontelli:06","first-page":"645","article-title":"Set unification","volume":"6","author":"Agostino Dovier","year":"2006","journal-title":"TPLP"},{"issue":"2","key":"felleisen-hieb:92","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0304-3975(92)90014-7","article-title":"The Revised Report on the Syntactic Theories of Sequential Control and State","volume":"103","author":"Matthias Felleisen","year":"1992","journal-title":"Theor. Comput. Sci."},{"key":"howe:89","first-page":"198","article-title":"Equality In Lazy Computation Systems","volume-title":"Proc. of 4th LICS","author":"Douglas J. Howe","year":"1989"},{"key":"Knuth-Bendix:70","first-page":"263","article-title":"Simple word problems in universal algebra","volume-title":"Computational problems in abstract algebra","author":"D. E. Knuth","year":"1970"},{"issue":"1","key":"milner:77","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","article-title":"Fully abstract models of typed lambda-calculi","volume":"4","author":"Robin Milner","year":"1977","journal-title":"Theor. Comput. Sci."},{"issue":"41","key":"rau-schmidt-schauss-IB41:10","volume-title":"Towards Correctness of Program Transformations Through Unification and Critical Pair Computation","author":"Conrad Rau","year":"2010"},{"key":"msscomb:89","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0747-7171(89)80022-7","article-title":"Unification in a Combination of Arbitrary Disjoint Equational Theories","volume":"8","author":"Manfred Schmidt-Schau\u00df","year":"1989","journal-title":"J. Symb. Comput."},{"key":"schmidt-schauss-copy-rta:07","series-title":"LNCS","first-page":"329","article-title":"Correctness of Copy in Calculi with Letrec","volume-title":"Proc. of 18th RTA","volume":"4533","author":"Manfred Schmidt-Schau\u00df","year":"2007"},{"key":"schmidt-schauss-sabel:09","doi-asserted-by":"crossref","first-page":"1521","DOI":"10.1016\/j.tcs.2009.12.001","article-title":"On generic context lemmas for higher-order calculi with sharing","volume":"411","author":"Manfred Schmidt-Schau\u00df","year":"2010","journal-title":"Theor. Comput. Sci."},{"key":"schmidt-schauss-sabel-machkasova-rta:10","series-title":"LIPIcs","first-page":"295","article-title":"Simulation in the Call-by-Need Lambda-Calculus with letrec","volume-title":"Proc. of 21th RTA","volume":"6","author":"Manfred Schmidt-Schau\u00df","year":"2010"},{"issue":"4","key":"schmidt-schauss-schuetz-sabel:08","first-page":"503","article-title":"Safety of N\u00f6cker's strictness analysis","volume":"18","author":"Manfred Schmidt-Schau\u00df","year":"2008","journal-title":"J. Funct. Program."}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,3,6]],"date-time":"2019-03-06T21:34:46Z","timestamp":1551908086000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/1012.4893v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,21]]},"references-count":15,"URL":"https:\/\/doi.org\/10.4204\/eptcs.42.4","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,21]]}}}