Completeness of rewrite rules and rewrite strategies for FP

doi:10.1145/78935.78939

Completeness of rewrite rules and rewrite strategies for FP

Full Text:

PDF

Buy this Article

Authors:	Joseph Y. Halpern	IBM Almaden Research Center, San Jose, CA
	John H. Williams	IBM Almaden Research Center, San Jose, CA
	Edward L. Wimmers	IBM Almaden Research Center, San Jose, CA

Published in:

· Journal

Journal of the ACM (JACM) JACM Homepage archive

Volume 37 Issue 1, Jan. 1990
Pages 86-143
ACM New York, NY, USA
table of contents doi>10.1145/78935.78939

	1990 Article
Bibliometrics
· Downloads (6 Weeks): 0 · Downloads (12 Months): 12 · Downloads (cumulative): 375 · Citation Count: 1

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: denotational semantics fp grammars and other rewriting systems lambda calculus and related systems languages operational semantics theory

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder