{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:11:20Z","timestamp":1761610280875,"version":"build-2065373602"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":5688,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1998]]},"DOI":"10.1016\/s1571-0661(05)01181-3","type":"journal-article","created":{"date-parts":[[2005,4,13]],"date-time":"2005-04-13T14:20:46Z","timestamp":1113402046000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Algorithms for Equality and Unification in the Presence of Notational Definitions"],"prefix":"10.1016","volume":"17","author":[{"given":"Frank","family":"Pfenning","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Sch\u00fcrmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1998","series-title":"The Coq Proof Assistant, Reference Manual, Version 6.2","author":"Barras","key":"10.1016\/S1571-0661(05)01181-3_bib1"},{"key":"10.1016\/S1571-0661(05)01181-3_bib2","unstructured":"Iliano Cervesato and Frank Pfenning. A linear spine calculus. Technical Report CMU-CS-97-125, CMU, 1997."},{"key":"10.1016\/S1571-0661(05)01181-3_bib3","unstructured":"Gilles Dowek, Th\u00e9r\u00e8se Hardin, Claude Kirchner, and Frank Pfenning. Unification via explicit substitutions: The case of higher-order patterns. In Joint International Conference and Symposium on Logic Programming (JICSLP'96), Bonn, Germany, 1996."},{"key":"10.1016\/S1571-0661(05)01181-3_bib4","doi-asserted-by":"crossref","unstructured":"Herman Geuvers. The Church-Rosser property for \u03b2-reduction in typed \u03bb-calculi. In A. Scedrov, editor, Seventh Annual IEEE Symposium on Logic in Computer Science, pages 453\u2013460, Santa Cruz, California, June 1992.","DOI":"10.1109\/LICS.1992.185556"},{"key":"10.1016\/S1571-0661(05)01181-3_bib5","doi-asserted-by":"crossref","unstructured":"Timothy G. Griffin. Notational definition \u2014 a formal account. In Third Annual Symposium on Logic in Computer Science, Edinburgh, Scotland, pages 372\u2013383. IEEE, July 1988. 12","DOI":"10.1109\/LICS.1988.5134"},{"key":"10.1016\/S1571-0661(05)01181-3_bib6","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","article-title":"The integration of functions into logic programming: From theory to practice","volume":"19&20","author":"Hanus","year":"1994","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"10.1016\/S1571-0661(05)01181-3_bib7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/138027.138060","article-title":"A framework for defining logics","volume":"40","author":"Harper","year":"1993","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S1571-0661(05)01181-3_bib8","doi-asserted-by":"crossref","unstructured":"Chris Hankin and Daniel Le M\u00e9tayer. Deriving algorithms from type inference systems: Application to strictness analysis. In Proceedings of the Twenty-First Annual ACM Symposium on Principles of Programming Languages, Portland, pages 202\u2013212. ACM, January 1994.","DOI":"10.1145\/174675.177858"},{"key":"10.1016\/S1571-0661(05)01181-3_bib9","doi-asserted-by":"crossref","unstructured":"Robert Harper and Frank Pfenning. A module system for a programming language based on the LF logical framework. Journal of Logic and Computation. To appear. A preliminary version is available as Technical Report CMU-CS-92\u2013191, September 1992.","DOI":"10.21236\/ADA256731"},{"key":"10.1016\/S1571-0661(05)01181-3_bib10","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","article-title":"A unification algorithm for typed \u03bb-calculus","volume":"1","author":"Huet","year":"1975","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)01181-3_bib11","unstructured":"Zhaohui Luo and Robert Pollack. The LEGO proof development system: A user's manual. Technical Report ECS-LFCS-92\u2013211, University of Edinburgh, May 1992."},{"issue":"4","key":"10.1016\/S1571-0661(05)01181-3_bib12","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1093\/logcom\/1.4.497","article-title":"A logic programming language with lambda-abstraction, function variables, and simple unification","volume":"1","author":"Miller","year":"1991","journal-title":"Journal of Logic and Computation"},{"key":"10.1016\/S1571-0661(05)01181-3_bib13","doi-asserted-by":"crossref","unstructured":"S. Owre, J. M. Rushby, and N. Shankar. PVS: A prototype verification system. In Deepak Kapur, editor, 11th International Conference on Automated Deduction (CADE), volume 607 of Lecture Notes in Artificial Intelligence, pages 748\u2013752, Saratoga, NY, June 1992. Springer-Verlag.","DOI":"10.1007\/3-540-55602-8_217"},{"key":"10.1016\/S1571-0661(05)01181-3_bib14","doi-asserted-by":"crossref","unstructured":"Lawrence C. Paulson. Introduction to Isabelle, 1998.","DOI":"10.1007\/978-1-4612-1734-3_1"},{"key":"10.1016\/S1571-0661(05)01181-3_bib15","doi-asserted-by":"crossref","unstructured":"Carsten Sch\u00fcrmann and Frank Pfenning. Automated theorem proving in a simple meta-logic for LF. In Proceedings of the Fifteenth International Conference on Automated Deduction, pages 286\u2013300, Lindau, Germany, 1998.","DOI":"10.1007\/BFb0054266"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105011813?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105011813?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:06:19Z","timestamp":1761609979000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105011813"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"references-count":15,"alternative-id":["S1571066105011813"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)01181-3","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Algorithms for Equality and Unification in the Presence of Notational Definitions","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)01181-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Elsevier Science B.V. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}