{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:47:53Z","timestamp":1725468473715},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648277"},{"type":"electronic","value":"9783540685326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055783","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T13:36:31Z","timestamp":1155821791000},"page":"336-345","source":"Crossref","is-referenced-by-count":11,"title":["A computational interpretation of the \u03bb\u039c-calculus"],"prefix":"10.1007","author":[{"given":"G. M.","family":"Bierman","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"G.M. Bierman. A classical linear \u03bb-calculus. Technical Report 401, Cambridge Computer Laboratory 1996.","DOI":"10.1016\/S1571-0661(05)80399-8"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"M. Felleisen. The theory and practice of first-class prompts. POPL 1988.","DOI":"10.1145\/73560.73576"},{"key":"30_CR3","unstructured":"A.D. Gordon. Bisimilarity as a theory of functional programming: Mini-course. Technical Report NS-95-2, BRICS, Department of Computer Science, University of \u00e5rhus, July 1995."},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"T.G. Griffin. A formulae-as-types notion of control. POPL 1990.","DOI":"10.1145\/96709.96714"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"C.A. Gunter, D. R\u00e9my, and J.G. Riecke. A generalisation of exceptions and control in ML-like languages. FPCA 1995.","DOI":"10.1145\/224164.224173"},{"key":"30_CR6","unstructured":"R. Harper and C. Stone. An interpretation of Standard ML in type theory. Technical Report CMU-CS-97-147, School of Computer Science, Carnegie Mellon University, June 1997."},{"key":"30_CR7","unstructured":"M. Hofmann and T. Streicher. Continuation models are universal for \u03bb\u039c-calculus. LICS 1997."},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"C.-H.L. Ong and C.A. Stewart. A Curry-Howard foundation for functional computation with control. POPL 1997.","DOI":"10.1145\/263699.263722"},{"key":"30_CR9","unstructured":"M. Parigot. \u03bb\u039c-calculus: an algorithmic interpretation of classical natural deduction. LPAR 1992. LNCS 624."},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"A.M. Pitts. Operational semantics for program equivalence. Slides from talk given at MFPS, 1997.","DOI":"10.1017\/CBO9780511526619.007"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"A.M. Pitts. Operationally-based theories of program equivalence. In Semantics and Logics of Computation, CUP, 1997.","DOI":"10.1017\/CBO9780511526619.007"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055783","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T19:03:37Z","timestamp":1587150217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055783"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0055783","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}