ACM Home Page
Please provide us with feedback. Feedback
A syntactic approach to program transformations
Full text PdfPdf (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  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
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
2
 
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
 
6
H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, Amsterdam, 1984.
 
7
 
8
 
9
 
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
 
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
 
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
 
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.