{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:56:35Z","timestamp":1725562595507},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221647"},{"type":"electronic","value":"9783540248491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24849-1_13","type":"book-chapter","created":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T20:34:24Z","timestamp":1281299664000},"page":"194-209","source":"Crossref","is-referenced-by-count":2,"title":["Confluence and Strong Normalisation of the Generalised Multiary \u03bb-Calculus"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 Esp\u00edrito","family":"Santo","sequence":"first","affiliation":[]},{"given":"Lu\u00eds","family":"Pinto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Artificial Intelligence","first-page":"354","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"J. Esp\u00edrito Santo","year":"2002","unstructured":"Esp\u00edrito Santo, J.: An isomorphism between a fragment of sequent calculus and an extension of natural deduction. In: Baaz, M., Voronkov, A. (eds.) LPAR 2002. LNCS (LNAI), vol.\u00a02514, pp. 354\u2013366. Springer, Heidelberg (2002)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/3-540-44904-3_20","volume-title":"Typed Lambda Calculi and Applications","author":"J. Esp\u00edrito Santo","year":"2003","unstructured":"Esp\u00edrito Santo, J., Pinto, L.: Permutative conversions in intuitionistic multiary sequent calculus with cuts. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, vol.\u00a02701, pp. 286\u2013300. Springer, Heidelberg (2003)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BFb0022247","volume-title":"Computer Science Logic","author":"H. Herbelin","year":"1995","unstructured":"Herbelin, H.: A \u03bb-calculus structure isomorphic to a Gentzen-style sequent calculus structure. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol.\u00a0933, pp. 61\u201375. Springer, Heidelberg (1995)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/10721975_10","volume-title":"Rewriting Techniques and Applications","author":"F. Joachimski","year":"2000","unstructured":"Joachimski, F., Matthes, R.: Standardization and confluence for a Lambda Calculus with generalized applications. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol.\u00a01833, pp. 141\u2013155. Springer, Heidelberg (2000)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s00153-002-0156-9","volume":"42","author":"F. Joachimski","year":"2003","unstructured":"Joachimski, F., Matthes, R.: Short proofs of normalisation for the simply typed \u03bb- calculus, permutative conversions and G\u00f6del\u2019s T. Archive for Mathematical Logic\u00a042, 59\u201387 (2003)","journal-title":"Archive for Mathematical Logic"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0304-3975(98)00143-1","volume":"212","author":"H. Schwichtenberg","year":"1999","unstructured":"Schwichtenberg, H.: Termination of permutative conversions in intuitionistic Gentzen calculi. Theoretical Computer Science\u00a0212, 247\u2013260 (1999)","journal-title":"Theoretical Computer Science"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s001530100091","volume":"40","author":"J. Plato von","year":"2001","unstructured":"von Plato, J.: Natural deduction with general elimination rules. Archive for Mathematical Logic\u00a040, 541\u2013567 (2001)","journal-title":"Archive for Mathematical Logic"}],"container-title":["Lecture Notes in Computer Science","Types for Proofs and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24849-1_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:15:13Z","timestamp":1620011713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24849-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221647","9783540248491"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24849-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}