{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:44Z","timestamp":1725663764880},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540552536"},{"type":"electronic","value":"9783540468035"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55253-7_16","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T04:56:26Z","timestamp":1330232186000},"page":"269-286","source":"Crossref","is-referenced-by-count":0,"title":["Reversing abstract interpretations"],"prefix":"10.1007","author":[{"given":"John","family":"Hughes","sequence":"first","affiliation":[]},{"given":"John","family":"Launchbury","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"volume-title":"Abstract Interpretation of Declarative Languages","year":"1987","key":"16_CR1","unstructured":"S.Abramsky and C.L.Hankin eds., Abstract Interpretation of Declarative Languages. Ellis Horwood, Chichcster, England, 1987."},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0167-6423(86)90010-9","volume":"7","author":"G. L. Burn","year":"1986","unstructured":"G.L.Burn, C.L.Hankin and S.Abramsky, Strictness analysis for higher order functions, In Science of Computer Programming, 7, 249\u2013278, 1986.","journal-title":"Science of Computer Programming"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"G.L.Burn, A relationship between abstract interpretation and projection analysis, POPL, 1990.","DOI":"10.1145\/96709.96724"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"P.Cousot and R.Cousot, Abstract Interpretation: A unified lattice model for static analyses of programs by construction of approximation fixpoints, POPL, 1977.","DOI":"10.1145\/512950.512973"},{"issue":"2","key":"16_CR5","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0890-5401(91)90004-L","volume":"90","author":"P. Dybjer","year":"1991","unstructured":"P.Dybjer, Inverse Image Analysis Generalises Strictness Analysis, Information and Computation 90, 2, 1991, pp 194\u2013216.","journal-title":"Information and Computation"},{"key":"16_CR6","unstructured":"C.V.Hall, Strictness Analysis Applied to Programs with Lazy List Constructors, Ph.D. thesis, Indiana University, 1987."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"R.J.M.Hughes and J.Launchbury, Towards Relating Forwards and Backwards Analyses, Glasgow Functional Programming, Ullapool, In Workshops in Computing, S-V, 1991.","DOI":"10.1007\/978-1-4471-3810-5_9"},{"key":"16_CR8","unstructured":"R.J.M.Hughes and J.Launchbury, Locally Relational Abstract Interpretation, in preparation, Glasgow University, 1991."},{"key":"16_CR9","series-title":"Proc. IFIP TC2 Workshop","volume-title":"Partial Evaluation and Mixed Computation","author":"R. J. M. M. Hughes","year":"1988","unstructured":"R.J.M.Hughes, Backwards Analysis of Functional Programs, In D.Bj\u00f8rner, A.Ershov and N.D.Jones eds. Partial Evaluation and Mixed Computation, Proc. IFIP TC2 Workshop, Denmark, Oct 1987; North-Holland, 1988."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"S.Hunt, PERs generalise projections for strictness analysis, Glasgow Functional Programming, Ullapool, In Workshops in Computing, S-V, 1991.","DOI":"10.1007\/978-1-4471-3810-5_10"},{"key":"16_CR11","unstructured":"S.Hunt, Forwards and Backwards Strictness Analysis: Continuing the Comparison, unpublished draft, Imperial College, 1991."},{"key":"16_CR12","volume-title":"Detecting when Call-by-Value can be used instead of Call-by-Need","author":"T. Johnsson","year":"1981","unstructured":"T.Johnsson, Detecting when Call-by-Value can be used instead of Call-by-Need, Programming Methodology Group, PMG-14, Chalmers, Gothenburg, 1981."},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"J.Launchbury. Projection Factorisations in Partial Evaluation. Ph.D. Thesis, Glasgow University, 1989; Distinguished Dissertations in Computer Science, Vol 1, C.U.P. 1991.","DOI":"10.1017\/CBO9780511569814"},{"key":"16_CR14","volume-title":"Strictness and Binding-Time Analyses: Two for the Price of One","author":"J. Launchbury","year":"1991","unstructured":"J.Launchbury. Strictness and Binding-Time Analyses: Two for the Price of One, SIGPLAN PLDI, Toronto, 1991."},{"key":"16_CR15","unstructured":"A.Mycroft, Abstract interpretation and optimising transformations for applicative languages, Ph.D. thesis, University of Edinburgh, 1981."},{"key":"16_CR16","unstructured":"H.R.Nielson and F.Nielson, Bounded Fixed Point Iteration, POPL 92."},{"key":"16_CR17","unstructured":"P.Wadler and R.J.M.Hughes, Projections for Strictness Anahjsis, FPCA 87."},{"key":"16_CR18","unstructured":"P.Wadler, Strictness analysis on non-flat domains, In [AH87], 1987."}],"container-title":["Lecture Notes in Computer Science","ESOP '92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55253-7_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:58:25Z","timestamp":1605628705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55253-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540552536","9783540468035"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-55253-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}