{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:30:03Z","timestamp":1775097003868,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540255963","type":"print"},{"value":"9783540320333","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-32033-3_17","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T00:20:02Z","timestamp":1285633202000},"page":"219-234","source":"Crossref","is-referenced-by-count":18,"title":["Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics"],"prefix":"10.1007","author":[{"given":"Alex","family":"Simpson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1017\/S0960129502003730","volume":"12","author":"S. Abramsky","year":"2002","unstructured":"Abramsky, S., Haghverdi, E., Scott, P.: Geometry of interaction and linear combinatory algebras. Math. Struct. in Comp. Sci.\u00a012, 625\u2013665 (2002)","journal-title":"Math. Struct. in Comp. Sci."},{"key":"17_CR2","unstructured":"Barber, A.: Linear Type Theories, Semantics and Action Calculi. PhD thesis, Department of Computer Science, University of Edinburgh (1997)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Bierman, G.M., Pitts, A.M., Russo, C.V.: Operational properties of Lily, a polymorphic linear lambda calculus with recursion. Elect. Notes in Theor. Comp. Sci.\u00a041 (2000)","DOI":"10.1016\/S1571-0661(04)80874-0"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/inco.1996.0008","volume":"124","author":"D.J. Howe","year":"1996","unstructured":"Howe, D.J.: Proving congruence of bisimulation in functional programming languages. Inf. and Comp.\u00a0124, 103\u2013112 (1996)","journal-title":"Inf. and Comp."},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Launchbury, J.: A natural semantics for lazy evaluation. In: Proc. 20th POPL, pp. 144\u2013154 (1993)","DOI":"10.1145\/158511.158618"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S0956796800000125","volume":"1","author":"I.A. Mason","year":"1991","unstructured":"Mason, I.A., Talcott, C.L.: Equivalence in functional languages with effects. J. Functional Programming\u00a01, 287\u2013327 (1991)","journal-title":"J. Functional Programming"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1145\/331605.331611","volume":"47","author":"P.W. O\u2019Hearn","year":"2000","unstructured":"O\u2019Hearn, P.W., Reynolds, J.C.: From Algol to polymorphic linear lambdacalculus. Journal of the ACM\u00a047, 167\u2013223 (2000)","journal-title":"Journal of the ACM"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1017\/S0960129500003066","volume":"10","author":"A.M. Pitts","year":"2000","unstructured":"Pitts, A.M.: Parametric polymorphism and operational equivalence. Math. Struct. in Comp. Sci.\u00a010, 321\u2013359 (2000)","journal-title":"Math. Struct. in Comp. Sci."},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"Plotkin, G.D.: Call-by-name, call-by-value and the \u03bb-calculus. Theor. Comp. Sci.\u00a01, 125\u2013159 (1975)","journal-title":"Theor. Comp. Sci."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Plotkin, G.D.: Type theory and recursion. Invited talk at 8th Symposium on Logic in Comp. Sci. (1993)","DOI":"10.1109\/LICS.1993.287571"},{"key":"17_CR11","first-page":"513","volume-title":"Information Processing 1983","author":"J.C. Reynolds","year":"1983","unstructured":"Reynolds, J.C.: Types, abstraction and parametric polymorphism. In: Information Processing 1983, pp. 513\u2013523. North Holland, Amsterdam (1983)"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0167-6423(96)00012-3","volume":"27","author":"J. Seaman","year":"1996","unstructured":"Seaman, J., Iyer, S.P.: An operational semantics of sharing in lazy evaluation. Science of Computer Programming\u00a027, 289\u2013322 (1996)","journal-title":"Science of Computer Programming"},{"key":"17_CR13","first-page":"23","volume":"7","author":"P. Setstoft","year":"1999","unstructured":"Setstoft, P.: Deriving a lazy abstract machine. J. Functional Programming\u00a07, 23\u2013248 (1999)","journal-title":"J. Functional Programming"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-32033-3_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:33:57Z","timestamp":1605760437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-32033-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255963","9783540320333"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-32033-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}