{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:26Z","timestamp":1725663386680},"publisher-location":"Berlin, Heidelberg","reference-count":47,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540508205"},{"type":"electronic","value":"9783540460923"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-50820-1_37","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:33:26Z","timestamp":1330202006000},"page":"1-19","source":"Crossref","is-referenced-by-count":1,"title":["Static analysis of functional programs with logical variables"],"prefix":"10.1007","author":[{"given":"Gary","family":"Lindstrom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"unstructured":"Arvind, Vinod Kathail, and Keshav Pingali. Sharing of Computation in Functional Language Implementations. In Proceedings of International Workshop on High-level Computer Architecture, Los Angeles, May 21\u201325 1984.","key":"1_CR1"},{"unstructured":"Arvind, R. S. Nikhil, and K. K. Pingali. I-Structures: Data Structures for Parallel Computing. In Joseph H. Fasel and Robert M. Keller, editors, Graph Reduction: Proceedings of a Workshop, pages 336\u2013369, Springer-Verlag, 1987. Lecture Notes in Computer Science No. 279.","key":"1_CR2"},{"unstructured":"G\u00f6ran B\u00e5ge and Gary Lindstrom. Combinator Evaluation of Functional Programs with Logical Variables. Technical Report UUCS-87-027, Department of Computer Science, University of Utah, October 1987.","key":"1_CR3"},{"key":"1_CR4","volume-title":"Proc. International Conference on Fifth Generation Computer Systems","author":"G. B\u00e5ge","year":"1988","unstructured":"G\u00f6ran B\u00e5ge and Gary Lindstrom. Committed Choice Functional Programming. In Proc. International Conference on Fifth Generation Computer Systems, Institute for New Generation Computer Technology (ICOT), Tokyo, November 1988."},{"key":"1_CR5","first-page":"132","volume-title":"Conference on Lisp and Functional Programming","author":"A. Bloss","year":"1986","unstructured":"Adrienne Bloss and Paul Hudak. Variations on Strictness Analysis. In Conference on Lisp and Functional Programming, pages 132\u2013142, ACM, Cambridge, Massachusetts, August 1986."},{"doi-asserted-by":"crossref","unstructured":"G. L. Burn, C. L. Hankin, and S. Abramsky. Theory and practice of strictness analysis for higher order functions. April 1985. Dept. of Computing, Imperial College of Science and Technology.","key":"1_CR6","DOI":"10.1016\/0167-6423(86)90010-9"},{"unstructured":"C. Clack and S. L. Peyton Jones. Generating parallelism from strictness analysis. In Prof. Conf. on Func. Prog. Lang. and Comp. Arch., IFIP, Nancy, France, September 1985. Lecture Notes in Computer Science, number 201.","key":"1_CR7"},{"doi-asserted-by":"crossref","unstructured":"C. Clack and S. L. Peyton Jones. Strictness Analysis-A Practical Approach. In Proc. Conf. on Functional Programming Languages and Computer Architectures, pages 35\u201349, Springer Verlag, 1985. Lecture Notes in Computer Science, number 201.","key":"1_CR8","DOI":"10.1007\/3-540-15975-4_28"},{"unstructured":"S. H. Danforth. Logical Variables for a Functional Language. Technical Report PP-120\u201385, Microelectronics and Computer Technology Corp., 1985.","key":"1_CR9"},{"unstructured":"Saumya K. Debray and David S. Warren. Automatic Mode Inference for Prolog Programs. In Robert M. Keller, editor, Symposium on Logic Programming, pages 78\u201388, IEEE Computer Society, Salt Lake City, September 1986.","key":"1_CR10"},{"unstructured":"D. DeGroot and G. Lindstrom. Logic Programming: Functions, Relations and Equations. Prentice-Hall, Englewood Cliffs, NJ, 1986. $39.95; reviews in Computing Reviews Aug. 1987, no. 8708-0643; SIGART Newsletter, July 1987, no. 101.","key":"1_CR11"},{"doi-asserted-by":"crossref","unstructured":"Jon Fairbairn and Stuart Wray. TIM: A Simple, Lazy Abstract Machine to Execute Combinators. In Proc. Conf. on Functional Programming Languages and Computer Architectures, pages 34\u201345, Springer Verlag, 1987. Lecture Notes in Computer Science, number 274.","key":"1_CR12","DOI":"10.1007\/3-540-18317-5_3"},{"unstructured":"Lal George. Efficient Normal Order Evaluation Through Strictness Information. MS thesis, University of Utah, March 1987.","key":"1_CR13"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","first-page":"382","volume-title":"Proc. Conf. on Functional Programming Languages and Computer Architectures","author":"B. Goldberg","year":"1985","unstructured":"B. Goldberg and P. Hudak. Serial Combinators: Optimal Grains of Parallelism. In Proc. Conf. on Functional Programming Languages and Computer Architectures, pages 382\u2013399, Springer Verlag, Nancy, France, 1985. Lecture Notes in Computer Science, number 201."},{"unstructured":"Cordelia V. Hall and David S. Wise. Compiling Strictness Into Streams. Technical Report 209, Indiana Univ., December 1986.","key":"1_CR15"},{"key":"1_CR16","volume-title":"Proc. Workshop on Implementations of Functional Languages","author":"P. Hudak","year":"1985","unstructured":"P. Hudak and J. Young. A set-theoretic characterization of function strictness in the lambda calculus. In Proc. Workshop on Implementations of Functional Languages, Chalmers Univ., Aspenas, Sweden, February 1985."},{"key":"1_CR17","volume-title":"Strictness detection in non-flat domains","author":"J. Hughes","year":"1985","unstructured":"J. Hughes. Strictness detection in non-flat domains. 1985. Programming Research Group, Oxford."},{"key":"1_CR18","first-page":"1","volume-title":"Proc. Symp. on Lisp and Func. Pgmming. and Computer Architectures","author":"J. Hughes","year":"1982","unstructured":"John Hughes. Super Combinators: a New Implementation Method for Applicative Languages. In Proc. Symp. on Lisp and Func. Pgmming. and Computer Architectures, pages 1\u201310, ACM, Pittsburgh, Pa., 1982."},{"key":"1_CR19","volume-title":"Proc. Symp. on Compiler Const.","author":"T. Johnsson","year":"1984","unstructured":"T. Johnsson. Efficient compilation of lazy evaluation. In Proc. Symp. on Compiler Const., ACM SIGPLAN, Montreal, 1984."},{"doi-asserted-by":"crossref","unstructured":"T. Johnsson. Lambda Lifting: Transforming Programs to Recursive Equations. In J.-P. Jouannaud, editor, Proc. Symp. on Functional Programming Languages and Computer Architectures, pages 190\u2013203, Springer-Verlag, 1985.","key":"1_CR20","DOI":"10.1007\/3-540-15975-4_37"},{"doi-asserted-by":"crossref","unstructured":"R. M. Keller and G. Lindstrom. Applications of Feedback in Functional Programming. In Proc. Conf. on Functional Programming Languages and Computer Architecture, pages 123\u2013130, Portsmouth, NH, October 1981. Appeared in preliminary form as Invited Paper, Symposium on Functional Languages and Computer Architecture, Laboratory on Programming Methodology, Department of Computer Sciences, Chalmers University of Technology, Goteborg, Sweden, June 1981.","key":"1_CR21","DOI":"10.1145\/800223.806771"},{"unstructured":"R. B. Kieburtz. Abstract Interpretations Over Infinite Domains Cannot Terminate Uniformly. February 17, 1986. Unpublished note, Dept. of Computer Science, Oregon Graduate Center.","key":"1_CR22"},{"unstructured":"R. B. Kieburtz and M. Napierala. A Studied Laziness \u2014 Strictness Analysis With Structured Data Types. 1985. Extended abstract, Oregon Graduate Center.","key":"1_CR23"},{"unstructured":"Richard B. Kieburtz. Functions + Logic in Theory and Practice. February 25, 1987. 21 pp. unpublished paper.","key":"1_CR24"},{"unstructured":"Richard B. Kieburtz. Semantics of a Functions + Logic Language. September 3, 1986. 17 pp. unpublished paper.","key":"1_CR25"},{"key":"1_CR26","volume-title":"Proc. Symp. on Princ. of Pgmming. Lang.","author":"T.-M. Kuo","year":"1987","unstructured":"T.-M. Kuo and P. Mishra. On Strictness and its Analysis. In Proc. Symp. on Princ. of Pgmming. Lang., ACM, Munich, West Germany, March 1987."},{"key":"1_CR27","first-page":"266","volume-title":"Proc. Symp. on Princ. of Pgmming. Lang.","author":"G. Lindstrom","year":"1985","unstructured":"G. Lindstrom. Functional Programming and the Logical Variable. In Proc. Symp. on Princ. of Pgmming. Lang., pages 266\u2013280, ACM, New Orleans, January 1985. Also available as INRIA Rapport de Recherche No. 357."},{"doi-asserted-by":"crossref","unstructured":"G. Lindstrom. Implementing Logical Variables on a Graph Reduction Architecture. In R. M. Keller and J. Fasel, editors, Proc. Santa Fe Workshop on Graph Reduction, pages 382\u2013400, Springer-Verlag, 1987. Lecture Notes in Computer Science 279.","key":"1_CR28","DOI":"10.1007\/3-540-18420-1_67"},{"unstructured":"G. Lindstrom. Notes on Object Oriented Programming in FGL+LV. March 20, 1985. Unpublished working document.","key":"1_CR29"},{"key":"1_CR30","first-page":"196","volume-title":"Proc. Symposium on Compiler Construction","author":"G. Lindstrom","year":"1986","unstructured":"G. Lindstrom. Static Evaluation of Functional Programs. In Proc. Symposium on Compiler Construction, pages 196\u2013206, ACM SIGPLAN, Palo Alto, CA, June 1986."},{"doi-asserted-by":"crossref","unstructured":"G. Lindstrom, L. George, and D. Yeh. Generating Efficient Code from Strictness Annotations. In TAPSOFT'87: Proc. Second International Joint Conference on Theory and Practice of Software Development, pages 140\u2013154, Pisa, Italy, March 1987. Springer Lecture Notes in Computer Science No. 250.","key":"1_CR31","DOI":"10.1007\/BFb0014978"},{"unstructured":"Gary Lindstrom, Lal George, and Dowming Yeh. Compiling Normal Order to Fair and Incremental Persistence. August 1987. Technical summary; 12 pp.","key":"1_CR32"},{"issue":"3","key":"1_CR33","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"R. Milner. A Theory of Type Polymorphism. J. of Comp. and Sys. Sci., 17(3):348\u2013375, 1978.","journal-title":"J. of Comp. and Sys. Sci."},{"key":"1_CR34","series-title":"LFCS Report","volume-title":"The Standard ML Core Language (Revised)","author":"R. Milner","year":"1986","unstructured":"Robin Milner. The Standard ML Core Language (Revised). LFCS Report ECS-LFCS-86-2, Dept. of Computer Science, Univ. of Edinburgh, Scotland, March 1986. Part I of Standard ML, by Robert Harper, David MacQueen and Robin Milner."},{"unstructured":"R. S. Nikhil. Id World Reference Manual (for Lisp Machines). Technical Report Computation Structures Group Memo, MIT Laboratory for Computer Science, April 24, 1987.","key":"1_CR35"},{"unstructured":"R. S. Nikhil, K. Pingali, and Arvind. Id Nouveau. Technical Report Computation Structures Group Memo 265, MIT Laboratory for Computer Science, July 1986.","key":"1_CR36"},{"key":"1_CR37","volume-title":"Demand-Driven Evaluation on Dataflow Machines","author":"Keshav K. K. Pingali","year":"1986","unstructured":"Keshav K. Pingali. Demand-Driven Evaluation on Dataflow Machines. PhD thesis, Mass. Inst. of Tech., Cambridge, Mass., May 1986."},{"key":"1_CR38","volume-title":"Proc. Inst. on Declarative Programming","author":"Keshav K. K. Pingali","year":"1987","unstructured":"Keshav K. Pingali. Lazy Evaluation and the Logical Variable. In Proc. Inst. on Declarative Programming, Univ. of Texas, Austin, Texas, August 24\u201329, 1987."},{"unstructured":"U.S. Reddy. On the Relationship Between Functional and Logic Languages. In D. DeGroot and G. Lindstrom, editors, Logic Programming: Functions, Relations, and Equations, Prentice Hall, 1986.","key":"1_CR39"},{"key":"1_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/3-540-15975-4_39","volume-title":"Proc. Conf. on Functional Programming Languages and Computer Architectures","author":"M. Sheeran","year":"1985","unstructured":"Mary Sheeran. Designing Regular Array Architectures Using Higher Order Functions. In Proc. Conf. on Functional Programming Languages and Computer Architectures, pages 220\u2013237, Springer Verlag, Nancy, France, 1985. Lecture Notes in Computer Science, number 201."},{"issue":"3","key":"1_CR41","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF01414556","volume":"15","author":"S. Taylor","year":"1986","unstructured":"Stephen Taylor, Shmuel Safra, and Ehud Shapiro. A Parallel Implementation of Flat Concurrent Prolog. International Journal of Parallel Programming, 15(3):245\u2013275, June 1986.","journal-title":"International Journal of Parallel Programming"},{"key":"1_CR42","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"D. A. Turner","year":"1979","unstructured":"D. A. Turner. A New Implementation Technique for Applicative Languages. Software Practice and Experience, 9:31\u201349, 1979.","journal-title":"Software Practice and Experience"},{"key":"1_CR43","series-title":"Technical Report","volume-title":"Guarded Horn Clauses: A Parallel Logic Programming Language with the Concept of a Guard","author":"K. Ueda","year":"1986","unstructured":"K. Ueda. Guarded Horn Clauses: A Parallel Logic Programming Language with the Concept of a Guard. Technical Report TR-208, ICOT, Tokyo, 1986."},{"unstructured":"Phil Wadler. Strictness analysis on non-flat domains (by abstract interpretation over finite domains). November 10, 1985. Unpublished note, Programming Research Group, Oxford Univ.","key":"1_CR44"},{"key":"1_CR45","volume-title":"An Abstract Prolog Instruction Set","author":"D. H. D. D. Warren","year":"1983","unstructured":"D. H. D. Warren. An Abstract Prolog Instruction Set. SRI Project 4776 Technical Note 309, SRI International, Menlo Park, Calif., October 1983."},{"key":"1_CR46","volume-title":"Proc. Workshop on Implementations of Functional Languages","author":"S. C. Wray","year":"1985","unstructured":"S. C. Wray. A new strictness detection algorithm. In Proc. Workshop on Implementations of Functional Languages, Chalmers Univ., Aspenas, Sweden, February 1985."},{"unstructured":"Dowming Yeh. Static Evaluation of a Functional Language Through Strictness Analysis. MS thesis, University of Utah, September 1987.","key":"1_CR47"}],"container-title":["Lecture Notes in Computer Science","Programming Languages Implementation and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50820-1_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:18:51Z","timestamp":1605647931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50820-1_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540508205","9783540460923"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/3-540-50820-1_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}