{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:49:58Z","timestamp":1743029398055,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540402534"},{"type":"electronic","value":"9783540448808"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44880-2_14","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T16:12:53Z","timestamp":1183479173000},"page":"197-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Expression Transformers in B-GSL"],"prefix":"10.1007","author":[{"given":"Bill","family":"Stoddart","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Zeyda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,27]]},"reference":[{"key":"14_CR1","unstructured":"Jean-Raymond Abrial. The B Book. Cambridge University Press, 1996."},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/0020-0190(81)90071-5","volume":"12.1","author":"E. C. R. Hehner","year":"1981","unstructured":"E C R Hehner. Bunch theory: A simple set theory for computer science. Information Processing Letters, 12.1 pp26\u201331, 1981.","journal-title":"Information Processing Letters"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"E C R Hehner. A Practical Theory of Programming. Springer Verlag, 1993.","DOI":"10.1007\/978-1-4419-8596-5"},{"key":"14_CR4","unstructured":"http:\/\/www.haskell.org. Haskell98, a non-strict purely functional language. Technical report, 1998."},{"key":"14_CR5","unstructured":"J M Lucassen. Types and Effects, towards the integration of functional and imperitive programming. PhD thesis, MIT laboratory for computer science, 1987."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"E Moggi. Notions of Computation and Monads. Information and Computation 93(1), 1991.","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"J Morris and A Bunkenburg. A theory of bunches. Acta Informatica, 37(8).","DOI":"10.1007\/PL00013316"},{"key":"14_CR8","volume-title":"Presented at the 5th Irish Formal Methods Workshop","author":"J. M. Morris","year":"2001","unstructured":"J M Morris. An easy route from functional to imperative programming. Presented at the 5th Irish Formal Methods Workshop, Trinity College, Dublin, July 2001."},{"key":"14_CR9","unstructured":"J M Morris and A Bunkenburg. Term transformer semantics. Submitted to ACM Transactions on Programming Languages and Systems, 1999."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Greg Nelson. A Generalization of Dijkstra\u2019s Calculus. ACM Transactions on Programming Languages and Systems, Vol 11, No. 4, 1989.","DOI":"10.1145\/69558.69559"},{"key":"14_CR11","series-title":"Lect Notes Comput Sci","volume-title":"ZB2000","author":"W. J. Stoddart","year":"2000","unstructured":"W J Stoddart. An Execution Architecture for B-GSL. In Bowen J and Dunne S E, editors, ZB2000, Lecture Notes in Computer Science, no 1878, 2000."},{"key":"14_CR12","unstructured":"W J Stoddart. Efficient reversibility with guards and choice. In M A Ertl, editor, 18th EuroForth, 2002. Available from: http:\/\/www.complang.tuwien.ac.at\/anton\/euroforth2002\/papers\/bill.rev.ps.gz."},{"key":"14_CR13","unstructured":"W J Stoddart and F Zeyda. Implementing sets for reversible computation. In M A Ertl, editor, 18th EuroForth, 2002. Available from: http:\/\/www.complang.tuwien.ac.at\/anton\/euroforth2002\/papers\/bill.sets.ps.gz."},{"key":"14_CR14","series-title":"Lect Notes Comput Sci","volume-title":"Advanced Functional Programming","author":"P. Wadler","year":"1995","unstructured":"P Wadler. Monads for functional programming. In J Jeuring and E Meijer, editors, Advanced Functional Programming, Lecture notes in Computer Science, no 925, 1995."}],"container-title":["Lecture Notes in Computer Science","ZB 2003: Formal Specification and Development in Z and B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44880-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T01:57:24Z","timestamp":1676685444000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-44880-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540402534","9783540448808"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44880-2_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"27 May 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}