{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:27:16Z","timestamp":1725571636997},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540255932"},{"type":"electronic","value":"9783540320142"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11417170_18","type":"book-chapter","created":{"date-parts":[[2010,12,16]],"date-time":"2010-12-16T19:29:35Z","timestamp":1292527775000},"page":"234-245","source":"Crossref","is-referenced-by-count":0,"title":["The Elimination of Nesting in SPCF"],"prefix":"10.1007","author":[{"given":"J.","family":"Laird","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Asperti, A.: Light affine logic. In: Proceedings of LICS 1998. IEEE press, Los Alamitos (1998)","DOI":"10.1109\/LICS.1998.705666"},{"key":"18_CR2","unstructured":"Bra\u00fcner, T.: An axiomatic approach to adequacy. PhD thesis, BRICS (1996)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Cartwright, R., Felleisen, M.: Observable sequentiality and full abstraction. In: Proceedings of POPL 1992 (1992)","DOI":"10.1145\/143165.143232"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Cartwright, R., Curien, P.-L., Felleisen, M.: Fully abstract semantics for observably sequential languages. Information and Computation (1994)","DOI":"10.1006\/inco.1994.1047"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Curien, P.-L.: On the symmetry of sequentiality. In: Main, M.G., Melton, A.C., Mislove, M.W., Schmidt, D., Brookes, S.D. (eds.) MFPS 1993. LNCS, vol.\u00a0802. Springer, Heidelberg (1994)","DOI":"10.1007\/3-540-58027-1_2"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(92)90386-T","volume":"97","author":"A. Scedrov","year":"1992","unstructured":"Scedrov, A., Girard, J.-Y., Scott, P.: Bounded linear logic: A modular approach to polynomial-time computability. Theoretical Computer Science\u00a097, 1\u201366 (1992)","journal-title":"Theoretical Computer Science"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Lafont, Y.: Soft linear logic and polynomial time. Theoretical Computer Science (2004) (to appear)","DOI":"10.1016\/j.tcs.2003.10.018"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-45220-1_30","volume-title":"Computer Science Logic","author":"J. Laird","year":"2003","unstructured":"Laird, J.: Bistability: an extensional characterization of sequentiality. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 372\u2013383. Springer, Heidelberg (2003)"},{"key":"18_CR9","unstructured":"Laird, J.: Bistability: A sequential domain theory (2004), Available from http:\/\/www.cogs.susx.ac.uk\/users\/jiml"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Laird, J.: Locally boolean domains. To appear in Theoretical Computer Science (2005)","DOI":"10.1016\/j.tcs.2005.06.007"},{"key":"18_CR11","unstructured":"Longley, J.: The sequentially realizable functionals. Annals of Pure and Applied Logic (1998)"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"J.\u00a0Longley. Universal types and what they are good for. In Domain Theory, Logic and Computation: Proceedings of the 2 nd International Symposium on Domain Theory. Kluwer, 2004.","DOI":"10.1007\/978-94-017-1291-0_2"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Reynolds, J.: Syntactic control of interference. In: Conf. Record 5 th ACM Symposium on Principles of Programming Languages, pp. 39\u201346 (1978)","DOI":"10.1145\/512760.512766"},{"key":"18_CR14","unstructured":"Riecke, J.G.: The Logic and Expressibility of Simply-Typed Call-by-Value and Lazy Languages. PhD thesis, Massachusetts Institute of Technology, Available as technical report MIT\/LCS\/TR-523 (MIT Laboratory for Computer Science) (1991)"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11417170_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:51:53Z","timestamp":1605642713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11417170_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255932","9783540320142"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11417170_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}