A relational approach to strictness analysis for higher-order polymorphic functions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A relational approach to strictness analysis for higher-order polymorphic functions

Full text

Pdf (499 KB)

Source

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

Orlando, Florida, United States

Pages: 49 - 54

Year of Publication: 1991

ISBN:0-89791-419-8

Authors

Samson Abramsky	Dept. of Computing, Imperial College, 180, Queen's Gate, London SW7 2BZ, U.K.
Thomas P. Jensen	Dept. of Computing, Imperial College, 180, Queen's Gate, London SW7 2BZ, U.K.

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 17, Citation Count: 6

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/99583.99593 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	S. Abramsky. Abstract interpretation, logical relations and Kan extensions. Journal of Logic and Computation, 1, 1990.
	3	S. Abramsky , C. Hankin, Abstract interpretation of declarative languages, Halsted Press, New York, NY, 1987
	4	S. Abramsky, J. Mitchell, A. Scedrov, and P. Wadler. Relators. Draft paper, 1990.
	5	E. S. Bainbridge, P. J. Freyd, A. Scedrov, and P. J. Scott. Functorial polymorphism. In G. Huet, editor, Logical Foundations of Functional Programming. Addison Wesley, 1990.
	6	Michael Barr , Charles Wells, Category theory for computing science, Prentice-Hall, Inc., Upper Saddle River, NJ, 1990
	7	G.L. Burn. Abstract Interpretation and the Parallel Evaluation of Functional Languages. PhD thesis, Imperial College, University of London, 1987.
	8	G.L. Burn, C.L. Hankin, and S. Abramsky. The theory and practice of strictness analysis for higher order functions. Science of Computer Programming, 7:249- 278, 1986.
	9	P. Freyd. Structural polymorphism. Unpublished, 1989.
	10	R.J.M. Hughes. Abstract interpretation of first-order polymorphic functions. In Glasgow Workshop on Func= tional Programming, University of Glasgow, Department of Computing Science, August 1988. Research Report 89/R4.
	11	Simon L. Peyton Jones, The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science), Prentice-Hall, Inc., Upper Saddle River, NJ, 1987
	12	S. MacLane. Categories }or the Working Mathematician. Springer Verlag, 1971.
	13	G. D. Plotkin. ),-definability and logical relations. Technical Report SAI-R.M-4, School of A.I., University of Edinburgh, 1973.
	14	J. C. Reynolds. Types, abstraction and parametric polymorphism. In Information Processing 83. North Holland, 1983.

CITED BY 6

	Robert Muller , Yuli Zhou, Abstract interpretation in weak powerdomains, ACM SIGPLAN Lisp Pointers, v.V n.1, p.119-126, Jan. 1992
	Julian Seward, Polymorphic strictness analysis using frontiers, Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.186-193, June 14-16, 1993, Copenhagen, Denmark
	Stephen Brookes, The essence of parallel Algol, Information and Computation, v.179 n.1, p.118-149, November 25, 2002
	P. W. O'Hearn , R. D. Tennent, Parametricity and local variables, Journal of the ACM (JACM), v.42 n.3, p.658-709, May 1995
	QingMing Ma, Parametricity as subtyping, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.281-292, January 19-22, 1992, Albuquerque, New Mexico, United States
	Sebastian Hunt , David Sands, Binding time analysis: a new PERspective, ACM SIGPLAN Notices, v.26 n.9, p.154-165, Sept. 1991