{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:33Z","timestamp":1761611073722,"version":"build-2065373602"},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4064,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["The Journal of Logic and Algebraic Programming"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s1567-8326(02)00020-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:14:15Z","timestamp":1027642455000},"page":"175-192","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":19,"title":["Combining programs and state machines"],"prefix":"10.1016","volume":"51","author":[{"given":"Jan A.","family":"Bergstra","sequence":"first","affiliation":[]},{"given":"Alban","family":"Ponse","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1567-8326(02)00020-6_BIB1","series-title":"Colloquium Capita Datastructuren","first-page":"157","article-title":"Datatypen bezien vanuit de recursietheorie","author":"Bergstra","year":"1978"},{"issue":"1","key":"10.1016\/S1567-8326(02)00020-6_BIB2","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/0020-0190(78)90038-8","article-title":"What is an abstract data type?","volume":"7","author":"Bergstra","year":"1978","journal-title":"Inf. Proc. Lett."},{"issue":"2","key":"10.1016\/S1567-8326(02)00020-6_BIB3","first-page":"143","article-title":"Equational specification of finite minimal unoids, using unary hidden functions only","volume":"5","author":"Bergstra","year":"1982","journal-title":"Fund. Inf."},{"issue":"1","key":"10.1016\/S1567-8326(02)00020-6_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00003928","article-title":"Program algebra for component code","volume":"12","author":"Bergstra","year":"2000","journal-title":"Formal Aspects Comput."},{"key":"10.1016\/S1567-8326(02)00020-6_BIB5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S1567-8326(02)00018-8","article-title":"Program algebra for sequential code","volume":"51","author":"Bergstra","year":"2002","journal-title":"J. Logic Algebr. Programming"},{"issue":"2","key":"10.1016\/S1567-8326(02)00020-6_BIB6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0020-0190(98)00083-0","article-title":"Kleene's three-valued logic and process algebra","volume":"67","author":"Bergstra","year":"1998","journal-title":"Inf. Proc. Lett."},{"issue":"1","key":"10.1016\/S1567-8326(02)00020-6_BIB7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0020-0190(01)00216-2","article-title":"Process algebra and conditional composition","volume":"80","author":"Bergstra","year":"2001","journal-title":"Inf. Proc. Lett."},{"year":"1994","series-title":"Notations for Software Design","author":"Feys","key":"10.1016\/S1567-8326(02)00020-6_BIB8"},{"issue":"8","key":"10.1016\/S1567-8326(02)00020-6_BIB9","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1145\/27651.27653","article-title":"Laws of programming","volume":"30","author":"Hoare","year":"1987","journal-title":"Commun. ACM"}],"container-title":["The Journal of Logic and Algebraic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1567832602000206?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1567832602000206?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T18:33:29Z","timestamp":1761590009000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1567832602000206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S1567832602000206"],"URL":"https:\/\/doi.org\/10.1016\/s1567-8326(02)00020-6","relation":{},"ISSN":["1567-8326"],"issn-type":[{"type":"print","value":"1567-8326"}],"subject":[],"published":{"date-parts":[[2002,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Combining programs and state machines","name":"articletitle","label":"Article Title"},{"value":"The Journal of Logic and Algebraic Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1567-8326(02)00020-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}