A syntactic approach to program transformations

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A syntactic approach to program transformations

Full text

Pdf (1.05 MB)

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: 116 - 129

Year of Publication: 1991

ISBN:0-89791-433-3

Also published in ...

Author

Zena M. Ariola

Aiken Computational Laboratory, Harvard University

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: 5

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.115878 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	Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	2	Zena Ariola , Arvind, P-TAC: a parallel intermediate language, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.230-242, September 11-13, 1989, Imperial College, London, United Kingdom [doi>10.1145/99370.99388]
	3	Z. M. Ariola and Arvind. Compilation of Id-: a Subset of Id. Technical Report CSG Memo 315, MIT Laboratory ~or Compute~ Science~ July 1990.
	4	Z. M. Ariola and Arvind. Contextual Rewriting. Technical Report CSG Memo 323, MIT Laboratory for Computer Science, 1991.
	5	Arvind , Rishiyur S. Nikhil , Keshav K. Pingali, I-structures: data structures for parallel computing, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.4, p.598-632, Oct. 1989 [doi>10.1145/69558.69562]
	6	H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, Amsterdam, 1984.
	7	H P Barendregt , M C J D Eekelen , J R W Glauert , J R Kennaway , M J Plasmeijer , M R Sleep, Towards an intermediate language based on graph rewriting, Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe, p.159-175, March 1987, Eindhoven, The Netherlands
	8	H P Barendregt , M C J D Eekelen , J R W Glauert , J R Kennaway , M J Plasmeijer , M R Sleep, Term graph rewriting, Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe, p.141-158, March 1987, Eindhoven, The Netherlands
	9	T. H. Brus , C. J. D. van Eekelen , M. O. van Leer , M. J. Plasmeijer, CLEAN: A language for functional graph rewriting, Proc. of a conference on Functional programming languages and computer architecture, p.364-384, October 1987, Portland, Oregon, United States
	10	B. Courcelle. Fundamentals Properties of Infinite Trees. D. Reidel Publishing Company, 1982.
	11	N. de Bruijn. Lambda Calculus Notattion with Nameless Dummies: A Tool for Automatic Formula Manipulation, with Application to the Church-Rosser Theorem. In Koninkijke Nederlandse Akademie van Wetensehap. pen, Series A, Mathematical Sciences, 1972.
	12	P. Hudak and P. Wadler. Report on the Programming Language Haskell, A Non-strict Purely Functional Language (Version 1.0). Technical Report YALEU/DCS/RR777, Yale University, Department of Computer Science, April 1990.
	13	Thomas Johnsson, Efficient compilation of lazy evaluation, Proceedings of the 1984 SIGPLAN symposium on Compiler construction, p.58-69, June 17-22, 1984, Montreal, Canada
	14	V. Kathail. Optimal Interpreters for Lambda-calculus Based Funtional Languages. May 1990. Ph.D. thesis, Dept. of Electrical Engineering and Computer Science, MIT.
	15	J. Klop. Term Rewriting Systems. l't Autumn workshop on Reduction Machines, Italy, September 1985.
	16	R. S. Nikhil. Id (Version 90.0) Reference Manual. Technical Report CSG Memo 284-a, MIT Laboratory for Computer Science, July 1990.
	17	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
	18	G. Plotkin. Call-by-name, Call-by-value and the Lambda Calculus. Theoretical Computer Science, 1:125-159, 1975.
	19	D. A. Turner. A New Implemetation Technique for Applicative Languages. In Software . Practice and Experience, volume 9, pages 31-49, 1979.
	20	D. A. Turner, Miranda: a non-strict functional language with polymorphic types, Proc. of a conference on Functional programming languages and computer architecture, p.1-16, January 1985, Nancy, France
	21	C. Wadsworth. Semantics And Pragmatics Of The Lambda.Calculus. Ph.D. thesis, University of Oxford, Semtember 1971.
	22	C. Wadsworth. Approximate Reduction and Lambda Calculus Models. Theoretical Computer Science, 7, 1978.

CITED BY 5

	John Launchbury, A natural semantics for lazy evaluation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.144-154, March 1993, Charleston, South Carolina, United States
	Shail Aditya , Joseph E. Stoy , Arvind, Semantics of barriers in a non-strict, implicitly-parallel language, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.204-215, June 26-28, 1995, La Jolla, California, United States
	James Hicks, Experiences with compiler-directed storage reclamation, Proceedings of the conference on Functional programming languages and computer architecture, p.95-105, June 09-11, 1993, Copenhagen, Denmark
	Dan Stefanescu , Yuli Zhou, An equational framework for the flow analysis of higher order functional programs, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.318-327, July-Sept. 1994
	Shail Aditya , Christine H. Flood , James E. Hicks, Garbage collection for strongly-typed languages using run-time type reconstruction, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.12-23, July-Sept. 1994