{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T08:02:29Z","timestamp":1750492949698},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408017"},{"type":"electronic","value":"9783540452201"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45220-1_48","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T23:33:58Z","timestamp":1277508838000},"page":"575-588","source":"Crossref","is-referenced-by-count":4,"title":["Logical Relations for Dynamic Name Creation"],"prefix":"10.1007","author":[{"given":"Yu","family":"Zhang","sequence":"first","affiliation":[]},{"given":"David","family":"Nowak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1\u20132","key":"48_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(94)00283-O","volume":"146","author":"M. Alimohamed","year":"1995","unstructured":"Alimohamed, M.: A characterization of lambda definability in categorical models of implicit polymorphism. Theoretical Computer Science\u00a0146(1\u20132), 5\u201323 (1995)","journal-title":"Theoretical Computer Science"},{"key":"48_CR2","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BFb0083084","volume-title":"Seminar on Triples and Categorical Homology Theory","author":"J. Beck","year":"1969","unstructured":"Beck, J.: Distributive laws. In: Seminar on Triples and Categorical Homology Theory. Lecture Notes in Mathematics, vol.\u00a080, pp. 119\u2013140. Springer, Heidelberg (1969)"},{"key":"48_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/3-540-45793-3_37","volume-title":"Computer Science Logic","author":"J. Goubault-Larrecq","year":"2002","unstructured":"Goubault-Larrecq, J., Lasota, S., Nowak, D.: Logical relations for monadic types. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, pp. 553\u2013568. Springer, Heidelberg (2002)"},{"key":"48_CR4","series-title":"Cambridge studies in advanced mathematics","volume-title":"Introduction to Higher Order Categorical Logic","author":"J. Lambek","year":"1986","unstructured":"Lambek, J., Scott, P.J.: Introduction to Higher Order Categorical Logic. Cambridge studies in advanced mathematics. Cambridge University Press, Cambridge (1986)"},{"key":"48_CR5","volume-title":"Foundations of Programming Languages","author":"J.C. Mitchell","year":"1996","unstructured":"Mitchell, J.C.: Foundations of Programming Languages. MIT Press, Cambridge (1996)"},{"key":"48_CR6","first-page":"303","volume-title":"LICS 1987","author":"J.C. Mitchell","year":"1987","unstructured":"Mitchell, J.C., Moggi, E.: Kripke-style models for typed lambda calculus. In: LICS 1987, pp. 303\u2013314. IEEE Computer Society Press, Los Alamitos (1987)"},{"key":"48_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/3-540-56992-8_21","volume-title":"Computer Science Logic","author":"J.C. Mitchell","year":"1993","unstructured":"Mitchell, J.C., Scedrov, A.: Notes on sconing and relators. In: Martini, S., B\u00f6rger, E., Kleine B\u00fcning, H., J\u00e4ger, G., Richter, M.M. (eds.) CSL 1992. LNCS, vol.\u00a0702, pp. 352\u2013378. Springer, Heidelberg (1993)"},{"key":"48_CR8","first-page":"14","volume-title":"LICS 1989","author":"E. Moggi","year":"1989","unstructured":"Moggi, E.: Computational lambda-calculus and monads. In: LICS 1989, pp. 14\u201323. IEEE Computer Society Press, Los Alamitos (1989)"},{"unstructured":"Moggi, E.: An abstract view of programming languages. Technical Report ECS-LFCS-90-113, LFCS, Department of Computer Science, University of Edinburgh (1990)","key":"48_CR9"},{"key":"48_CR10","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computation and monads. Information and Computation\u00a093, 55\u201392 (1991)","journal-title":"Information and Computation"},{"key":"48_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/3-540-57182-5_8","volume-title":"Mathematical Foundations of Computer Science 1993","author":"A. Pitts","year":"1993","unstructured":"Pitts, A., Stark, I.: Observable properties of higher order functions that dynamically create local names, or: What\u2019s new? In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711, pp. 122\u2013141. Springer, Heidelberg (1993)"},{"unstructured":"Stark, I.: Names and Higher-Order Functions. PhD thesis, University of Cambridge (1994)","key":"48_CR12"},{"issue":"1","key":"48_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01806033","volume":"9","author":"I. Stark","year":"1996","unstructured":"Stark, I.: Categorical models for local names. Lisp and Symbolic Computation\u00a09(1), 77\u2013107 (1996)","journal-title":"Lisp and Symbolic Computation"},{"issue":"4","key":"48_CR14","doi-asserted-by":"crossref","first-page":"369","DOI":"10.3233\/FI-1998-33403","volume":"33","author":"I. Stark","year":"1998","unstructured":"Stark, I.: Names, equations, relations: Practical ways to reason about new. Fundamenta Informaticae\u00a033(4), 369\u2013396 (1998)","journal-title":"Fundamenta Informaticae"},{"key":"48_CR15","first-page":"256","volume-title":"CSFW 2001","author":"E. Sumii","year":"2001","unstructured":"Sumii, E., Pierce, B.: Logical relations for encryption. In: CSFW 2001, pp. 256\u2013272. IEEE Computer Society Press, Los Alamitos (2001)"},{"unstructured":"Zhang, Y.: Logical relations for names. Master\u2019s thesis, University of Paris 7 (2002), http:\/\/www.lsv.ens-cachan.fr\/Publis\/PAPERS\/ZY-dea02.ps","key":"48_CR16"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45220-1_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T05:00:16Z","timestamp":1591419616000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45220-1_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408017","9783540452201"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45220-1_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}