Strictness analysis

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Strictness analysis: a new perspective based on type inference

Full text

Pdf (1.17 MB)

Source

Functional Programming Languages and Computer Architecture archive
Proceedings of the fourth international conference on Functional programming languages and computer architecture table of contents

Imperial College, London, United Kingdom

Pages: 260 - 272

Year of Publication: 1989

ISBN:0-89791-328-0

Authors

Tsung-Min Kuo	Department of Computer Science, The State University of New York at Stony Brook, Stony Brook, NY
Prateek Mishra	Department of Computer Science, The State University of New York at Stony Brook, Stony Brook, NY

Sponsors

SIGARCH: ACM Special Interest Group on Computer Architecture
IFIP WG 2.8 : IFIP WG 2.8
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 12, Citation Count: 27

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/99370.99390 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.

	BHA85	G. L. Burn, C. L. Hankin, and S. Abramsky. The Theory and Practice of Strictness Analysis for Higher-Order Functions. Research Report 85/06, Imperial College, 1985.
	Car85	L. Cardelli. Basic polymorphic typechecking. 1985. Manuscript.
	DM82	Luis Damas , Robin Milner, Principal type-schemes for functional programs, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.207-212, January 25-27, 1982, Albuquerque, Mexico [doi>10.1145/582153.582176]
	FM88	You-Chin Fuh , Prateek Mishra, Type inference with subtypes, Proceedings of the Second European Symposium on Programming, p.155-175, January 1988, Nancy, France
	FM89	You-Chin Fuh , Prateek Mishra, Polymorphic Subtype Inference: Closing the Theory-Practice Gap, Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages, p.167-183, March 13-17, 1989
	HY86	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]
	KM87	T.-M. Kuo , P. Mishra, On strictness and its analysis, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.144-155, January 21-23, 1987, Munich, West Germany [doi>10.1145/41625.41638]
	Kuo89	Tsung-Min Kuo. A Framework for Strictness Analysis Based on Type Inference. Research Proposal, SUNY at Stony Brook, 1989.
	Lei83	Daniel Leivant, Polymorphic type inference, Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.88-98, January 24-26, 1983, Austin, Texas [doi>10.1145/567067.567077]
	Mal87	J. Malhotra. Implementation Issues for Standard ML. Master's thesis, The State University of New York at Stony Brook, 1987.
	Mau85	Dieter Maurer, Strictness computation using special &lgr;-expressions, on Programs as data objects, p.136-155, April 1986, Copenhagen, Denmark
	MH87	Chris Martin , Chris Hankin, Finding fixed points in finite lattices, Proc. of a conference on Functional programming languages and computer architecture, p.426-445, October 1987, Portland, Oregon, United States
	Mis88	Prateek Mishra, Strictness analysis of the untyped &lgr;-calculus, Information Processing Letters, v.28 n.3, p.121-125, July 4, 1988 [doi>10.1016/0020-0190(88)90156-1]
	Mit84	John C. Mitchell, Coercion and type inference, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.175-185, January 15-18, 1984, Salt Lake City, Utah, United States [doi>10.1145/800017.800529]
	Myc80	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
	Ong88	C.It.L. Ont. Fully abstract models of the lazy lambda-calculus. In 29th Annual Symposium of Foundation of Computer Science, October 1988.
	Sta79	R. Statman. The typed A-calculus is not elementary recursive. Theoretical Computer Science, 9:73-81, 1979.
	Wad76	C. P. Wadsworth. The relation between computational and denotational properties for Scott's Doo-models of the lambda-calculus. SIAM J. of Computation, 5(3), 1976.

CITED BY 27

	Jens Palsberg , Patrick O'Keefe, A type system equivalent to flow analysis, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.367-378, January 23-25, 1995, San Francisco, California, United States
	Dan Stefanescu , Yuli Zhou, An equational framework for the flow analysis of higher order functional programs, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.318-327, July-Sept. 1994
	Flemming Nielson , Hanne Riis Nielson, Operational semantics of termination types, Nordic Journal of Computing, v.3 n.2, p.144-187, Summer 1996
	D. J. Lillie, Conjunctive subtyping, Proceedings of the conference on Functional programming languages and computer architecture, p.42-51, June 09-11, 1993, Copenhagen, Denmark
	B. Monsuez, Using abstract interpretation to define a strictness type inference system, Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.122-133, June 21-23, 1995, La Jolla, California, United States
	Robert Muller , Yuli Zhou, Abstract interpretation in weak powerdomains, ACM SIGPLAN Lisp Pointers, v.V n.1, p.119-126, Jan. 1992
	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
	Benjamin Goldberg, Tag-free garbage collection for strongly typed programming languages, ACM SIGPLAN Notices, v.26 n.6, p.165-176, June 1991
	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
	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
	Philip Wadler, Is there a use for linear logic?, ACM SIGPLAN Notices, v.26 n.9, p.255-273, Sept. 1991
	Patrick Cousot, Types as abstract interpretations, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.316-331, January 15-17, 1997, Paris, France
	Chris Hankin , Daniel Le Métayer, Deriving algorithms from type inference systems: application to strictness analysis, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.202-212, January 16-19, 1994, Portland, Oregon, United States
	Jens Palsberg, Type-based analysis and applications, Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, p.20-27, June 2001, Snowbird, Utah, United States
	Thomas Jensen, Types in program analysis, The essence of computation: complexity, analysis, transformation, Springer-Verlag New York, Inc., New York, NY, 2002
	Alberto Momigliano , Frank Pfenning, Higher-order pattern complement and the strict λ-calculus, ACM Transactions on Computational Logic (TOCL), v.4 n.4, p.493-529, October 2003
	Thomas P. Jensen, Inference of polymorphic and conditional strictness properties, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.209-221, January 19-21, 1998, San Diego, California, United States
	Jens Palsberg , Patrick O'Keefe, A type system equivalent to flow analysis, ACM Transactions on Programming Languages and Systems (TOPLAS), v.17 n.4, p.576-599, July 1995
	Carsten K. Gomard, Partial type inference for untyped functional programs, Proceedings of the 1990 ACM conference on LISP and functional programming, p.282-287, June 27-29, 1990, Nice, France
	Anindya Banerjee , Thomas Jensen, Modular control-flow analysis with rank 2 intersection types, Mathematical Structures in Computer Science, v.13 n.1, p.87-124, February 2003
	Christian Mossin, Exact flow analysis, Mathematical Structures in Computer Science, v.13 n.1, p.125-156, February 2003
	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
	Patricia Johann , Janis Voigtländer, The Impact of seq on Free Theorems-Based Program Transformations, Fundamenta Informaticae, v.69 n.1-2, p.63-102, January 2006
	Jens Palsberg , Christina Pavlopoulou, From Polyvariant flow information to intersection and union types, Journal of Functional Programming, v.11 n.3, p.263-317, May 2001
	Ferruccio Damiani , Paola Giannini, Automatic useless-code elimination for HOT functional programs, Journal of Functional Programming, v.10 n.6, p.509-559, November 2000
	John Hannan, A type-based escape analysis for functional languages, Journal of Functional Programming, v.8 n.3, p.239-273, May 1998
	Manfred Schmidt-schauss , David Sabel , Marko SchÜtz, Safety of nöcker's strictness analysis, Journal of Functional Programming, v.18 n.4, p.503-551, July 2008