{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:11:15Z","timestamp":1767928275981,"version":"3.49.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540565175","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0037119","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T10:21:36Z","timestamp":1138184496000},"page":"376-390","source":"Crossref","is-referenced-by-count":7,"title":["Call-by-value and nondeterminism"],"prefix":"10.1007","author":[{"given":"Kurt","family":"Sieber","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"26_CR1","first-page":"323","volume":"14","author":"E. Astesiano","year":"1980","unstructured":"E. Astesiano and G. Costa. Nondeterminism and fully abstract models. RAIRO, 14(4):323\u2013347, 1980.","journal-title":"RAIRO"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"C. A. Gunter. Relating total and partial correctness interpretations of non-deterministic programs. In 17th\nAnnual ACM Symposium on Principles of Programming Languages, pages 306\u2013319, 1990.","DOI":"10.1145\/96709.96741"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"C. A. Gunter and D. S. Scott. Semantic domains. In J. van Leeuven, editor, Handbook of Theoretical Computer Science, chapter 12, pages 635\u2013674. Elsevier Science Publishers, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50017-2"},{"key":"26_CR4","volume-title":"PhD thesis","author":"R. Heckmann","year":"1990","unstructured":"R. Heckmann. Power Domain Constructions. PhD thesis, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, 1990."},{"key":"26_CR5","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1991","unstructured":"E. Moggi. Notions of computation and monads. Information and Computation, 93:55\u201392, 1991.","journal-title":"Information and Computation"},{"key":"26_CR6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G. D. Plotkin","year":"1975","unstructured":"G. D. Plotkin. Call-by-name, call-by-value and the \u03bb-calculus. Theoretical Computer Science, 1:125\u2013159, 1975.","journal-title":"Theoretical Computer Science"},{"key":"26_CR7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G. D. Plotkin","year":"1977","unstructured":"G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223\u2013256, 1977.","journal-title":"Theoretical Computer Science"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"K. Sieber. Relating full abstraction results for different programming languages. In K. Nori and C. V. Madhavan, editors, 10th\nConference on Foundations of Software Technology and Theoretical Computer Science, Springer LNCS 472, pages 373\u2013387, Bangalore, India, 1990.","DOI":"10.1007\/3-540-53487-3_58"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0037119.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T17:22:09Z","timestamp":1607534529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0037119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540565175"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0037119","relation":{},"subject":[]}}