Pattern Matching in Trees

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Pattern Matching in Trees

Full text

Pdf (1.45 MB)

Source

Journal of the ACM (JACM) archive
Volume 29 , Issue 1 (January 1982) table of contents

Pages: 68 - 95

Year of Publication: 1982

ISSN:0004-5411

Authors

Christoph M. Hoffmann	Department of Computer Science, Purdue University, West Lafayette, IN
Michael J. O'Donnell	Department of Computer Science, Purdue University, West Lafayette, IN

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 30, Downloads (12 Months): 268, Citation Count: 84

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	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/322290.322295 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 , Margaret J. Corasick, Efficient string matching: an aid to bibliographic search, Communications of the ACM, v.18 n.6, p.333-340, June 1975 [doi>10.1145/360825.360855]
	2	Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
	3	Lewis Denver Baxter, The complexity of unification., 1976
	3a	Gérard Berry , Jean-Jacques Lévy, Minimal and optimal computations of recursive programs, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.215-226, January 17-19, 1977, Los Angeles, California [doi>10.1145/512950.512971]
	4	Robert S. Boyer , J. Strother Moore, A fast string searching algorithm, Communications of the ACM, v.20 n.10, p.762-772, Oct. 1977 [doi>10.1145/359842.359859]
	5	J. Lawrence Carter , Mark N. Wegman, Universal classes of hash functions (Extended Abstract), Proceedings of the ninth annual ACM symposium on Theory of computing, p.106-112, May 04-04, 1977, Boulder, Colorado, United States [doi>10.1145/800105.803400]
	6	CHEW, P An improved algorithm for computmg wath equauons Proc 21st IEEE Symp on Foundauons of Computer Soence, Syracuse, N.Y, 1980, pp. t08-117
	7	George E. Collins, The SAC-1 system: An introduction and survey, Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, p.144-152, March 23-25, 1971, Los Angeles, California, United States [doi>10.1145/800204.806279]
	8	Beate Commentz-Walter, A String Matching Algorithm Fast on the Average, Proceedings of the 6th Colloquium, on Automata, Languages and Programming, p.118-132, July 16-20, 1979
	9	Peter Downey , Hanan Samet , Ravi Sethi, Off-line and on-line algorithms for deducing equalities, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.158-170, January 23-25, 1978, Tucson, Arizona [doi>10.1145/512760.512777]
	10	Ingrid Glasner , Ulrich Möncke , Reinhard Wilhelm, OPTRAN, a Language for the Specification of Program Transformations, Programmiersprachen und Programmentwicklung, 6. Fachtagung des Fachausschusses Programmiersprachen der GI, p.125-142, March 11-12, 1980
	11	Joseph A. Goguen, Some design principles and theory for OBJ-O, a language to express and execute algebraic specification for programs, Proceedings of the International Conference on Mathematical Studies of Information Processing, p.425-473, August 23-26, 1978
	12	GUTTAG, J, HOROWlTZ, E, AND MUSSER, D. Abstract data types and software vahdatmn. ISI Rep 76-48, Umv. of Southern California, Los Angeles, Cahf., 1976.
	13	John V. Guttag , Ellis Horowitz , David R. Musser, Abstract data types and software validation, Communications of the ACM, v.21 n.12, p.1048-1064, Dec. 1978 [doi>10.1145/359657.359666]
	14	Christoph M. Hoffmann , Michael J. O'Donnell, An interpreter generator using tree pattern matching, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.169-179, January 29-31, 1979, San Antonio, Texas [doi>10.1145/567752.567768]
	15	Christoph M. Hoffman , Michael J. O'Donnell, Programming with Equations, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.1, p.83-112, Jan. 1982 [doi>10.1145/357153.357158]
	16	HUET, G., AND LANG, B Proving and applying program transformations expressed with second order patterns Tech Pep 266, IRIA Labona, LeChesnay, France, 1977
	17	HUET, G, AND LEVY, J-J Call by need computations in nonamblguous linear term rewrmng systems Tech. Pep 359, IRIA Laborla, LeChesnay, France, 1979.
	18	Richard M. Karp , Raymond E. Miller , Arnold L. Rosenberg, Rapid identification of repeated patterns in strings, trees and arrays, Proceedings of the fourth annual ACM symposium on Theory of computing, p.125-136, May 01-03, 1972, Denver, Colorado, United States [doi>10.1145/800152.804905]
	19	Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998
	20	KNUTH, D., AND BENDIX, P.Sample word problems in universal algebras In Computatwnal Problems m Abstract Algebra, J Leech, Ed, Pergamon Press, Elmsford, N Y, 1970. pp 263-297,
	21	KNUTH, D., MORRIS, J, AND PRATT, V Fast pattern matching m strings. SIAM J Comput 6, 2 (1977), 323-350
	22	Dexter Kozen, Complexity of finitely presented algebras, Proceedings of the ninth annual ACM symposium on Theory of computing, p.164-177, May 04-04, 1977, Boulder, Colorado, United States [doi>10.1145/800105.803406]
	23	Hans Hermann Kron, Tree templates and subtree transformational grammars., 1975
	24	LANG, H -W, SCHIMMLER, M, AND SCHMECK, H Matching tree patterns subhnear on the average Tech Rep, Dep of lnformaak, Umv Klel, K~el, W Germany, 1980
	25	Greg Nelson , Derek C. Oppen, Fast Decision Procedures Based on Congruence Closure, Journal of the ACM (JACM), v.27 n.2, p.356-364, April 1980 [doi>10.1145/322186.322198]
	26	O'DONNELL, M J Computing m systems descrlbed by equations In Compunng and Systems Described by Equations, Lecture Notes tn Computer Science 58, G Goos and J Hartmarns, Eds, Sprmger-Verlag, 1977
	27	OVERMARS, M H, AND VAN LEEUWEN, J Rapid subtree ,dentlficatton revisited Tech Rep CS-79-3, Umv of Utrecht, Utrecht, Netherlands, 1979
	28	M. S. Paterson , M. N. Wegman, Linear unification, Proceedings of the eighth annual ACM symposium on Theory of computing, p.181-186, May 03-05, 1976, Hershey, Pennsylvania, United States [doi>10.1145/800113.803646]
	29	J. A. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM (JACM), v.12 n.1, p.23-41, Jan. 1965 [doi>10.1145/321250.321253]
	30	Barry K. Rosen, Tree-Manipulating Systems and Church-Rosser Theorems, Journal of the ACM (JACM), v.20 n.1, p.160-187, Jan. 1973 [doi>10.1145/321738.321750]
	31	Robert E. Shostak, An algorithm for reasoning about equality, Communications of the ACM, v.21 n.7, p.583-585, July 1978 [doi>10.1145/359545.359570]
	32	Renzo Sprugnoli, Perfect hashing functions: a single probe retrieving method for static sets, Communications of the ACM, v.20 n.11, p.841-850, Nov. 1977 [doi>10.1145/359863.359887]
	33	STAFFORD, G Structure of the Eh compiler Master's Thesis, Dep of Computer Soence, Umv of Waterloo, Waterloo, Ontario, Canada, i977
	34	WAND, M Algebraic theories and tree rewrmng systems Tech Rep 66, Dep of Computer Science, Indiana Umv, Bloomington, Ind, 1977

CITED BY 84

	Moshe Dubiner , Zvi Galil , Edith Magen, Faster tree pattern matching, Journal of the ACM (JACM), v.41 n.2, p.205-213, March 1994
	Wolfgang Küchlin, Some reduction strategies for algebraic term rewriting, ACM SIGSAM Bulletin, v.16 n.4, p.13-23, November 1982
	Yusuke Matsunaga, On accelerating pattern matching for technology mapping, Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design, p.118-122, November 08-12, 1998, San Jose, California, United States
	Nadia Nedjah, Minimal deterministic left-to-right pattern-matching automata, ACM SIGPLAN Notices, v.33 n.1, January 1998
	David R. Smith , Jing C. Lin, The Tree-Match Chip, IEEE Transactions on Computers, v.40 n.5, p.629-639, May 1991
	Dirk-Jan Jongeneel , Yosinori Watanbe , Robert K. Brayton , Ralph Otten, Area and search space control for technology mapping, Proceedings of the 37th conference on Design automation, p.86-91, June 05-09, 2000, Los Angeles, California, United States
	Richard Cole , Ramesh Hariharan, Tree pattern matching and subset matching in randomized O(nlog3m) time, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.66-75, May 04-06, 1997, El Paso, Texas, United States
	R. Ramesh , I. V. Ramakrishnan , D. S. Warren, Automata-driven indexing of Prolog clauses, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.281-291, December 1989, San Francisco, California, United States
	Ellis Cohen, Text-oriented structure commands for structure editors, ACM SIGPLAN Notices, v.17 n.11, November 1982
	Bo Hu , Yosinori Watanabe , Alex Kondratyev , Malgorzata Marek-Sadowska, Gain-based technology mapping for discrete-size cell libraries, Proceedings of the 40th conference on Design automation, June 02-06, 2003, Anaheim, CA, USA
	P K Turner, Up-down parsing with prefix grammars, ACM SIGPLAN Notices, v.21 n.12, p.167-174, Dec. 1986
	D. R. Chase, An improvement to bottom-up tree pattern matching, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.168-177, January 21-23, 1987, Munich, West Germany
	Charles Farnum, Pattern-based tree attribution, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.211-222, January 19-22, 1992, Albuquerque, New Mexico, United States
	Eric Lehman , Yosinori Watanabe , Joel Grodstein , Heather Harkness, Logic decomposition during technology mapping, Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design, p.264-271, November 05-09, 1995, San Jose, California, United States
	Cedric Chauve, Tree pattern matching with a more general notion of occurrence of the pattern, Information Processing Letters, v.82 n.4, p.197-201, 31 May 2002
	Kazuhiro Ogata , Shigenori Ioroi , Kokichi Futatsugi, Optimizing term rewriting using discrimination nets with specialization, Proceedings of the 1999 ACM symposium on Applied computing, p.511-518, February 28-March 02, 1999, San Antonio, Texas, United States
	Seapahn Meguerdichian , Miodrag Potkonjak, Watermarking while preserving the critical path, Proceedings of the 37th conference on Design automation, p.108-111, June 05-09, 2000, Los Angeles, California, United States
	Lionel Villard , Nabil Layaïda, An incremental XSLT transformation processor for XML document manipulation, Proceedings of the 11th international conference on World Wide Web, May 07-11, 2002, Honolulu, Hawaii, USA
	Nadia Nedjah , Luiza de Macedo Mourelle, Efficient concise deterministic pattern-matching automata for ambiguous patterns, ACM SIGPLAN Notices, v.37 n.2, February 2002
	Teodor Rus, Parsing Languages by Pattern Matching, IEEE Transactions on Software Engineering, v.14 n.4, p.498-511, April 1988
	C. W. Fraser, A language for writing code generators, ACM SIGPLAN Notices, v.24 n.7, p.238-245, July 1989
	Johan Jeuring, Polytypic pattern matching, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.238-248, June 26-28, 1995, La Jolla, California, United States
	Mikael Rittri, Using types as search keys in function libraries, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.174-183, September 11-13, 1989, Imperial College, London, United Kingdom
	Min Zhao , Sachin S. Sapatnekar, A new structural pattern matching algorithm for technology mapping, Proceedings of the 38th conference on Design automation, p.371-376, June 2001, Las Vegas, Nevada, United States
	R. Ramesh , I. V. Ramakrishnan, Nonlinear pattern matching in trees, Journal of the ACM (JACM), v.39 n.2, p.295-316, April 1992
	Richard Cole , Ramesh Hariharan, Verifying candidate matches in sparse and wildcard matching, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada
	Manuel Fähndrich , John Boyland, Statically checkable pattern abstractions, ACM SIGPLAN Notices, v.32 n.8, p.75-84, Aug. 1997
	Jürgen Börstler , Ulrich Möncke , Reinhard Wilhelm, Table compression for tree automata, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.3, p.295-314, July 1991
	J. Heering , P. Klint , J. Rekers, Lazy and incremental program generation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.3, p.1010-1023, May 1994
	Horatiu Cirstea , Clément Houtmann , Benjamin Wack, Distributive ρ-calculus, Electronic Notes in Theoretical Computer Science (ENTCS), v.176 n.4, p.95-111, July, 2007
	D Spector , P K Turner, Limitations of Graham-Glanville style code generation, ACM SIGPLAN Notices, v.22 n.2, p.100-107, Feb. 1987
	Alok Jain , Randal E. Bryant, Mapping switch-level simulation onto gate-level hardware accelerators, Proceedings of the 28th conference on ACM/IEEE design automation, p.219-222, June 17-22, 1991, San Francisco, California, United States
	Jiazhen Cai , Robert A. Paige, Look ma, no hashing, and no arrays neither, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.143-154, January 21-23, 1991, Orlando, Florida, United States
	Christopher W. Fraser , Robert R. Henry , Todd A. Proebsting, BURG: fast optimal instruction selection and tree parsing, ACM SIGPLAN Notices, v.27 n.4, p.68-76, April 1992
	Gösta Grahne , Jianfei Zhu, Discovering approximate keys in XML data, Proceedings of the eleventh international conference on Information and knowledge management, November 04-09, 2002, McLean, Virginia, USA
	Rakesh M. Verma, A theory of using history for equational systems with applications, Journal of the ACM (JACM), v.42 n.5, p.984-1020, Sept. 1995
	Weimin Chen , Volker Turau, An optimized implementation for VML based on pattern matching and dynamic programming, Proceedings of the third international conference on Information and knowledge management, p.88-96, November 29-December 02, 1994, Gaithersburg, Maryland, United States
	Giorgio Satta , Eric Brill, Efficient transformation-based parsing, Proceedings of the 34th annual meeting on Association for Computational Linguistics, p.255-262, June 24-27, 1996, Santa Cruz, California
	Donald A. Smith, Partial evaluation of pattern matching in constraint logic programming languages, ACM SIGPLAN Notices, v.26 n.9, p.62-71, Sept. 1991
	Christopher W. Fraser , Todd A. Proebsting, Finite-static code generation, ACM SIGPLAN Notices, v.34 n.5, p.270-280, May 1999
	Carol J. Romanowski , Rakesh Nagi , Moises Sudit, Data mining in an engineering design environment: OR applications from graph matching, Computers and Operations Research, v.33 n.11, p.3150-3160, November 2006
	Todd A. Proebsting, BURS automata generation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.17 n.3, p.461-486, May 1995
	Min Zhao , Sachin S. Sapatnekar, Technology mapping algorithms for domino logic, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.7 n.2, p.306-335, April 2002
	S. E. Keller , J. A. Perkins , T. F. Payton , S. P. Mardinly, Tree transformation techniques and experiences, ACM SIGPLAN Notices, v.19 n.6, p.190-201, June 1984
	Chang Woo Kang , Massoud Pedram, Low-power clustering with minimum logic replication for coarse-grained, antifuse based FPGAs, Proceedings of the 16th ACM Great Lakes symposium on VLSI, April 30-May 01, 2006, Philadelphia, PA, USA
	Songting Chen , Hua-Gang Li , Junichi Tatemura , Wang-Pin Hsiung , Divyakant Agrawal , K. Selçuk Candan, Twig²Stack: bottom-up processing of generalized-tree-pattern queries over XML documents, Proceedings of the 32nd international conference on Very large data bases, September 12-15, 2006, Seoul, Korea
	Gerome Miklau , Dan Suciu, Containment and equivalence for an XPath fragment, Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 03-05, 2002, Madison, Wisconsin
	J. Heering , P. Klint , J. Rekers, Incremental generation of lexical scanners, ACM Transactions on Programming Languages and Systems (TOPLAS), v.14 n.4, p.490-520, Oct. 1992
	Alfredo Ferro , Giovanni Gallo , Rosalba Giugno , Alfredo Pulvirenti, Best-Match Retrieval for Structured Images, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.23 n.7, p.707-718, July 2001
	Extending Graham-Glanville techniques for optimal code generation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.6, p.973-1001, Nov. 2000
	Richard Cole , Ramesh Hariharan , Piotr Indyk, Tree pattern matching and subset matching in deterministic O(n log3 n)-time, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.245-254, January 17-19, 1999, Baltimore, Maryland, United States
	Sergio Antoy , Stephen Johnson, Formalization and abstract implementation of rewriting with nested rules, Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming, p.144-154, August 24-26, 2004, Verona, Italy
	Wim De Pauw , David Lorenz , John Vlissides , Mark Wegman, Execution patterns in object-oriented visualization, Proceedings of the 4th conference on USENIX Conference on Object-Oriented Technologies and Systems (COOTS), p.16-16, April 27-30, 1998, Santa Fe, New Mexico
	Yanhong Zhai , Bing Liu, Structured Data Extraction from the Web Based on Partial Tree Alignment, IEEE Transactions on Knowledge and Data Engineering, v.18 n.12, p.1614-1628, December 2006
	Guido Araujo , Sharad Malik, Code generation for fixed-point DSPs, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.3 n.2, p.136-161, April 1998
	J. T. -L. Wang , K. Zhang , K. Jeong , D. Shasha, A System for Approximate Tree Matching, IEEE Transactions on Knowledge and Data Engineering, v.6 n.4, p.559-571, August 1994
	Ashish Kumar Gupta , Dan Suciu, Stream processing of XPath queries with predicates, Proceedings of the 2003 ACM SIGMOD international conference on Management of data, June 09-12, 2003, San Diego, California
	Michael Benedikt , Wenfei Fan , Gabriel Kuper, Structural properties of XPath fragments, Theoretical Computer Science, v.336 n.1, p.3-31, 25 May 2005
	Christopher W. Fraser , David R. Hanson , Todd A. Proebsting, Engineering a simple, efficient code-generator generator, ACM Letters on Programming Languages and Systems (LOPLAS), v.1 n.3, p.213-226, Sept. 1992
	Philippe Aigrain , Susan L. Graham , Robert R. Henry , Marshall Kirk McKusick , Eduardo Pelegri-Llopart, Experience with a Graham-Glanville style code generator, ACM SIGPLAN Notices, v.19 n.6, p.13-24, June 1984
	Shurug Al-Khalifa , Cong Yu , H. V. Jagadish, Querying structured text in an XML database, Proceedings of the 2003 ACM SIGMOD international conference on Management of data, June 09-12, 2003, San Diego, California
	Gerome Miklau , Dan Suciu, Containment and equivalence for a fragment of XPath, Journal of the ACM (JACM), v.51 n.1, p.2-45, January 2004
	Philip J. Hatcher , Thomas W. Christopher, High-quality code generation via bottom-up tree pattern matching, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.119-130, January 01, 1986, St. Petersburg Beach, Florida
	Philip Bille, A survey on tree edit distance and related problems, Theoretical Computer Science, v.337 n.1-3, p.217-239, 9 June 2005
	K. Keutzer, DAGON: technology binding and local optimization by DAG matching, Proceedings of the 24th ACM/IEEE conference on Design automation, p.341-347, June 28-July 01, 1987, Miami Beach, Florida, United States
	K. Keutzer, DAGON: Technology binding and local optimization by DAG matching, Papers on Twenty-five years of electronic design automation, p.617-624, June 1988
	Alfred V. Aho , Mahadevan Ganapathi, Efficient tree pattern matching (extended abstract): an aid to code generation, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.334-340, January 14-16, 1985, New Orleans, Louisiana, United States
	Sun-Yuan Hsieh, Note: Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species, Theoretical Computer Science, v.370 n.1-3, p.299-308, February, 2007
	María-Inés Fernández-Camacho , José-Ramón Sánchez-Couso, Binary Search Trees, Recurrent Properties andWave Equations, Fundamenta Informaticae, v.81 n.4, p.409-439, December 2007
	Dan Suciu, From searching text to querying XML streams, Journal of Discrete Algorithms, v.2 n.1, p.17-32, March 2004
	Christoph M. Hoffman , Michael J. O'Donnell, Programming with Equations, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.1, p.83-112, Jan. 1982
	Wan Fokkink , Jasper Kamperman , Pum Walters, Lazy rewriting on eager machinery, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.1, p.45-86, Jan. 2000
	Wan Fokkink , Jasper Kamperman , Pum Walters, Within ARM's reach: compilation of left-linear rewrite systems via minimal rewrite systems, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.3, p.679-706, May 1998
	Feng Peng , Sudarshan S. Chawathe, XSQ: A streaming XPath engine, ACM Transactions on Database Systems (TODS), v.30 n.2, p.577-623, June 2005
	Mark G. J. van den Brand , J. Heering , P. Klint , P. A. Olivier, Compiling language definitions: the ASF+SDF compiler, ACM Transactions on Programming Languages and Systems (TOPLAS), v.24 n.4, p.334-368, July 2002
	S. Muthukrishnan , Krishna Palem, Non-standard stringology: algorithms and complexity, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.770-779, May 23-25, 1994, Montreal, Quebec, Canada
	Alfred V. Aho , Mahadevan Ganapathi , Steven W. K. Tjiang, Code generation using tree matching and dynamic programming, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.4, p.491-516, Oct. 1989
	Holger Meuss , Klaus U. Schulz, Complete answer aggregates for treelike databases: a novel approach to combine querying and navigation, ACM Transactions on Information Systems (TOIS), v.19 n.2, p.161-215, April 2001
	Christoph M. Hoffmann , Michael J. O`Donnell, Implementation of an interpreter for abstract equations, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.111-121, January 15-18, 1984, Salt Lake City, Utah, United States
	R. Sekar , I. V. Ramakrishnan , Andrei Voronkov, Term indexing, Handbook of automated reasoning, Elsevier Science Publishers B. V., Amsterdam, The Netherlands, 2001
	Kokichi Futatsugi , Joseph A. Goguen , Jean-Pierre Jouannaud , José Meseguer, Principles of OBJ2, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.52-66, January 14-16, 1985, New Orleans, Louisiana, United States
	Torben Amtoft , Charles Consel , Olivier Danvy , Karoline Malmkjær, The abstraction and instantiation of string-matching programs, The essence of computation: complexity, analysis, transformation, Springer-Verlag New York, Inc., New York, NY, 2002
	Dennis Shasha , Jason T. L. Wang , Rosalba Giugno, Algorithmics and applications of tree and graph searching, Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 03-05, 2002, Madison, Wisconsin
	B Wah , G J Li, Survey on special purpose computer architectures for AI, ACM SIGART Bulletin