{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:28:33Z","timestamp":1761596913025},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3406,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1016\/s1571-0661(05)82526-5","type":"journal-article","created":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T13:46:30Z","timestamp":1116510390000},"page":"3-19","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Rewriting Calculus with(out) Types"],"prefix":"10.1016","volume":"71","author":[{"given":"Horatiu","family":"Cirstea","sequence":"first","affiliation":[]},{"given":"Claude","family":"Kirchner","sequence":"additional","affiliation":[]},{"given":"Luigi","family":"Liquori","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)82526-5_BIB1","series-title":"Lambda Calculus: its Syntax and Semantics","author":"Barendregt","year":"1984"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB2","first-page":"118","article-title":"Lambda Calculi with Types","volume":"II","author":"Barendregt","year":"1992"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB3","series-title":"Proc. of POPL","article-title":"Pure Pattern Type Systems","author":"Barthe","year":"2003"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB4","first-page":"82","article-title":"Combining Algebra and Higher-order Types","author":"Breazu-Tannen","year":"1988","journal-title":"Proc. of LICS"},{"issue":"1","key":"10.1016\/S1571-0661(05)82526-5_BIB5","doi-asserted-by":"crossref","DOI":"10.1016\/S0304-3975(99)00231-5","article-title":"Mobile Ambients","volume":"240","author":"Cardelli","year":"2000","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB6","doi-asserted-by":"crossref","first-page":"56","DOI":"10.2307\/2266170","article-title":"A Formulation of the Simple Theory of Types","volume":"5","author":"Church","year":"1941","journal-title":"Journal of Symbolic Logic"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB7","series-title":"Th\u00e8se de Doctorat d'Universit\u00e9","article-title":"Calcul de R\u00e9\u00e9criture: Fondements et Applications","author":"Cirstea","year":"2000"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB8","article-title":"\u03c1-calculus. Its Syntax and Basic Properties","author":"Cirstea","year":"1998","journal-title":"Proc. of Workshop CCL"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB9","article-title":"An Introduction to the Rewriting Calculus","author":"Cirstea","year":"1999","journal-title":"Research Report RR-3818, INRIA"},{"issue":"3","key":"10.1016\/S1571-0661(05)82526-5_BIB10","first-page":"427","article-title":"The rewriting calculus \u2014 Part I and II","volume":"9","author":"Cirstea","year":"2001","journal-title":"Logic Journal of the Interest Group in Pure and Applied Logics"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB11","series-title":"Proc. of RTA, volume 2051 of LNCS","first-page":"77","article-title":"Matching Power","author":"Cirstea","year":"2001"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB12","first-page":"166","article-title":"The Rho Cube","author":"Cirstea","year":"2001","journal-title":"Proc. of FOSSACS, volume 2030 of LNCS"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB13","series-title":"Proc. of POPL","first-page":"207","article-title":"Principal Type-Schemes for Functional Programs","author":"Damas","year":"1982"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB14","series-title":"Proc. of ASA\/MA, volume 4 of LNCS","first-page":"73","article-title":"Principles of Mobile Maude","author":"Dur\u00e1n","year":"2000"},{"issue":"5","key":"10.1016\/S1571-0661(05)82526-5_BIB15","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1093\/comjnl\/38.5.381","article-title":"Associative-Commutative Matching Via Bipartite Graph Matching","volume":"38","author":"Eker","year":"1995","journal-title":"The Computer Journal"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB16","series-title":"Proc. of RTA, volume 2378 of LNCS","first-page":"66","article-title":"Exceptions in the Rewriting Calculus","author":"Faure","year":"2002"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB17","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0304-3975(89)90069-8","article-title":"A Syntactic Theory of Sequential State","volume":"69","author":"Felleisen","year":"1989","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB18","series-title":"Proc. of CONCUR, volume 1119 of LNCS","first-page":"406","article-title":"A Calculus of Mobile Agents","author":"Fournet","year":"1996"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB19","series-title":"Proc. of ICALP, volume 372 of LNCS","first-page":"137","article-title":"Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence","author":"Gallier","year":"1989"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB20","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0304-3975(86)90044-7","article-title":"The System F of Variable Types, Fifteen Years Later","volume":"45","author":"Girard","year":"1986","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB21","series-title":"Proc. of FPCA, volume 2378","first-page":"66","article-title":"A Generalization of Exceptions and Control in ML-like Languages","author":"Gunter","year":"1995"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB22","article-title":"Associative-Commutative Pattern Matching","author":"Hullot","year":"1979","journal-title":"Proc. of IJCAI"},{"issue":"2","key":"10.1016\/S1571-0661(05)82526-5_BIB23","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/S0304-3975(96)00161-2","article-title":"Abstract Data Type Systems","volume":"173","author":"Jouannaud","year":"1997","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB24","series-title":"Proc. of POPL","first-page":"80","article-title":"Inheritance in Smalltalk-80: A Denotational Definition","author":"Kamin","year":"1988"},{"issue":"1","key":"10.1016\/S1571-0661(05)82526-5_BIB25","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1006\/inco.1996.0004","article-title":"A Typed Pattern Calculus","volume":"124","author":"Kesner","year":"1996","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB26","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(93)90091-7","article-title":"Combinatory Reduction Systems: Introduction and Survey","volume":"121","author":"Klop","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB27","series-title":"Proc. of POPL","first-page":"88","article-title":"Polymorphic Type Inference","author":"Leivant","year":"1983"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB28","unstructured":"L. Liquori. Semantica e Pragmatica di un Linguaggio Funzionale con le Continuazioni Esplicite. Laurea in Science dell'Informazione, University of Udine, 1990. In Italian, 74 pp."},{"key":"10.1016\/S1571-0661(05)82526-5_BIB29","series-title":"Proc. of ELP, volume 475 of LNCS","first-page":"253","article-title":"A logic programming language with lambda-abstraction, function variables, and simple unification","author":"Miller","year":"1991"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB30","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","article-title":"Uniform Proofs as a Foundation for Logic Programming","volume":"51","author":"Miller","year":"1991","journal-title":"Annals of Pure and Applied Logics"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB31","series-title":"Automated Deduction \u2014 A Basis for Applications. Volume I: Foundations","article-title":"Higher-Order Rewriting and Equational Reasoning","author":"Nipkow","year":"1998"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB32","series-title":"Proc. of ISSAC","first-page":"357","article-title":"Strong Normalizability for the Combined System of the Typed \u03bb Calculus and an Arbitrary Convergent Term Rewrite System","author":"Okada","year":"1989"},{"issue":"2","key":"10.1016\/S1571-0661(05)82526-5_BIB33","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1145\/349214.349230","article-title":"Type-based Analysis of Uncaught Exceptions","volume":"22","author":"Pessaux","year":"2000","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB34","series-title":"The Implementation of Functional Programming Languages","author":"Peyton Jones","year":"1987"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB35","series-title":"Technical Report DAIMI FN-19","article-title":"A Structural Approach to Operational Semantics","author":"Plotkin","year":"1981"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB36","series-title":"Technical Report IR-228, Faculteit der Wiskunde en Informatica","article-title":"Lambda Calculus with Patterns","author":"van Oostrom","year":"1990"},{"key":"10.1016\/S1571-0661(05)82526-5_BIB37","series-title":"The Clausal Theory of Types, volume 21 of Cambridge Tracts in Theoretical Computer Science","author":"Wolfram","year":"1993"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825265?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825265?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T10:57:57Z","timestamp":1548500277000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105825265"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":37,"alternative-id":["S1571066105825265"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)82526-5","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}