{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:31Z","timestamp":1725663391634},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540542339"},{"type":"electronic","value":"9783540475163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54233-7_124","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:38:20Z","timestamp":1330209500000},"page":"47-59","source":"Crossref","is-referenced-by-count":5,"title":["Uniform ideals and strictness analysis"],"prefix":"10.1007","author":[{"given":"Christine","family":"Ernoult","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Mycroft","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S. Strictness analysis and polymorphic invariance. In [8].","DOI":"10.1007\/3-540-16446-4_1"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Burn, G. A relationship between abstract interpretation and projection analysis (extended abstract). Proc. 17th ACM symp. on Principles of Programming Languages, 1990.","DOI":"10.1145\/96709.96724"},{"key":"4_CR3","unstructured":"Burn, G. Lazy functional languages: interpretation and compilation. Unpublished manuscript, forthcoming book, 1990."},{"key":"4_CR4","unstructured":"Burn, G., Hankin, C. and Abramsky, S. The theory and practice of strictness analysis for higher order functions. In [8]."},{"key":"4_CR5","unstructured":"Ernoult, C. Higher-order strictness analysis over non-flat domains. INRIA (Rocquencourt) rapport 1190, 1990."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Hudak, P. and Young, J. Higher order strictness analysis in untyped lambda calculus. Proc. 13th ACM symp. on Principles of Programming Languages, 1986.","DOI":"10.1145\/512644.512653"},{"key":"4_CR7","unstructured":"Hunt, L.S. PERs generalise projections for strictness analysis. Departmental report DOC 90\/14, Dept. of Computing, Imperial College, London."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Jones, N.D. and Ganzinger, H. (eds.) Programs as Data Objects. Lecture Notes in Computer Science: Proc. of a Workshop, Copenhagen, vol. 215, Springer-Verlag, 1985.","DOI":"10.1007\/3-540-16446-4"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Kuo, T.-M. and Mishra, P. Strictness analysis: a new perspective based on type inference. ACM-IFIP, Proc. of the functional programming and computer architecture conference, 1989.","DOI":"10.1145\/99370.99390"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"MacQueen, D., Plotkin, G.D. and Sethi, R. An ideal model for recursive polymorphic types. Proc. 11th ACM symp. on Principles of Programming Languages, 1984.","DOI":"10.1145\/800017.800528"},{"key":"4_CR11","unstructured":"Mycroft, A. Abstract interpretation and optimising transformations of applicative programs. Ph.D. thesis, Edinburgh University, 1981. Available as computer science report CST-15-81."},{"key":"4_CR12","unstructured":"Nielson, F. Abstract interpretation using domain theory. Ph.D. thesis, Edinburgh University, 1984. Available as computer science report CST-31-84."},{"key":"4_CR13","unstructured":"Vickers, S. Topology via logic. Cambridge Tracts in Theoretical Computer Science 5. Cambridge University Press 1989."},{"key":"4_CR14","volume-title":"Abstract interpretation of declarative languages","author":"P.L. Wadler","year":"1987","unstructured":"Wadler, P.L. Strictness analysis on non-flat domains (by abstract interpretation over finite domains). In Abramsky, S. and Hankin, C. (eds.) Abstract interpretation of declarative languages. Ellis Horwood, Chichester, UK, 1987."},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Wadler, P.L. and Hughes R.J.M. Projections for strictness analysis. In G. Kahn (ed.) Lecture Notes in Computer Science: Proc. of the functional programming and computer architecture conference, vol. 274, Springer-Verlag, 1987.","DOI":"10.1007\/3-540-18317-5_21"},{"key":"4_CR16","unstructured":"Wright, D.A. Strictness analysis via (type) inference. Report R89-3, Electrical Engineering and Computer Science Dept., Tasmania University, 1989."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54233-7_124.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:53:05Z","timestamp":1605646385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54233-7_124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540542339","9783540475163"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-54233-7_124","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}