{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:03:57Z","timestamp":1725566637701},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540255963"},{"type":"electronic","value":"9783540320333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-32033-3_7","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T00:20:02Z","timestamp":1285633202000},"page":"74-89","source":"Crossref","is-referenced-by-count":7,"title":["Equivariant Unification"],"prefix":"10.1007","author":[{"given":"James","family":"Cheney","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-540-27775-0_19","volume-title":"Logic Programming","author":"J. Cheney","year":"2004","unstructured":"Cheney, J., Urban, C.: Alpha-Prolog: A logic programming language with names, binding and alpha-equivalence. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol.\u00a03132, pp. 269\u2013283. Springer, Heidelberg (2004)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-27836-8_30","volume-title":"Automata, Languages and Programming","author":"J. Cheney","year":"2004","unstructured":"Cheney, J.: The complexity of equivariant unification. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 332\u2013344. Springer, Heidelberg (2004)"},{"key":"7_CR3","unstructured":"Cheney, J.R.: Nominal Logic Programming. PhD thesis, Cornell University, Ithaca, NY (August 2004)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez, M., Gabbay, M., Mackie, I.: Nominal rewriting systems. In: Proceedings of the 6th Conference on Principles and Practice of Declarative Programming (PPDP 2004) (to appear)","DOI":"10.1145\/1013963.1013978"},{"issue":"1-3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","volume":"37","author":"T. Fr\u00fchwirth","year":"1998","unstructured":"Fr\u00fchwirth, T.: Theory and practice of constraint handling rules. Journal of Logic Programming\u00a037(1-3), 95\u2013138 (1998)","journal-title":"Journal of Logic Programming"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"M.J. Gabbay","year":"2002","unstructured":"Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing\u00a013, 341\u2013363 (2002)","journal-title":"Formal Aspects of Computing"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0890-5401(03)00138-X","volume":"183","author":"A.M. Pitts","year":"2003","unstructured":"Pitts, A.M.: Nominal logic, a first order theory of names and binding. Information and Computation\u00a0183, 165\u2013193 (2003)","journal-title":"Information and Computation"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1145\/944705.944729","volume-title":"Proc. 8th ACM SIGPLAN Int. Conf. on Functional Programming (ICFP 2003)","author":"M.R. Shinwell","year":"2003","unstructured":"Shinwell, M.R., Pitts, A.M., Gabbay, M.J.: FreshML: Programmming with binders made simple. In: Proc. 8th ACM SIGPLAN Int. Conf. on Functional Programming (ICFP 2003), Uppsala, Sweden, pp. 263\u2013274. ACM Press, New York (2003)"},{"key":"7_CR9","series-title":"Progress in Computer Science and Applied Logic","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0435-0","volume-title":"A Proof Theory for General Unification","author":"W. Snyder","year":"1991","unstructured":"Snyder, W.: A Proof Theory for General Unification. Progress in Computer Science and Applied Logic, vol.\u00a011. Birkh\u00e4user, Basel (1991)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Urban, C., Cheney, J.: Avoiding equivariance in alpha-Prolog (2004)","DOI":"10.1007\/11417170_29"},{"issue":"1-3","key":"7_CR11","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/j.tcs.2004.06.016","volume":"323","author":"C. Urban","year":"2004","unstructured":"Urban, C., Pitts, A.M., Gabbay, M.J.: Nominal unification. Theoretical Computer Science\u00a0323(1-3), 473\u2013497 (2004)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-32033-3_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:34:02Z","timestamp":1605760442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-32033-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255963","9783540320333"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-32033-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}