{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:59:59Z","timestamp":1778299199373,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540183174","type":"print"},{"value":"9783540478799","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18317-5_23","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:32:55Z","timestamp":1330198375000},"page":"426-445","source":"Crossref","is-referenced-by-count":11,"title":["Finding fixed points in finite lattices"],"prefix":"10.1007","author":[{"given":"Chris","family":"Martin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Hankin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"23_CR1","unstructured":"S. Abramsky and C. Hankin (Eds), Abstract Interpretation of Declarative Languages, Ellis Horwood, 1987."},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"G. Burn, C. Hankin, and S. Abramsky, The Theory of Strictness Analysis for Higher Order Functions, pp. 42\u201362, Springer Verlag LNCS 217, 1985.","DOI":"10.1007\/3-540-16446-4_3"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"C. Clack and S. Peyton-Jones, \u201cStrictness Analysis \u2014 A Practical Approach,\u201d in Functional Programming Languages and Computer Science, pp. 35\u201349, Springer Verlag LNCS 201, Nancy, France, September 1985.","DOI":"10.1007\/3-540-15975-4_28"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"C. Hankin, G. Burn, and S. Peyton-Jones, A Safe Approach to Parallel Combinator Reduction, pp. 99\u2013110, Springer Verlag LNCS 213, 1986.","DOI":"10.1007\/3-540-16442-1_7"},{"key":"23_CR5","unstructured":"C.C. Martin, itExtending the Frontiers Algorithm to Higher Order Functions and General Finite Domains, Unpublished Document, Department Of Computing, Imperial College, 1986."},{"key":"23_CR6","unstructured":"C.C. Martin, Finding Fixpoints Using a Syntactic Method, Unpublished Document, Department of Computing, Imperial College, 1987."},{"key":"23_CR7","unstructured":"J. Young and P. Hudak, Finding Fixpoints on Function Spaces, Research Report YALEEU\/DCS\/RR-505, Yale University Department of Computer Science, December 1986."}],"container-title":["Lecture Notes in Computer Science","Functional Programming Languages and Computer Architecture"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18317-5_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:14:40Z","timestamp":1605644080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18317-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540183174","9783540478799"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-18317-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987]]}}}