{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T02:27:33Z","timestamp":1784255253063,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540582014","type":"print"},{"value":"9783540485667","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58201-0_90","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:33:24Z","timestamp":1330270404000},"page":"462-472","source":"Crossref","is-referenced-by-count":6,"title":["Combining first order algebraic rewriting systems, recursion and extensional lambda calculi"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Cosmo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Delia","family":"Kesner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Yohji Akama. On mints' reductions for ccc-calculus. In Typed Lambda Calculus and Applications, number 664 in LNCS, pages 1\u201312. Springer Verlag, 1993.","DOI":"10.1007\/BFb0037094"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Val Breazu-Tannen. Combining algebra and higher order types. In IEEE, editor, Proceedings of the Symposium on Logic in Computer Science (LICS), pages 82\u201390, July 1988.","DOI":"10.1109\/LICS.1988.5103"},{"key":"38_CR3","unstructured":"Val Breazu-Tannen and Jean Gallier. Polymorphic rewiting preserves algebraic confluence. Information and Computation, 1992. To appear."},{"key":"38_CR4","unstructured":"Djordje Cubric. On free ccc. Distributed on the types mailing list, 1992."},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Roberto Di Cosmo and Delia Kesner. A confluent reduction for the extensional typed \u03bb-calculus with pairs, sums, recursion and terminal object. In Andrzej Lingas, editor, Intern. Conf. on Automata, Languages and Programming (ICALP), volume 700 of Lecture Notes in Computer Science, pages 645\u2013656. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56939-1_109"},{"key":"38_CR6","unstructured":"Roberto Di Cosmo and Delia Kesner. Simulating expansions without expansions. Mathematical Structures in Computer Science, 1994. A preliminary version is available as Technical Report LIENS-93-11\/INRIA 1911."},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Daniel J. Dougherty. Some lambda calculi with categorical sums and products. In Proc. of the Fifth International Conference on Rewriting Techniques and Applications (RTA), 1993.","DOI":"10.1007\/3-540-56868-9_12"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Brian Howard and John Mitchell. Operational and axiomatic semantics of pcf. In Proceedings of the LISP and Functional Programming Conference, pages 298\u2013306. ACM, 1990.","DOI":"10.1145\/91556.91677"},{"key":"38_CR9","unstructured":"Colin Barry Jay and Neil Ghani. The virtues of eta-expansion. Technical Report ECS-LFCS-92-243, LFCS, 1992. University of Edimburgh."},{"key":"38_CR10","first-page":"350","volume-title":"A computation model for executable higher-order algebraic specification languages","author":"J. Jouannaud","year":"1991","unstructured":"Jean-Pierre Jouannaud and Mitsuhiro Okada. A computation model for executable higher-order algebraic specification languages. In Proceedings, Sixth Annual IEEE Symposium on Logic in Computer Science, pages 350\u2013361, Amsterdam, The Netherlands, July 15\u201318 1991. IEEE Computer Society Press."},{"key":"38_CR11","volume-title":"Th\u00e8se de doctorat","author":"D. Kesner","year":"1993","unstructured":"Delia Kesner. La d\u00e9finition de fonctions par cas \u00e0 l'aide de motifs dans des langages applicatifs. Th\u00e8se de doctorat, Universit\u00e9 de Paris XI, Orsay, december 1993. To appear."},{"key":"38_CR12","unstructured":"Jan Wilhelm Klop. Combinatory reduction systems. Mathematical Center Tracts, 27, 1980."},{"key":"38_CR13","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(76)90009-8","volume":"2","author":"J. L\u00e9vy","year":"1976","unstructured":"Jean-Jaques L\u00e9vy. An algebraic interpretation of the \u03bb\u03b2\u03ba-calculus and a labelled \u03bb-calculus. Theoretical Computer Science, 2:97\u2013114, 1976.","journal-title":"Theoretical Computer Science"},{"key":"38_CR14","first-page":"83","volume":"68","author":"G. Mints","year":"1977","unstructured":"Gregory Mints. Closed categories and the theory of proofs. Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V.A. Steklova AN SSSR, 68:83\u2013114, 1977.","journal-title":"Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V.A. Steklova AN SSSR"},{"key":"38_CR15","unstructured":"Dan Nesmith. An application of Klop's counterexample to a higher-order rewrite system. Draft Paper, 1989."},{"issue":"2\u20133","key":"38_CR16","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/0022-0000(87)90029-8","volume":"34","author":"A. Poign\u00e9","year":"1987","unstructured":"Axel Poign\u00e9 and Josef Voss. On the implementation of abstract data types by programming language constructs. Journal of Computer and System Science, 34(2\u20133):340\u2013376, April\/June 1987.","journal-title":"Journal of Computer and System Science"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58201-0_90.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:18:32Z","timestamp":1605647912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58201-0_90"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582014","9783540485667"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-58201-0_90","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}