Nonlinear pattern matching in trees

doi:10.1145/128749.128752

Nonlinear pattern matching in trees

Full Text:

PDF

Buy this Article

Authors:	R. Ramesh	University of Texas at Dallas, Richardson, Texas
	I. V. Ramakrishnan	State University of New York at Stony Brook, Stony Brook, New York

Published in:

· Journal

Journal of the ACM (JACM) JACM Homepage archive

Volume 39 Issue 2, April 1992
Pages 295-316
ACM New York, NY, USA
table of contents doi>10.1145/128749.128752

	1992 Article
Bibliometrics
· Downloads (6 Weeks): 3 · Downloads (12 Months): 26 · Downloads (cumulative): 800 · Citation Count: 16

Tools and Resources

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

Share:

|

Tags: algorithms languages mechanical theorem proving nonlinear pattern matching normalization pattern matching performance rewriting theorem proving theory trees

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