{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:11Z","timestamp":1761611171543},"publisher-location":"Berlin\/Heidelberg","reference-count":2,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354051662X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0018361","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T02:50:09Z","timestamp":1132627809000},"page":"357-365","source":"Crossref","is-referenced-by-count":139,"title":["A final coalgebra theorem"],"prefix":"10.1007","author":[{"given":"Peter","family":"Aczel","sequence":"first","affiliation":[]},{"given":"Nax","family":"Mendler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Aczel, P. 1988. Non-Well-Founded Sets, CSLI Lecture Notes, Number 14, Stanford University."},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"Milner, R. 1983. Calculi for Synchrony and Asynchrony. Theoretical Computer Science 25:267\u2013310.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Category Theory and Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0018361.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:41:13Z","timestamp":1607532073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0018361"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354051662X"],"references-count":2,"URL":"https:\/\/doi.org\/10.1007\/bfb0018361","relation":{},"subject":[]}}