{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:50:48Z","timestamp":1743069048291,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642176845"},{"type":"electronic","value":"9783642176852"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17685-2_5","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T06:19:35Z","timestamp":1291616375000},"page":"146-182","source":"Crossref","is-referenced-by-count":0,"title":["Non-monadic Models of Mutable References"],"prefix":"10.1007","author":[{"given":"P\u00e9ter","family":"Divi\u00e1nszky","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"The Clean compiler sources, http:\/\/clean.cs.ru.nl\/Download\/download.html"},{"key":"5_CR2","unstructured":"The Haskell Adaptive package, http:\/\/hackage.haskell.org\/package\/Adaptive"},{"key":"5_CR3","unstructured":"The Haskell ArrayRef package, http:\/\/hackage.haskell.org\/package\/ArrayRef"},{"key":"5_CR4","unstructured":"The Haskell base package, http:\/\/hackage.haskell.org\/package\/base"},{"key":"5_CR5","unstructured":"The Haskell stateref package, http:\/\/hackage.haskell.org\/package\/stateref"},{"issue":"6","key":"5_CR6","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1017\/S0960129500070109","volume":"6","author":"E. Barendsen","year":"1996","unstructured":"Barendsen, E., Smetsers, S.: Uniqueness typing for functional languages with graph rewriting semantics. Mathematical Structures in Computer Science\u00a06(6), 579\u2013612 (1996)","journal-title":"Mathematical Structures in Computer Science"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-540-85373-2_12","volume-title":"Implementation and Application of Functional Languages","author":"E. Vries de","year":"2008","unstructured":"de Vries, E., Plasmeijer, R., Abrahamson, D.M.: Uniqueness typing simplified. In: Chitil, O., Horv\u00e1th, Z., Zs\u00f3k, V. (eds.) IFL 2007. LNCS, vol.\u00a05083, pp. 201\u2013218. Springer, Heidelberg (2008)"},{"issue":"9","key":"5_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/1016848.1016867","volume":"39","author":"M. Fluet","year":"2004","unstructured":"Fluet, M., Morrisett, G.: Monadic regions. SIGPLAN Not.\u00a039(9), 103\u2013114 (2004)","journal-title":"SIGPLAN Not."},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-46425-5_15","volume-title":"Programming Languages and Systems","author":"M.P. Jones","year":"2000","unstructured":"Jones, M.P.: Type classes with functional dependencies. In: Smolka, G. (ed.) ESOP 2000. LNCS, vol.\u00a01782, pp. 230\u2013244. Springer, Heidelberg (2000)"},{"key":"5_CR10","unstructured":"Jones, S.P.: Tackling the awkward squad: monadic input\/output, concurrency, exceptions, and foreign-language calls in haskell"},{"issue":"6","key":"5_CR11","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/773473.178246","volume":"29","author":"J. Launchbury","year":"1994","unstructured":"Launchbury, J., Jones, S.L.P.: Lazy functional state threads. SIGPLAN Not.\u00a029(6), 24\u201335 (1994)","journal-title":"SIGPLAN Not."},{"key":"5_CR12","unstructured":"Lippmeier, B.: Type inference and optimisation for an impure world. PhD thesis, Australian National University (2009)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"L\u00e4ufer, K., Odersky, M.: Polymorphic type inference and abstract data types. ACM Transactions on Programming Languages and Systems\u00a016 (1994)","DOI":"10.1145\/186025.186031"},{"key":"5_CR14","unstructured":"Jones, S.P., et al.: The Haskell 98 language and libraries: The revised report. Journal of Functional Programming\u00a013(1),0-255 (2003), http:\/\/www.haskell.org\/definition\/"},{"key":"5_CR15","unstructured":"Jones, S.P., Hughes, J., et al.: Report on the Programming Language Haskell 98, A Non-strict, Purely Functional Language (February 1999)"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1145\/1291220.1291174","volume":"42","author":"R. Plasmeijer","year":"2007","unstructured":"Plasmeijer, R., Achten, P., Koopman, P.: itasks: executable specifications of interactive work flow systems for the web. SIGPLAN Not.\u00a042, 141\u2013152 (2007)","journal-title":"SIGPLAN Not."},{"key":"5_CR17","unstructured":"Plasmeijer, R., van Eekelen, M.: Concurrent Clean Version 2.0 Language Report (2001)"},{"key":"5_CR18","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/1411204.1411215","volume-title":"Proceeding of the 13th ACM SIGPLAN international conference on Functional programming, ICFP 2008","author":"T. Schrijvers","year":"2008","unstructured":"Schrijvers, T., Jones, S.P., Chakravarty, M., Sulzmann, M.: Type checking with open type functions. In: ICFP 2008: Proceeding of the 13th ACM SIGPLAN international conference on Functional programming, , pp. 51\u201362. ACM, New York (2008)"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/1291201.1291206","volume-title":"Proceedings of the ACM SIGPLAN workshop on Haskell workshop, Haskell 2007","author":"W. Swierstra","year":"2007","unstructured":"Swierstra, W., Altenkirch, T.: Beauty in the beast: A functional semantics for the awkward squad. In:Haskell 2007: Proceedings of the ACM SIGPLAN workshop on Haskell workshop, pp. 25\u201336. ACM, New York (2007)"},{"issue":"3","key":"5_CR20","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1145\/262009.262011","volume":"29","author":"P. Wadler","year":"1997","unstructured":"Wadler, P.: How to declare an imperative. ACM Comput. Surv.\u00a029(3), 240\u2013263 (1997)","journal-title":"ACM Comput. Surv."}],"container-title":["Lecture Notes in Computer Science","Central European Functional Programming School"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17685-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,14]],"date-time":"2021-11-14T18:57:52Z","timestamp":1636916272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17685-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642176845","9783642176852"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17685-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}