{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:51Z","timestamp":1725456051540},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590484"},{"type":"electronic","value":"9783540491781"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0014050","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T02:50:31Z","timestamp":1132714231000},"page":"139-153","source":"Crossref","is-referenced-by-count":6,"title":["Expanding extensional polymorphism"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Di Cosmo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adolfo","family":"Pipemo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"10_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":"10_CR2","unstructured":"Henk Barendregt. The Lambda Calculus; Its syntax and Semantics (revised edition). North Holland, 1984."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Pierre-Louis Curien and Roberto Di Cosmo. A confluent reduction system for the \u03bb-calculus with surjective pairing and terminal object. In Leach, Monien, and Artalejo, editors, Intern. Conf. on Automata, Languages and Programming (ICALP), volume 510 of Lecture Notes in Computer Science, pages 291\u2013302. Springer-Verlag, 1991.","DOI":"10.1007\/3-540-54233-7_142"},{"key":"10_CR4","unstructured":"Djordje Cubric. On free ccc. Distributed on the types mailing list, 1992."},{"key":"10_CR5","unstructured":"Roberto Di Cosmo and Delia Kesner. Simulating expansions without expansions. Technical Report LIENS-93-11\/INRIA 1911, LIENS-DMI and INRIA, 1993."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Roberto Di Cosmo and Delia Kesner. Modular properties of first order algebraic rewriting systems, recursion and extensional lambda calculi. In Intern. Conf. on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58201-0_90"},{"key":"10_CR7","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":"10_CR8","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":"10_CR9","volume-title":"PhD thesis, Dissertation","author":"A. Geser","year":"1990","unstructured":"Alfons Geser. Relative termination. PhD thesis, Dissertation, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Passau, Germany, 1990. Also available as: Report 91-03, Ulmer Informatik-Berichte, Universit\u00e4t Ulm, 1991."},{"key":"10_CR10","unstructured":"Colin Barry Jay and Neil Ghani. The virtues of eta-expansion. Technical Report ECS-LFCS-92-243,LFCS, 1992. University of Edimburgh."},{"key":"10_CR11","volume-title":"Th\u00e8se de doctoral","author":"D. Kesner","year":"1993","unstructured":"Delia Kesner. La definition de fonctions par cas \u00e1 l'aide de motifs dans des langages applicatifs. Th\u00e8se de doctoral, Universit\u00e9 de Paris XI, Orsay, december 1993. To appear."},{"key":"10_CR12","unstructured":"Gregory Mints. Teorija categorii i teoria dokazatelstv.I. Aktualnye problemy logiki i metodologii nauky, pages 252\u2013278, 1979."},{"key":"10_CR13","unstructured":"Dan Nesmith. An application of Klop's counterexample to a higher-order rewrite system. Draft Paper, 1989."}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0014050","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T00:37:58Z","timestamp":1586565478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0014050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590484","9783540491781"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0014050","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}