Using abstract interpretation to define a strictness type inference system

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Using abstract interpretation to define a strictness type inference system

Full text

Pdf (1.01 MB)

Source

ACM/SIGPLAN Workshop Partial Evaluation and Semantics-Based Program Manipulation archive
Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation table of contents

La Jolla, California, United States

Pages: 122 - 133

Year of Publication: 1995

ISBN:0-89791-720-0

Author

B. Monsuez

Laboratoire d'Informatique de l'École Normale Supérieure, CNRS URA 1327, 45 rue d'Ulm 75005 Paris

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by index terms

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

	Ben93	N. Benton, Strictness Analysis of Functional Prograls. PhD Thesis, University of Cambridge, 1993.
	BHA85	G.L. Burn, C. L. Hankin, and S. Abramsky, The Theory and Practice of Strictness Analysis for Htgher-Order Functions, Research Report 85/06, Imperial College, 1985.
	Co78	P.Cousot, Mdthodes it&atives de construction et d ' approximat~on de points fixes d ' opdrateurs monotones sur un treillis, analyse sdmantique des programmes. Th~se d'Etat, Grenoble 1978.
	Co81	P. Cousot, Semantic foundations of program analys~s, in "Program Flow Analysis : theory and applications" edited by S. Muchnick N. Jones, Prentice Hall 1981.
	CoCo77	Patrick Cousot , Radhia Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.238-252, January 17-19, 1977, Los Angeles, California [doi>10.1145/512950.512973]
	CoCo79	Patrick Cousot , Radhia Cousot, Systematic design of program analysis frameworks, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.269-282, January 29-31, 1979, San Antonio, Texas [doi>10.1145/567752.567778]
	CoCo93	Patrick Cousot , Radhia Cousot, Galois Connection Based Abstract Interpretations for Strictness Analysis (Invited Paper), Proceedings of the International Conference on Formal Methods in Programming and Their Applications, p.98-127, June 28-July 02, 1993
	GuSc90	C. A. Gunter , D. S. Scott, Semantic domains, Handbook of theoretical computer science (vol. B): formal models and semantics, MIT Press, Cambridge, MA, 1991
	HanMét94	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 [doi>10.1145/174675.177858]
	Jen91	Thomas P. Jensen, Strictness analysis in logical form, Proceedings of the 5th ACM conference on Functional programming languages and computer architecture, p.352-366, June 1991, Cambridge, Massachusetts, United States
	Jen92	T.P. Jensen Disjunctive strzctness Analys~s Proceeding of LICS, 1992.
	Ka88	G. Kahn, Natural Semantics, "Programming of Future Generation Computers" edited by K. Fuchi, M. Niwt, Elsevier Science Publishers B .V. (North-Holland) 1988.
	KuoMis89	Tsung-Min Kuo , Prateek Mishra, Strictness analysis: a new perspective based on type inference, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.260-272, September 11-13, 1989, Imperial College, London, United Kingdom [doi>10.1145/99370.99390]
	Mitch84	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]
	Mon92a	B. Monsuez Fractional Types Proceeding of the Workshop on Static Analysis, September 1992, Bordeaux, France, BIGRE 82.
	Mon92b	Bruno Monsuez, Polymorphic Typing by Abstract Interpretation, Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science, p.217-228, December 18-20, 1992
	Mon93a	Bruno Monsuez, Polymorphic Typing for Call-by-Name Semantics, Proceedings of the International Conference on Formal Methods in Programming and Their Applications, p.156-169, June 28-July 02, 1993
	Mon93b	Bruno Monsuez, Polymorphic Types and Widening Operators, Proceedings of the Third International Workshop on Static Analysis, p.267-281, September 22-24, 1993
	Myc81	A. Mycroft Abstract Interpretation and optimising Transformations for Apphcatzve Programs, Ph.D. Dissertation, CST-15-81, Department of Computer Science, University of Edinburgh, Edinburgh, Scotland, Dec. 1981.
	Myc84	Alan Mycroft, Polymorphic Type Schemes and Recursive Definitions, Proceedings of the 6th Colloquium on International Symposium on Programming, p.217-228, April 17-19, 1984
	Plo81	G.D. Plotkin, A Structural Approach to Operational Semantics, DAIMI FN-19, Computer Science Department, Aarhus, Denmark, September 1981.
	Sch86	D.A. Schmidt, Denotatzonal Semantics, Allyn and Bacon, 1986.
	SolNielNiel94	K. L. Solberg, H. R. Nielson, F. Nielson: Strictness and Totality Analysis in LNCS, Proc. of " Static Analysis Symposium ", Namur, September 1994.
	Wri91	David A. Wright, A New Technique for Strictness Analysis, Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Developmemnt (CCPSD), p.235-258, April 08-12, 1991

CITED BY 3

	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
	Thomas Jensen, Disjunctive program analysis for algebraic data types, ACM Transactions on Programming Languages and Systems (TOPLAS), v.19 n.5, p.751-803, Sept. 1997
	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