{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:40Z","timestamp":1725663580128},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540543961"},{"type":"electronic","value":"9783540475996"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3540543961_16","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:43:19Z","timestamp":1330191799000},"page":"328-351","source":"Crossref","is-referenced-by-count":9,"title":["Reasoning about simple and exhaustive demand in higher-order lazy languages"],"prefix":"10.1007","author":[{"given":"Allen","family":"Leung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prateek","family":"Mishra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,6]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Samson Abramsky. Strictness Analysis And Polymorphic Invariance. In LNCS 217: Workshop on Programs as Data Objects, 1985.","DOI":"10.1007\/3-540-16446-4_1"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"G. L. Burn, C. L. Hankin, and S. Abramsky. Strictness Analysis of Higher-Order Functions. Science of Computer Programming, 7, 1986.","DOI":"10.1016\/0167-6423(86)90010-9"},{"key":"16_CR3","unstructured":"G. Burn. Using Projection Analysis in Compiling Lazy Functional Programs. In ACM Symposium on Lisp and Functional Programming, 1990."},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/malq.19810270205","volume":"27","author":"M. Coppo","year":"1981","unstructured":"M. Coppo, M. Dezani-Ciancaglini, and B. Venneri. Functional Characters of Solvable Terms. Zeitschr. f. math. Logik and Grundlagen d. Math., 27:45\u201358, 1981.","journal-title":"Zeitschr. f. math. Logik and Grundlagen d. Math."},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"L. Damas and R. Milner. Principal Type Schemes for Functional Programs. In ACM Symposium on Principles of Programming Languages, pages 207\u2013212, 1982.","DOI":"10.1145\/582153.582176"},{"key":"16_CR6","unstructured":"You-Chin Fuh and Prateek Mishra. Polymorphic Subtype Inference: Closing the Theory-Practice Gap. In TAPSOFT-89, March 1989."},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0304-3975(90)90144-7","volume":"73","author":"Y. Fuh","year":"1990","unstructured":"You-Chin Fuh and Prateek Mishra. Type Inference with Subtypes. Theoretical Computer Science, 73:155\u2013175, 1990.","journal-title":"Theoretical Computer Science"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"S. Hunt. Frontiers and Open Sets in Abstract Interpretation. In ACM-IFIP Conference on Functional Programming Languages and Computer Architecture, September 1989.","DOI":"10.1145\/99370.99371"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"P. Hudak and J. Young. Higher-Order Strictness Analysis in Untyped Lambda Calculus. In ACM Symposium on Principles of Programming Languages, 1986.","DOI":"10.1145\/512644.512653"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Tsung-Min Kuo and Prateek Mishra. On Strictness and its Analysis. In ACM Symposium on Principles of Programming Languages, 1987.","DOI":"10.1145\/41625.41638"},{"key":"16_CR11","unstructured":"Tsung-Min Kuo and Prateek Mishra. Inferring Strictness Properties of the Pure \u03bb-Calculus: Completeness and Incompleteness Theorems. Technical Report 89\/28, Submitted to LICS 91, SUNY at Stony Brook, 1989."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Tsung-Min Kuo and Prateek Mishra. Strictness Analysis: A New Perspective Based on Type Inference. In ACM-IFIP Conference on Functional Programming Languages and Computer Architecture, September 1989.","DOI":"10.1145\/99370.99390"},{"key":"16_CR13","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(86)90109-X","volume":"44","author":"D. Leivant","year":"1986","unstructured":"Daniel Leivant. Typing and Computational Properties of Lambda Expressions. Theoretical Computer Science, 44:51\u201368, 1986.","journal-title":"Theoretical Computer Science"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"A. K. T. Leung. Reasoning with Simple and Exhaustive Demands In Higher Order Functional Languages. Master's thesis, The State University of New York at Stony Brook, 1991.","DOI":"10.1007\/3540543961_16"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"G. Lindstrom. Static Evaluation of Functional Programs. In SIGPLAN86 Symposium on Compiler Construction, 1986.","DOI":"10.1145\/12276.13331"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"G. Lindstrom, G. Lal, and Y. Dowming. Generating Efficient Code from Strictness Annotations. In LNCS 250: TAPSOFT 87, 1987.","DOI":"10.1007\/BFb0014978"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"D. Maurer. Strictness Computation Using Special \u03bb-expressions. In LNCS 217: Workshop on Programs as Data Objects, 1985.","DOI":"10.1007\/3-540-16446-4_8"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"C. Martin and C. Hankin. Finding Fixed Points in Finite Lattices. In LNCS 274: Functional Programming Languages and Computer Architecture, pages 426\u2013445, 1987.","DOI":"10.1007\/3-540-18317-5_23"},{"key":"16_CR19","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(88)90156-1","volume":"28","author":"P. Mishra","year":"1988","unstructured":"Prateek Mishra. Strictness Analysis of the Untyped \u03bb-calculus. Information Processing Letters, 28:121\u2013125, 1988.","journal-title":"Information Processing Letters"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"A. Mycroft. The Theory and Practice of Transforming Call-by-need into Call-by-value. In LNCS 83, 1980.","DOI":"10.1007\/3-540-09981-6_19"},{"key":"16_CR21","unstructured":"S.L. Peyton Jones. The Implementation of Functional Programming Languages. Prentice Hall, 1987."},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"L. Puel and A. Suarez. Compiling Pattern Matching by Term Decomposition. In ACM Symposium on Lisp and Functional Programming, pages 273\u2013281, 1990.","DOI":"10.1145\/91556.91670"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"R.C. Sekar, S. Pawagi, and I.V. Ramakrishnan. Small Domains Spell Fast Strictness Analysis. In ACM Symposium on Principles of Programming Languages, 1990.","DOI":"10.1145\/96709.96727"},{"key":"16_CR24","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(79)90007-0","volume":"9","author":"R. Statman","year":"1979","unstructured":"R. Statman. The Typed \u03bb-calculus is not Elementary Recursive. Theoretical Computer Science, 9:73\u201381, 1979.","journal-title":"Theoretical Computer Science"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"C. P. Wadsworth. The Relation between Computational and Denotational Properties for Scott's D \u221e-models of the Lambda-calculus. SIAM J. of Computation, 5(3), 1976.","DOI":"10.1137\/0205036"},{"key":"16_CR26","unstructured":"P. Wadler. Strictness Analysis over Non-flat Domains. In Abstract Interpretation of Declarative Languages, Ellis Horwood, 1987."},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Philip Wadler and Hughes R.J.M. Projections for Strictness Analysis. In ACM-IFIP Conference on Functional Programming Languages and Computer Architecture, 1987.","DOI":"10.1007\/3-540-18317-5_21"}],"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\/3540543961_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:53:54Z","timestamp":1605628434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3540543961_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540543961","9783540475996"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3540543961_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}