Compiling strictness into streams

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Compiling strictness into streams

Full text

Pdf (1.01 MB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages table of contents

Munich, West Germany

Pages: 132 - 143

Year of Publication: 1987

ISBN:0-89791-215-2

Authors

C. V. Hall	Indiana University, 101 Lindley Hall, Bloomington, Indiana, U.S.A.
D. S. Wise	Indiana University, 101 Lindley Hall, Bloomington, Indiana, U.S.A.

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 16, Citation Count: 7

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/41625.41637 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Samson Abramsky, Strictness analysis and polymorphic invariance, on Programs as data objects, p.1-23, April 1986, Copenhagen, Denmark
	2	Adrienne Bloss , Paul Hudak, Variations on strictness analysis, Proceedings of the 1986 ACM conference on LISP and functional programming, p.132-142, August 1986, Cambridge, Massachusetts, United States [doi>10.1145/319838.319857]
	3	G. L. Burn , C. L. Hankin , S. Abramsky, The theory of strictness analysis for higher order functions, on Programs as data objects, p.42-62, April 1986, Copenhagen, Denmark
	4	Chris Clack , Simon L. Peyton Jones, Strictness analysis—a practical approach, Proc. of a conference on Functional programming languages and computer architecture, p.35-49, January 1985, Nancy, France
	5	D. P. Friedman, and D. S. W'me. CONS should not evaluate its argun~nts. In S. Michaelson and R. Milner (eds.), Automata, Language8 and Programming, Edinburgh University Press (1976), 257-284.
	6	D. P. Friedman, and D. S. Wise, Unbounded Computational Structures, Software: Practice and Experience 8 (1976), 407-416.
	7	C. V. Hall. Compilino strictness into lazlt lists. Ph.D. Dissertation, Indiana University (expected 1987).
	8	Peter Henderson , James H. Morris, Jr., A lazy evaluator, Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages, p.95-103, January 19-21, 1976, Atlanta, Georgia [doi>10.1145/800168.811543]
	9	Paul Hudak , Jonathan Young, Higher-order strictness analysis in untyped lambda calculus, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.97-109, January 01, 1986, St. Petersburg Beach, Florida [doi>10.1145/512644.512653]
	10	R.J.M. Hughes. Analysing etrictncm by abstract interpretation of continuations. In Abrarmky and Hankin (eds.), Abstrget Interpretation, Ellis-Horwood (to appear).
	11	Steven D. Johnson, Synthesis of Digital Design from Recursive Equations, MIT Press, Cambridge, MA, 1984
	12	N. D. Jones. Flow analysis of lazy higher order functional programs (April, 1986).
	13	R. Kieburtz and M. Napierala. A studied laziness {extended abstract} (August, 1985).
	14	A. T. Kohlstaedt. Daisy 1.0 reference manual. Tech. Rapt. 119, Computer Science Dept., Indiana University, Bloomington (November 1981).
	15	P. J. Landin, Correspondence between ALGOL 60 and Church's Lambda-notation: part I, Communications of the ACM, v.8 n.2, p.89-101, Feb. 1965 [doi>10.1145/363744.363749]
	16	Gary Lindstrom, Static evaluation of functional programs, ACM SIGPLAN Notices, v.21 n.7, p.196-206, July 1986
	17	Dieter Maurer, Strictness computation using special &lgr;-expressions, on Programs as data objects, p.136-155, April 1986, Copenhagen, Denmark
	18	Alan Mycroft, The Theory and Practice of Transforming Call-by-need into Call-by-value, Proceedings of the Fourth 'Colloque International sur la Programmation' on International Symposium on Programming, p.269-281, April 22-24, 1980
	19	David A. Schmidt, Denotational semantics: a methodology for language development, William C. Brown Publishers, Dubuque, IA, 1986
	20	D. A. Turner. Recursion equations as a programming language. In Darlington, Henderson and Turner (eds.), Functional Programming and its Applications, Cambridge University Press (1981).
	21	J. Vuillemin. Correct and optimal implementation of recursion in a simple programming language. J. Cornput. System Sci. 9 (1974), 332-354.
	22	P. Wadler. Strictness analysis on non-fiat domains (by abstract interpretation over finite domains), (November, 1985).

CITED BY 7

	R. C. Sekar , Shaunak Pawagi , I. V. Ramarkrishnan, Small domains spell fast strictness analysis, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.169-183, December 1989, San Francisco, California, United States
	R. C. Sekar , Prateek Mishra , I. V. Ramakrishnan, On the power and limitation of strictness analysis based on abstract interpretation, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.37-48, January 21-23, 1991, Orlando, Florida, United States
	P. Wadler, Strictness analysis aids time analysis, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.119-132, January 10-13, 1988, San Diego, California, United States
	Kenneth R. Traub, Compilation as partitioning: a new approach to compiling non-strict functional languages, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.75-88, September 11-13, 1989, Imperial College, London, United Kingdom
	R. Sekar , I. V. Ramakrishnan, Fast strictness analysis based on demand propagation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.17 n.6, p.896-937, Nov. 1995
	G. L. Burn, Using projection analysis of evaluation-order and its application, Proceedings of the 1990 ACM conference on LISP and functional programming, p.227-240, June 27-29, 1990, Nice, France
	R. Sekar , I. V. Ramakrishnan , P. Mishra, On the power and limitations of strictness analysis, Journal of the ACM (JACM), v.44 n.3, p.505-525, May 1997