{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:02:09Z","timestamp":1725487329470},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540421177"},{"type":"electronic","value":"9783540451273"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45127-7_8","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:25:25Z","timestamp":1184603125000},"page":"77-92","source":"Crossref","is-referenced-by-count":11,"title":["Matching Power"],"prefix":"10.1007","author":[{"given":"Horatiu","family":"Cirstea","sequence":"first","affiliation":[]},{"given":"Claude","family":"Kirchner","sequence":"additional","affiliation":[]},{"given":"Luigi","family":"Liquori","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,5,8]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi and L. Cardelli. A Theory of Objects. Springer Verlag, 1996.","DOI":"10.1007\/978-1-4419-8598-9"},{"issue":"1-2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0304-3975(94)90209-7","volume":"122","author":"H. Ait-Kaci","year":"1994","unstructured":"H. Ait-Kaci, A. Podelski, and G. Smolka. A feature constraint system for logic programming with entailment. Theoretical Computer Science, 122(1-2):263\u2013283, 1994.","journal-title":"Theoretical Computer Science"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"P. Borovansk\u00fd, C. Kirchner, H. Kirchner, P.-E. Moreau, and C. Ringeissen. An overview of ELAN. In Proc. of WRLA, volume 15. Electronic Notes in Theoretical Computer Science, 1998.","DOI":"10.1016\/S1571-0661(05)82552-6"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"V. Breazu-Tannen. Combining algebra and higher-order types. In Proc. of LICS, pages 82\u201390, 1988.","DOI":"10.1109\/LICS.1988.5103"},{"issue":"5","key":"8_CR5","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/S0747-7171(89)80057-4","volume":"8","author":"H.-J. B\u00fcrckert","year":"1989","unstructured":"H.-J. B\u00fcrckert. Matching \u2014 A special case of unification? Journal of Symbolic Computation, 8(5):523\u2013536, 1989.","journal-title":"Journal of Symbolic Computation"},{"key":"8_CR6","volume-title":"Calcul de r\u00e9\u00e9criture: fondements et applications","author":"H. Cirstea","year":"2000","unstructured":"H. Cirstea. Calcul de r\u00e9\u00e9criture: fondements et applications. Th\u00e8se de Doctorat d\u2019Universit\u00e9, Universit\u00e9 Henri Poincar\u00e9-Nancy I, 2000."},{"issue":"3","key":"8_CR7","first-page":"427","volume":"9","author":"H. Cirstea","year":"2001","unstructured":"H. Cirstea and C. Kirchner. The rewriting calculus \u2014 Part I and II. Logic Journal of the Interest Group in Pure and Applied Logics, 9(3):427\u2013498, 2001.","journal-title":"Logic Journal of the Interest Group in Pure and Applied Logics"},{"key":"8_CR8","volume-title":"Technical Report A00-R-363","author":"H. Cirstea","year":"2000","unstructured":"H. Cirstea, C. Kirchner, and L. Liquori. Matching Power. Technical Report A00-R-363, LORIA, Nancy, 2000."},{"key":"8_CR9","series-title":"Lect Notes Comput Sci","first-page":"166","volume-title":"Proc. of FOSSACS","author":"H. Cirstea","year":"2001","unstructured":"H. Cirstea, C. Kirchner, and L. Liquori. The Rho Cube. In Proc. of FOSSACS, volume 2030 of LNCS, pages 166\u2013180. Springer-Verlag, 2001."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"M. Clavel, S. Eker, P. Lincoln, and J. Meseguer. Principles of Maude. In Proc. of WRLA, volume 4. Electronic Notes in Theoretical Computer Science, 1996.","DOI":"10.1016\/S1571-0661(04)00034-9"},{"key":"8_CR11","unstructured":"L. Colson. Une structure de donn\u00e9es pour le \u03bb-calcul typ\u00e9. Private Communication, 1988."},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0168-0072(94)90083-3","volume":"69","author":"G. Dowek","year":"1994","unstructured":"G. Dowek. Third order matching is decidable. Annals of Pure and Applied Logic, 69:135\u2013155, 1994.","journal-title":"Annals of Pure and Applied Logic"},{"key":"8_CR13","unstructured":"Hubert Dubois and H\u00e9l\u00e8ne Kirchner. Objects, rules and strategies in ELAN., 2000. Submitted."},{"issue":"1","key":"8_CR14","first-page":"3","volume":"1","author":"K. Fisher","year":"1994","unstructured":"K. Fisher, F. Honsell, and J. C. Mitchell. A Lambda Calculus of Objects and Method Specialization. Nordic Journal of Computing, 1(1):3\u201337, 1994.","journal-title":"Nordic Journal of Computing"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"K. Futatsugi and A. Nakagawa. An overview of CAFE specification environment\u2013an algebraic approach for creating, verifying, and maintaining formal specifications over networks. In Proc. of FEM, 1997.","DOI":"10.1109\/ICFEM.1997.630424"},{"key":"8_CR16","series-title":"Lect Notes Comput Sci","first-page":"137","volume-title":"Proc. of ICALP","author":"J. Gallier","year":"1989","unstructured":"J. Gallier and V. Breazu-Tannen. Polymorphic rewriting conserves algebraic strong normalization and confluence. In Proc. of ICALP, volume 372 of LNCS, pages 137\u2013150. Springer-Verlag, 1989."},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"P. Di Gianantonio, F. Honsell, and L. Liquori. A Lambda Calculus of Objects with Self-inflicted Extension. In Proc. of OOPSLA, pages 166\u2013178. The ACM Press, 1998.","DOI":"10.1145\/286936.286955"},{"key":"8_CR18","series-title":"Lect Notes Comput Sci","first-page":"258","volume-title":"Proc. of CTRS","author":"J. A. Goguen","year":"1987","unstructured":"J. A. Goguen, C. Kirchner, H. Kirchner, A. M\u00e9grelis, J. Meseguer, and T. Winkler. An introduction to OBJ-3. In Proc. of CTRS, volume 308 of LNCS, pages 258\u2013263. Springer-Verlag, 1987."},{"issue":"1","key":"8_CR19","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"C. M. Hoffmann","year":"1982","unstructured":"C. M. Hoffmann and M. J. O\u2019Donnell. Pattern matching in trees. Journal of the ACM, 29(1):68\u201395, 1982.","journal-title":"Journal of the ACM"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF00264598","volume":"11","author":"G. Huet","year":"1978","unstructured":"G. Huet and B. Lang. Proving and applying program transformations expressed with second-order patterns. Acta Informatica, 11:31\u201355, 1978.","journal-title":"Acta Informatica"},{"key":"8_CR21","unstructured":"J.-M. Hullot. Associative-commutative pattern matching. In Proc. of IJCAI, 1979."},{"issue":"2","key":"8_CR22","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/S0304-3975(96)00161-2","volume":"173","author":"J.P. Jouannaud","year":"1997","unstructured":"J.P. Jouannaud and M. Okada. Abstract data type systems. Theoretical Computer Science, 173(2):349\u2013391, 1997.","journal-title":"Theoretical Computer Science"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"C. Kirchner and H. Kirchner. Rewriting, solving, proving. A preliminary version of a book available at http:\/\/www.loria.fr\/~ckirchne\/rsp.ps.gz , 1999.","DOI":"10.1007\/978-3-642-59851-7_9"},{"key":"8_CR24","unstructured":"C. Kirchner, H. Kirchner, and M. Vittek. Designing constraint logic programming languages using computational systems. In Principles and Practice of Constraint Programming. The Newport Papers., chapter 8, pages 131\u2013158. The MIT press, 1995."},{"key":"8_CR25","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(93)90091-7","volume":"121","author":"J.W. Klop","year":"1993","unstructured":"J.W. Klop, V. van Oostrom, and F. van Raamsdonk. Combinatory reduction systems: introduction and survey. Theoretical Computer Science, 121:279\u2013308, 1993.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"8_CR26","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. E. Knuth","year":"1977","unstructured":"Donald E. Knuth, J. Morris, and V. Pratt. Fast pattern matching in strings. SIAM Journal of Computing, 6(2):323\u2013350, 1977.","journal-title":"SIAM Journal of Computing"},{"key":"8_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1007\/3-540-18625-5_64","volume-title":"Proc. FCT & TCS","author":"A. Laville","year":"1987","unstructured":"A. Laville. Lazy pattern matching in the ML language. In Proc. FCT & TCS, volume 287 of LNCS, pages 400\u2013419. Springer-Verlag, 1987."},{"key":"8_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BFb0038698","volume-title":"Proc. of ELP","author":"D. Miller","year":"1991","unstructured":"D Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. In Proc. of ELP, volume 475 of LNCS, pages 253\u2013281. Springer-Verlag, 1991."},{"key":"8_CR29","unstructured":"Tobias Nipkow and Christian Prehofer. Higher-order rewriting and equational reasoning. In W. Bibel and P. Schmitt, editors, Automated Deduction \u2014 A Basis for Applications. Volume I: Foundations. Kluwer, 1998."},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"M. Okada. Strong normalizability for the combined system of the typed \u03bb calculus and an arbitrary convergent term rewrite system. In Proc. of ISSAC, pages 357\u2013363. ACM Press, 1989.","DOI":"10.1145\/74540.74582"},{"issue":"10","key":"8_CR31","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1017\/S0960129500003108","volume":"3","author":"V. Padovani","year":"2000","unstructured":"V. Padovani. Decidability of fourth-order matching. Mathematical Structures in Computer Science, 3(10):361\u2013372, 2000.","journal-title":"Mathematical Structures in Computer Science"},{"key":"8_CR32","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/322248.322251","volume":"28","author":"G. Peterson","year":"1981","unstructured":"G. Peterson and M. E. Stickel. Complete sets of reductions for some equational theories. Journal of the ACM, 28:233\u2013264, 1981.","journal-title":"Journal of the ACM"},{"key":"8_CR33","unstructured":"S. Peyton-Jones. The implementation of functional programming languages. Prentice Hall, Inc., 1987."},{"key":"8_CR34","unstructured":"\u00c9quipe Protheo. The Elan Home Page, 2001. http:\/\/elan.loria.fr."},{"key":"8_CR35","unstructured":"A. van Deursen, J. Heering, and P. Klint. Language Prototyping. World Scientific, 1996."},{"key":"8_CR36","unstructured":"V. van Oostrom. Lambda calculus with patterns. Technical Report IR-228, Vrije Universiteit, November 1990."},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"P. Viry. Input\/Output for ELAN. In Proc. of WRLA, volume 4. Electronic Notes in Theoretical Computer Science, 1996.","DOI":"10.1016\/S1571-0661(04)00033-7"},{"key":"8_CR38","doi-asserted-by":"crossref","unstructured":"E. Visser and Z.e.A. Benaissa. A core language for rewriting. In Proc. of WRLA, volume 15. Electronic Notes in Theoretical Computer Science, 1998.","DOI":"10.1016\/S1571-0661(05)80027-1"},{"key":"8_CR39","doi-asserted-by":"crossref","unstructured":"D. A. Wolfram. The Clausal Theory of Types, volume 21 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1993.","DOI":"10.1017\/CBO9780511569906"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45127-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:36:10Z","timestamp":1556681770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45127-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540421177","9783540451273"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/3-540-45127-7_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}