Binding time analysis

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Binding time analysis: a new PERspective

Full text

Pdf (995 KB)

Source

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

New Haven, Connecticut, United States

Pages: 154 - 165

Year of Publication: 1991

ISBN:0-89791-433-3

Also published in ...

Authors

Sebastian Hunt	Department of Computing, Imperial College, 180 Queens Gate, London SW7 2BZ
David Sands	Department of Computing, Imperial College, 180 Queens Gate, London SW7 2BZ

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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

	Abr90	S. Abramsky. Abstract interpretation, logical relations and Kan extensions. Logic and Computation, 1 (1), 1990.
	AH87	S. Abramsky , C. Hankin, Abstract interpretation of declarative languages, Halsted Press, New York, NY, 1987
	AJ91	Samson Abramsky , Thomas P. Jensen, A relational approach to strictness analysis for higher-order polymorphic functions, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.49-54, January 21-23, 1991, Orlando, Florida, United States [doi>10.1145/99583.99593]
	AP90	M. Abadi and G. Plotkin. A per model of polymorphism and recursive types. In Logic in Computer Science. IEEE, 1990.
	Asp90	A.G. Asperti. Categorical Topics ~n Computer Science. PhD thesis, Universit~ di Pisa, 1990.
	ASU86	Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	Chi90	W. N. Chin. Automatic Methods for Program Transformation. PhD thesis, Imperial College, University of London, 1990.
	Con90	Charles Consel, Binding time analysis for high order untyped functional languages, Proceedings of the 1990 ACM conference on LISP and functional programming, p.264-272, June 27-29, 1990, Nice, France [doi>10.1145/91556.91668]
	Hug87	R. J. M. Hughes. Backwards analysis of functional programs. Research Report CSC/87/R3, University of Glasgow, March 1987.
	Hun90	S. Hunt. PERs generalise projections for strictness analysis. Technical Report DOC 14/90, Imperial College, 1990.
	JM89	Simon B. Jones , Daniel Le Métayer, Compile-time garbage collection by sharing analysis, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.54-74, September 11-13, 1989, Imperial College, London, United Kingdom [doi>10.1145/99370.99375]
	Jon88	N.D. Jones. Automatic program specialization: A re-examination from basic principles. In D. Bjorner, A.P. Ershov, and N.D. Jones, editors, Partial Evaluation and Mixed Computation, pages 225-282. North- Holland, 1988.
	JSS85	Neil D. Jones , Peter Sestoft , Harald Sondergaard, An experiment in partial evaluation: the generation of a compiler generator, Proc. of the first international conference on Rewriting techniques and applications, p.124-140, December 1985, Dijon, France
	Lau88	J. Launchbury. Projections for specialisation. In D. Bjorner, A.P. Ershov, and N.D. Jones, editors, Partial Evaluation and Mixed Computation, pages 299-315. North- Holland, 1988.
	Lau89	J. Launchbury. Projection Factorisations in Partial Evaluation. PhD thesis, Department of Computing, University of Glasgow, November 1989.
	Mog88	T. Mogensen. Partially static structures in a self-applicable partial evaluator, in D. Bj0rner, A.P. Ershov, and N.D. jones, editors, Partial Evaluation and Mixed Computation, pages 325-347. North-Holland, 1988.
	Mog89	Torben Æ. Mogensen, Binding Time Analysis for Polymorphically Typed Higher Order Languages, 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.298-312, March 13-17, 1989
	Nie90	F. Nielson, Two-level semantics and abstract interpretation, Theoretical Computer Science, v.69 n.2, p.117-242, Dec. 11, 1989 [doi>10.1016/0304-3975(89)90091-1]
	NN88	H. R. Nielson , F. Nielson, Automatic binding time analysis for a typed &lgr;-calculus, Science of Computer Programming, v.10 n.2, p.139-176, April 1988 [doi>10.1016/0167-6423(88)90025-1]
	NN89	Hanne Riis Nielson , Flemming Nielson, Transformations on higher-order functions, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.129-143, September 11-13, 1989, Imperial College, London, United Kingdom [doi>10.1145/99370.99380]
	San90	D. Sands. Calculi for Time Analysis of Functional Programs. PhD thesis, Imperial College, September 1990.
	Ses86	Peter. Sestoft, The structure of a self-applicable partial evaluator, on Programs as data objects, p.257-281, April 1986, Copenhagen, Denmark
	SG9	D. Scott and C. Gunter. Semantic domains. In Handbook of Theoretical Computer Science. North-Holland, 199-. (to appear).

CITED BY 14

	Mitchell Wand, Specifying the correctness of binding-time analysis, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.137-143, March 1993, Charleston, South Carolina, United States
	Marc Neuberger , Prateek Mishra, A precise relationship between the deductive power of forward and backward strictness analysis, ACM SIGPLAN Lisp Pointers, v.V n.1, p.127-138, Jan. 1992
	Robert Muller , Yuli Zhou, Abstract interpretation in weak powerdomains, ACM SIGPLAN Lisp Pointers, v.V n.1, p.119-126, Jan. 1992
	Charles Consel , Calton Pu , Jonathan Walpole, Incremental partial evaluation: the key to high performance, modularity and portability in operating systems, Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.44-46, June 14-16, 1993, Copenhagen, Denmark
	Nick Benton , Peter Buchlovsky, Semantics of an effect analysis for exceptions, Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation, January 16-16, 2007, Nice, Nice, France
	Alexander Aiken , John H. Williams , Edward L. Wimmers, Safe: a semantic technique for transforming programs in the presence of errors, ACM Transactions on Programming Languages and Systems (TOPLAS), v.17 n.1, p.63-84, Jan. 1995
	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
	Thomas Jensen, Types in program analysis, The essence of computation: complexity, analysis, transformation, Springer-Verlag New York, Inc., New York, NY, 2002
	Nick Benton, Simple relational correctness proofs for static analyses and program transformations, ACM SIGPLAN Notices, v.39 n.1, p.14-25, January 2004
	Sebastian Hunt , David Sands, On flow-sensitive security types, ACM SIGPLAN Notices, v.41 n.1, p.79-90, January 2006
	Torben Amtoft , Anindya Banerjee, A logic for information flow analysis with an application to forward slicing of simple imperative programs, Science of Computer Programming, v.64 n.1, p.3-28, January, 2007
	Andrei Sabelfeld , David Sands, A Per Model of Secure Information Flow in Sequential Programs, Higher-Order and Symbolic Computation, v.14 n.1, p.59-91, March 2001
	Ferruccio Damiani, A conjunctive type system for useless-code elimination, Mathematical Structures in Computer Science, v.13 n.1, p.157-197, February 2003
	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