{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:07:28Z","timestamp":1725466048960},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370748"},{"type":"electronic","value":"9783642370755"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37075-5_28","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T14:37:23Z","timestamp":1361198243000},"page":"434-449","source":"Crossref","is-referenced-by-count":1,"title":["Generalised Name Abstraction for Nominal Sets"],"prefix":"10.1007","author":[{"given":"Ranald","family":"Clouston","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Cheney, J.: Towards a general theory of names, binding and scope. In: MERLIN, pp. 33\u201340. ACM (2005)","DOI":"10.1145\/1088454.1088459"},{"issue":"3","key":"28_CR2","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1093\/jigpal\/9.3.339","volume":"9","author":"H. Cirstea","year":"2001","unstructured":"Cirstea, H., Kirchner, C.: The rewriting calculus - part I. Log. J. IGPL\u00a09(3), 339\u2013375 (2001)","journal-title":"J. IGPL"},{"key":"28_CR3","unstructured":"Clouston, R.: Equational Logic for Names and Binders. Ph.D. thesis, University of Cambridge (2009)"},{"key":"28_CR4","first-page":"223","volume":"172","author":"R. Clouston","year":"2007","unstructured":"Clouston, R., Pitts, A.M.: Nominal equational logic. ENTCS\u00a0172, 223\u2013257 (2007)","journal-title":"ENTCS"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0060438","volume":"137","author":"B. Day","year":"1970","unstructured":"Day, B.: On closed categories of functors. Lecture Notes in Math.\u00a0137, 1\u201338 (1970)","journal-title":"Lecture Notes in Math."},{"key":"28_CR6","unstructured":"Dowek, G., Gabbay, M.J.: From nominal sets binding to functions and \u03bb-abstraction: connecting the logic of permutation models with the logic of functions, arXiv (2011)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Fiore, M., Hur, C.K.: Term equational systems and logics. In: MFPS. ENTCS, vol.\u00a0218, pp. 171\u2013192 (2008)","DOI":"10.1016\/j.entcs.2008.10.011"},{"key":"28_CR8","unstructured":"Gabbay, M.J.: A Theory of Inductive Definitions with Alpha-Equivalence. Ph.D. thesis, Cambridge University (2001)"},{"key":"28_CR9","unstructured":"Gabbay, M.J.: FM-HOL, a higher-order theory of names. In: 35 Years of Automath (2002)"},{"key":"28_CR10","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 Comput.\u00a013, 341\u2013363 (2002)","journal-title":"Formal Aspects Comput."},{"key":"28_CR11","first-page":"222","volume":"62","author":"B. Jacobs","year":"1997","unstructured":"Jacobs, B., Rutten, J.: A tutorial on (co)algebras and (co)induction. BEATCS\u00a062, 222\u2013259 (1997)","journal-title":"BEATCS"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/11693024_8","volume-title":"Programming Languages and Systems","author":"B. Jay","year":"2006","unstructured":"Jay, B., Kesner, D.: Pure Pattern Calculus. In: Sestoft, P. (ed.) ESOP 2006. LNCS, vol.\u00a03924, pp. 100\u2013114. Springer, Heidelberg (2006)"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1017\/S0956796808007144","volume":"19","author":"B. Jay","year":"2009","unstructured":"Jay, B., Kesner, D.: First-class patterns. J. Funct. Program.\u00a019, 191\u2013225 (2009)","journal-title":"J. Funct. Program."},{"key":"28_CR14","unstructured":"Kelly, G.M.: Basic concepts of enriched category theory, LMS Lecture Note Series, vol.\u00a064. Cambridge University Press (1982)"},{"issue":"5","key":"28_CR15","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1023\/A:1025750816098","volume":"11","author":"M. Menni","year":"2003","unstructured":"Menni, M.: About \u0418-quantifiers. Appl. Categor. Struct.\u00a011(5), 421\u2013445 (2003)","journal-title":"Appl. Categor. Struct."},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-45500-0_11","volume-title":"Theoretical Aspects of Computer Software","author":"A.M. Pitts","year":"2001","unstructured":"Pitts, A.M.: Nominal Logic: A First Order Theory of Names and Binding. In: Kobayashi, N., Babu, C. S. (eds.) TACS 2001. LNCS, vol.\u00a02215, pp. 219\u2013242. Springer, Heidelberg (2001)"},{"key":"28_CR17","unstructured":"Pitts, A.M.: Nominal sets, the metamathematics of names (2011) (unpublished manuscript)"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Pym, D.J.: The Semantics and Proof Theory of the Logic of Buunched Implications. Applied Logic Series, vol.\u00a026. Kluwer Academic Publishers (2002)","DOI":"10.1007\/978-94-017-0091-7"},{"key":"28_CR19","unstructured":"Sch\u00f6pp, U.: Names and Binding in Type Theory. Ph.D. thesis, University of Edinburgh (2006)"},{"key":"28_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-30124-0_20","volume-title":"Computer Science Logic","author":"U. Sch\u00f6pp","year":"2004","unstructured":"Sch\u00f6pp, U., Stark, I.: A Dependent Type Theory with Names and Binding. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.\u00a03210, pp. 235\u2013249. Springer, Heidelberg (2004)"},{"issue":"1","key":"28_CR21","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1017\/S0956796809990293","volume":"20","author":"P. Sewell","year":"2010","unstructured":"Sewell, P., Nardelli, F.Z., Owens, S., Peskine, G., Ridge, T., Sarkar, S., Strnisa, R.: Ott: Effective tool support for the working semanticist. J. Funct. Program.\u00a020(1), 71\u2013122 (2010)","journal-title":"J. Funct. Program."},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Shinwell, M.R., Pitts, A.M., Gabbay, M.J.: FreshML: Programming with binders made simple. In: ICFP. SIGPLAN Notices, vol.\u00a038, pp. 263\u2013274 (2003)","DOI":"10.1145\/944746.944729"},{"key":"28_CR23","unstructured":"Tzevelekos, N.: Nominal Game Semantics. Ph.D. thesis, University of Oxford (2008)"},{"key":"28_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-642-19718-5_25","volume-title":"Programming Languages and Systems","author":"C. Urban","year":"2011","unstructured":"Urban, C., Kaliszyk, C.: General Bindings and Alpha-Equivalence in Nominal Isabelle. In: Barthe, G. (ed.) ESOP 2011. LNCS, vol.\u00a06602, pp. 480\u2013500. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37075-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T04:17:27Z","timestamp":1557548247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37075-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370748","9783642370755"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37075-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}