{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:16:42Z","timestamp":1725574602503},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253884"},{"type":"electronic","value":"9783540319825"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31982-5_24","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T07:29:02Z","timestamp":1294990142000},"page":"379-394","source":"Crossref","is-referenced-by-count":15,"title":["A Simpler Proof Theory for Nominal Logic"],"prefix":"10.1007","author":[{"given":"James","family":"Cheney","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"24_CR1","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/j.tcs.2003.10.041","volume":"322","author":"L. Caires","year":"2004","unstructured":"Caires, L., Cardelli, L.: A spatial logic for concurrency\u2013II. Theoretical Computer Science\u00a0322(3), 517\u2013565 (2004)","journal-title":"Theoretical Computer Science"},{"key":"24_CR2","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":"24_CR3","doi-asserted-by":"crossref","unstructured":"Cheney, J.: A simpler proof theory for nominal logic. Technical Report EDI-INF-RR-0237, LFCS, University of Edinburgh (November 2004)","DOI":"10.1007\/978-3-540-31982-5_24"},{"key":"24_CR4","unstructured":"Cheney, J.: A sound and complete translation of generic judgments into nominal logic. Technical report, LFCS, University of Edinburgh (in preparation) (2005)"},{"key":"24_CR5","unstructured":"Cheney, J.R.: Nominal Logic Programming. PhD thesis, Cornell University, Ithaca, NY (August. 2004)"},{"key":"24_CR6","unstructured":"Gabbay, M.J.: Fresh logic: A logic of FM (2003) (submitted)"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Gabbay, M.J., Cheney, J.: A proof theory for nominal logic. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004), Turku, Finland, pp. 139\u2013148 (2004)","DOI":"10.1109\/LICS.2004.1319608"},{"key":"24_CR8","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":"24_CR9","first-page":"118","volume-title":"Proc. 18th Symp. on Logic in Computer Science (LICS 2003)","author":"D. Miller","year":"2003","unstructured":"Miller, D., Tiu, A.: A proof theory for generic judgments: extended abstract. In: Proc. 18th Symp. on Logic in Computer Science (LICS 2003), pp. 118\u2013127. IEEE Press, Los Alamitos (2003)"},{"key":"24_CR10","first-page":"206","volume-title":"Proc. 8th ACM SIGPLAN Int. Conf. on Functional Programming","author":"A. Nanevski","year":"2002","unstructured":"Nanevski, A.: Meta-programming with names and necessity. In: Proc. 8th ACM SIGPLAN Int. Conf. on Functional Programming, pp. 206\u2013217. ACM Press, New York (2002)"},{"key":"24_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511527340","volume-title":"Structural Proof Theory","author":"S. Negri","year":"2001","unstructured":"Negri, S., van Plato, J.: Structural Proof Theory. Cambridge University Press, Cambridge (2001)"},{"key":"24_CR12","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":"24_CR13","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\u20133","key":"24_CR14","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\u20133), 473\u2013497 (2004)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31982-5_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T11:08:25Z","timestamp":1637147305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31982-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253884","9783540319825"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31982-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}