Frontiers and open sets in abstract interpretation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Frontiers and open sets in abstract interpretation

Full text

Pdf (975 KB)

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: 1 - 13

Year of Publication: 1989

ISBN:0-89791-328-0

Author

Sebastian Hunt

Imperial College, London SW7 2BZ

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): 4, Downloads (12 Months): 21, Citation Count: 5

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.99371 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.

	Abr86	Samson Abramsky, Strictness analysis and polymorphic invariance, on Programs as data objects, p.1-23, April 1986, Copenhagen, Denmark
	BHA86	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
	Bur87	G.L. Burn. Abstract Interpretation and the Parallel Evaluation of Functional Languages. PhD thesis, Department of Computing, Imperial College of Science and Technology, University of London, 1987.
	CJ85	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
	Hug88	John Hughes. Abstract interpretation of first-order polymorphic functions. In Glasgow Workshop on Functional Programruing, University of Glasgow, Department of Computing Science, August 1988. Research Report 89/R4.
	JC87	Simon Peyton Jones and Chris Clack. Finding fixpoints in abstract interpretation. In Samson Abramsky and Chris Hankin, editors, Abstract Interpretation of Declarative Languages, chapter 11. Ellis Horwood, 1987.
	Mar89	Chris Martin. Algorithms for Finding Fixpoints in Abstract Interpretation. PhD thesis, Department of Computing, Imperial College of Science, Technology and Medicine, University of London, 1989.
	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
	Myc81	A. Mycroft. Abstract Interpretation and Optimising Transformations for Applicative Programs. PhD thesis, University of Edinburgh., 1981.
	Wad87	P. Wadler. Strictness analysis on non-flat domains (by abstract interpretation over finite domains). In Samson Abramsky and Chris Hankin, editors, Abstract Interpreta. tion of Declarative Languages, chapter 12. Ellis Horwood, 1987.

CITED BY 5

	Kei Davis, Higher-order binding-time analysis, Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.78-87, June 14-16, 1993, Copenhagen, Denmark
	Tyng-Ruey Chuang , Benjamin Goldberg, A syntactic approach to fixed point computation on finite domains, ACM SIGPLAN Lisp Pointers, v.V n.1, p.109-118, Jan. 1992
	Eric Nöcker, Strictness analysis using abstract reduction, Proceedings of the conference on Functional programming languages and computer architecture, p.255-265, June 09-11, 1993, Copenhagen, Denmark
	Sigbjørn Finne , Geoffrey Burn, Assessing the evaluation transformer model of reduction on the spineless G-machine, Proceedings of the conference on Functional programming languages and computer architecture, p.331-340, June 09-11, 1993, Copenhagen, Denmark
	Tyng-Ruey Chuang , Benjamin Goldberg, A syntactic method for finding least fixed points of higher-order functions over finite domains, Journal of Functional Programming, v.7 n.4, p.357-394, July 1997