{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T15:34:50Z","timestamp":1694619290785},"reference-count":31,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6072,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,12]]},"DOI":"10.1016\/s0304-3975(96)00121-1","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"201-220","source":"Crossref","is-referenced-by-count":13,"title":["Combining algebraic rewriting, extensional lambda calculi, and fixpoints"],"prefix":"10.1016","volume":"169","author":[{"given":"Roberto","family":"Di Cosmo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Delia","family":"Kesner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00121-1_BIB1","first-page":"1","article-title":"On Mints' reductions for ccc-Calculus","volume":"Vol. 664","author":"Akama","year":"1993"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB2","series-title":"The Lambda Calculus; Its syntax and Semantics","author":"Barendregt","year":"1984"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB3","series-title":"Proc. Symp. on Logic in Computer Science (LICS)","first-page":"82","article-title":"Combining algebra and higher order types","author":"Breazu-Tannen","year":"1988"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(91)90037-3","article-title":"Polymorphic rewriting preserves algebraic strong normalization","volume":"83","author":"Breazu-Tannen","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00121-1_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1994.1078","article-title":"Polymorphic rewriting preserves algebraic confluence","volume":"114","author":"Breazu-Tannen","year":"1994","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(96)00121-1_BIB6","series-title":"Internat. Conf. on Automata, Languages and Programming (ICALP)","first-page":"291","article-title":"A confluent reduction system for the \u03bb-calculus with surjective pairing and terminal object","volume":"Vol. 510","author":"Curien","year":"1991"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB7","series-title":"On free CCC, Distributed on the types mailing list","author":"Cubric","year":"1992"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB8","series-title":"Formal Models and Semantics","first-page":"243","article-title":"Rewrite systems","volume":"Vol. B","author":"Dershowitz","year":"1990"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB9","series-title":"Internat. Conf. on Automata, Languages and Programming (ICALP)","first-page":"462","article-title":"Combining first order algebraic rewriting systems, recursion and extensional lambda calculi","volume":"Vol. 820","author":"Di Cosmo","year":"1994"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0960129500000505","article-title":"Simulating expansions without expansions","volume":"4","author":"Di Cosmo","year":"1994","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00121-1_BIB11","unstructured":"A preliminary version is available as Tech. Report LIENS-93-11\/INRIA 1911."},{"key":"10.1016\/S0304-3975(96)00121-1_BIB12","series-title":"Proc. 5th Internat. Conf. on Rewriting Techniques and Applications (RTA)","article-title":"Some lambda calculi with categorical sums and products","author":"Dougherty","year":"1993"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB13","series-title":"Proc. LISP and Functional Programming Conf.","first-page":"298","article-title":"Operational and axiomatic semantics of pcf","author":"Howard","year":"1990"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB14","doi-asserted-by":"crossref","DOI":"10.1017\/S0956796800001301","article-title":"The virtues of eta-expansion","author":"Jay","year":"1992"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1017\/S0956796800001301","article-title":"The virtues of eta-expansion","volume":"5","author":"Jay","year":"1995","journal-title":"J. Functional Programming"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB16","series-title":"Proc. 6th Ann. IEEE Symp. on Logic in Computer Science","first-page":"350","article-title":"A computation model for executable higher-order algebraic specification languages","author":"Jouannaud","year":"1991"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB17","series-title":"The confluence of the \u03bbse-calculus via a generalized interpretation method","author":"Kamareddine","year":"1995"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB18","article-title":"La d\u00e9finition de fonctions par cas \u00e0 l'aide de motifs dans des langages applicatifs","author":"Kesner","year":"1993"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB19","article-title":"Reasoning about layered, wildcard and product patterns","volume":"Vol. 850","author":"Kesner","year":"1994"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB20","article-title":"Combinatory reduction systems","volume":"27","author":"Klop","year":"1980","journal-title":"Math. Center Tracts"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB21","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":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00121-1_BIB22","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(93)90091-7","article-title":"Combinatory reduction systems: introduction and survey","author":"Klop","year":"1993"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB23","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(76)90009-8","article-title":"An algebraic interpretation of the \u03bb\u03b2\u03ba-calculus and a labelled \u03bb-calculus","volume":"2","author":"L\u00e9vy","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00121-1_BIB24","first-page":"83","article-title":"Closed categories and the theory of proofs","volume":"68","author":"Mints","year":"1977"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB25","series-title":"Aktualnye problemy logiki i metodologii nauky","first-page":"252","article-title":"Teorija categorii i teoria dokazatelstv. I","author":"Mints","year":"1979"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB26","article-title":"Algebraic rewriting preserves (\u03b2, \u03b7) confluence in the typed lambda calculus","author":"Necula","year":"1994"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB27","article-title":"An application of klop's counterexample to a higher-order rewrite system","author":"Nesmith","year":"1989"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB28","first-page":"342","article-title":"Higher-order critical pairs","volume":"Vol. 6","author":"Nipkow","year":"1991"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB29","series-title":"Proc. 20th Internat. Symp. on Symbolic and Algebraic Computation","article-title":"Strong normalizability for the combined system of the types lambda calculus and an arbitrary convergent term rewrite system","author":"Okada","year":"1989"},{"key":"10.1016\/S0304-3975(96)00121-1_BIB30","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/0022-0000(87)90029-8","article-title":"On the implementation of abstract data types by programming language constructs","volume":"34","author":"Poign\u00e9","year":"1987","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(96)00121-1_BIB31","series-title":"Developing developments","author":"van Oostrom","year":"1994"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596001211?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596001211?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:56:17Z","timestamp":1555390577000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596001211"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["S0304397596001211"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00121-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}