Program transformations for configuring components

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Program transformations for configuring components

Full text

Pdf (965 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: 297 - 308

Year of Publication: 1991

ISBN:0-89791-433-3

Also published in ...

Authors

Ian A. Mason
Carolyn L. Talcott

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references 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/115865.115898 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 , Chris Hankin, Abstract Interpretation of Declarative Languages, Prentice Hall Professional Technical Reference, 1987
	2	Andrew Berlin, Partial evaluation applied to numerical computation, Proceedings of the 1990 ACM conference on LISP and functional programming, p.139-150, June 27-29, 1990, Nice, France [doi>10.1145/91556.91612]
	3	A. Bondorf, Automatic autoprojection of higher order recursive equations, Proceedings of the third European symposium on programming on ESOP '90, p.70-87, May 1990, Copenhagen, Denmark
	4	Y. Futamura and K. Nogi. Generalized partial computation. In D. Bjorner, A. P. Erschov, and N. D. Jones, editors, Partial Evaluation and M, xed Computation. North-Holland, 1988.
	5	N. D. Jones, C. Gomard, A. Bondorf, O. Danvy, and T. Mogensen. A self-applicable partial evaluator for the lambda-calculus. In IEEE Computer Society 1990 International Conference on Computer Languages, 1989.
	6	N. D. Jones, P. Sestoft, and H. SO ndergaard. Mix: A self-applicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation, 2, 1989.
	7	J. M. Lucassen. Types and Effects, towards the integration of functzonal and zmperative programming. PhD thesis, MIT, 1987. Also available as LCS T1~-408.
	8	J. M. Lucassen , D. K. Gifford, Polymorphic effect systems, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.47-57, January 10-13, 1988, San Diego, California, United States [doi>10.1145/73560.73564]
	9	Ian Alistair Mason, The semantics of destructive lisp (side-effects), 1986
	10	I. Mason , C. Talcott, A sound and complete axiomatization of operational equivalence of programs with memory, Proceedings of the Fourth Annual Symposium on Logic in computer science, p.284-293, June 1989, Pacific Grove, California, United States
	11	Ian A. Mason , Carolyn L. Talcott, Programming, Transforming, and Providing with Function Abstractions and Memories, Proceedings of the 16th International Colloquium on Automata, Languages and Programming, p.574-588, July 11-15, 1989
	12	Ian Mason , Carolyn Talcott, A sound and complete axiomatization of operational equivalence between programs with memory, Stanford University, Stanford, CA, 1989
	13	I. A. Mason and C. L. Talcott. Equivalence in functional languages with effects. Journal of Funchonal Programming, to appear, 199?
	14	Ian Mason , Carolyn Talcott, Inferring the equivalence of functional programs that mutate data, Theoretical Computer Science, v.105 n.2, p.167-215, Nov. 1992 [doi>10.1016/0304-3975(92)90301-U]
	15	I. A. Mason and C. L. Talcott. Program transformation via constraint propagation. 199? submitted for publication.
	16	E. Moggi, Computational lambda-calculus and monads, Proceedings of the Fourth Annual Symposium on Logic in computer science, p.14-23, June 1989, Pacific Grove, California, United States
	17	G. Plotkin. Call-by-name, call-by-value and the lambda-v-calculus. Theoretical Computer Science, 1, 1975.
	18	O. Shivers, Control flow analysis in scheme, Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation, p.164-174, June 20-24, 1988, Atlanta, Georgia, United States
	19	C. L. Talcott and R. W. Weyhrauch. Partial evaluation, higher-order abstractions, and reflection principles as system building tools. In D. Bjorner, A. P. Erschov, and N. D. Jones, editors, Parlzal Evaluation and Mixed Computation. North-Holland, 1988.
	20	Daniel. Weise. Graphs as intermediate representation for partial evaluation. Technical report, Stanford University Computer Systems Laboratory, 1990. submitted for publication.