{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:44Z","timestamp":1725456044139},"publisher-location":"Berlin\/Heidelberg","reference-count":26,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354051662X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0018346","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:50:09Z","timestamp":1132645809000},"page":"82-100","source":"Crossref","is-referenced-by-count":1,"title":["Projections for polymorphic strictness analysis"],"prefix":"10.1007","author":[{"given":"John","family":"Hughes","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","first-page":"217","volume-title":"Workshop on Programs as Data Objects","author":"S. Abramsky","year":"1985","unstructured":"S. Abramsky, Strictness Analysis and Polymorphic Invariance, Workshop on Programs as Data Objects, Copenhagen, Springer LNCS 217, 1985."},{"key":"6_CR2","unstructured":"S. Abramsky, Notes on Strictness Analysis for Polymorphic Functions, draft paper, 1988."},{"key":"6_CR3","unstructured":"S. Abramsky and C. L. Hankin (eds.) Abstract Interpretation of Declarative Languages, Ellis-Horwood, 1987."},{"key":"6_CR4","first-page":"217","volume-title":"Workshop on Programs as Data Objects","author":"G. L. Burn","year":"1985","unstructured":"G. L. Burn, C. L. Hankin, S. Abramsky, The Theory of Strictness Analysis for Higher-order Functions, Workshop on Programs as Data Objects, Copenhagen, Springer LNCS 217, 1985."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"C. Clack and S. L. Peyton-Jones, Strictness Analysis \u2014 a Practical Approach, in IFIP Conference on Functional Programming Languages and Computer Architecture, Nancy, France, Springer LNCS 201, 1985.","DOI":"10.1007\/3-540-15975-4_28"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"P. Dybjer, Computing Inverse Images, in ICALP 1987.","DOI":"10.1007\/3-540-18088-5_3"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"B. Goldberg, Detecting Sharing of Partial Applications in Functional Programs, in IFIP Conference on Functional Programming Languages and Computer Architecture, Portland, Oregon, Springer LNCS 274, 1987.","DOI":"10.1007\/3-540-18317-5_22"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"C. Hall and D. S. Wise, Compiling Strictness into Streams, in ACM Symposium on Principles of Programming Languages, 1987.","DOI":"10.1145\/41625.41637"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"P. Hudak and J. Young, Higher-order Strictness Analysis for Untyped Lambda Calculus, in ACM Symposium on Principles of Programming Languages, 1986.","DOI":"10.1145\/512644.512653"},{"key":"6_CR10","unstructured":"P. Hudak, Abstract reference counting, in S. Abramsky and C. L. Hankin (eds.) Abstract Interpretation of Declarative Languages, Ellis-Horwood, 1987."},{"key":"6_CR11","first-page":"217","volume-title":"Workshop on Programs as Data Objects","author":"J. Hughes","year":"1985","unstructured":"J. Hughes, Strictness Detection in Non-Flat Domains, Workshop on Programs as Data Objects, Copenhagen, Springer Verlag 217, 1985."},{"key":"6_CR12","unstructured":"J. Hughes, Analysing Strictness by Abstract Interpretation of Continuations, in S. Abramsky and C. L. Hankin (eds.) Abstract Interpretation of Declarative Languages, Ellis-Horwood, 1987."},{"key":"6_CR13","unstructured":"J. Hughes, Backwards Analysis of Functional Programs, IFIP Workshop on Partial Evaluation and Mixed Computation, Bj\u00f8rner, Ershov and Jones (eds.), North-Holland, 1987."},{"key":"6_CR14","unstructured":"J. Hughes, Abstract Interpretation of First-order Polymorphic Functions, Proc. Aspen\u00e6s Workshop on Graph Reduction, University of Gothenburg, 1988."},{"key":"6_CR15","unstructured":"J. Hughes, Compile-time Analysis of Functional Languages, Proc. Year of Programming Summer School on Declarative Programming, University of Texas, 1989 (to appear)."},{"key":"6_CR16","unstructured":"J. Launchbury, Projections for Specialisation, IFIP Workshop on Partial Evaluation and Mixed Computation, Bj\u00f8rner, Ershov and Jones (eds.), North-Holland, 1987."},{"key":"6_CR17","unstructured":"J. Launchbury, Binding Time Aspects of Partial Evaluation, Ph.D. thesis, Glasgow University, in preparation."},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"C. Martin and C. Hankin, Finding Fixed Points in Finite Lattices, IFIP Conference on Functional Programming Languages and Computer Architecture, Portland, Oregon, Springer LNCS 274, 1987.","DOI":"10.1007\/3-540-18317-5_23"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"A. Mycroft, The Theory and Practice of Transforming Call-by-Need into Call-by-Value, Proc. International Symposium on Programming, Springer LNCS 83, 1980.","DOI":"10.1007\/3-540-09981-6_19"},{"key":"6_CR20","unstructured":"Tutorial on natural transformations, in Proc. Category Theory and Computer Programming, Springer LNCS 240, 1985."},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"M. Sheeran, Categories for the Working Hardware Designer, to appear in Proc. Int. Workshop on Hardware Specification, Verification, and Synthesis: Mathematical Aspects, Cornell, Springer LNCS, 1989.","DOI":"10.1007\/0-387-97226-9_38"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"P. Wadler and J. Hughes, Projections for Strictness Analysis, IFIP Conference on Functional Programming Languages and Computer Architecture, Portland, Oregon, Springer LNCS 274, 1987.","DOI":"10.1007\/3-540-18317-5_21"},{"key":"6_CR23","unstructured":"P. Wadler, Strictness Analysis on Non-flat Domains (by Abstract Interpretation over Finite Domains), in S. Abramsky and C. L. Hankin (eds.) Abstract Interpretation of Declarative Languages, Ellis-Horwood, 1987."},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"P. Wadler, Strictness Analysis Aids Time Analysis, in ACM Symposium on Principles of Programming Languages, 1988.","DOI":"10.1145\/73560.73571"},{"key":"6_CR25","volume-title":"IFIP Functional Programming Languages and Computer Architecture","author":"P. Wadler","year":"1989","unstructured":"P. Wadler, Theorems for Free!, to appear in IFIP Functional Programming Languages and Computer Architecture, London, Springer LNCS, 1989."},{"key":"6_CR26","unstructured":"S. C. Wray, Implementation and Programming Techniques for Functional Languages, Ph.D. thesis, University of Cambridge, 1986."}],"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\/BFb0018346.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:41:07Z","timestamp":1607550067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0018346"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354051662X"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/bfb0018346","relation":{},"subject":[]}}