{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T08:25:52Z","timestamp":1746001552044},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677154"},{"type":"electronic","value":"9783540450221"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45022-x_51","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T23:57:25Z","timestamp":1194998245000},"page":"600-611","source":"Crossref","is-referenced-by-count":13,"title":["Revisiting the Correspondence between Cut Elimination and Normalisation"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 Esp\u00fdrito","family":"Santo","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,2,18]]},"reference":[{"issue":"2","key":"51_CR1","doi-asserted-by":"publisher","first-page":"755","DOI":"10.2307\/2275572","volume":"62","author":"V. Danos","year":"1997","unstructured":"V. Danos, J-B. Joinet, and H. Schellinx. A new deconstructive logic: linear logic. The Journal of Symbolic Logic, 62(2):755\u2013807, 1997.","journal-title":"The Journal of Symbolic Logic"},{"key":"51_CR2","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1005099619660","volume":"60","author":"R. Dyckhoff","year":"1998","unstructured":"R. Dyckhoff and L. Pinto. Cut-elimination and a permutation-free sequent calculus for intuitionistic logic. Studia Logica, 60:107\u2013118, 1998.","journal-title":"Studia Logica"},{"key":"51_CR3","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0304-3975(98)00138-8","volume":"212","author":"R. Dyckhoff","year":"1999","unstructured":"R. Dyckhoff and L. Pinto. Permutability of proofs in intuitionistic sequent calculi. Theoretical Computer Science, 212:141\u2013155, 1999.","journal-title":"Theoretical Computer Science"},{"key":"51_CR4","unstructured":"J. Esp\u00fdrito Santo, 2000. PhD Thesis (in preparation)."},{"key":"51_CR5","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/0304-3975(93)90011-H","volume":"110","author":"J. Gallier","year":"1993","unstructured":"J. Gallier. Constructive logics. Part I. Theoretical Computer Science, 110:248\u2013339, 1993.","journal-title":"Theoretical Computer Science"},{"key":"51_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BFb0022247","volume-title":"Proceedings of CSL\u201994","author":"H. Herbelin","year":"1995","unstructured":"H. Herbelin. A \u03bb-calculus structure isomorphic to a Gentzen-style sequent calculus structure. In L. Pacholski and J. Tiuryn, editors, Proceedings of CSL\u201994, volume 933 of Lecture Notes in Computer Science, pages 61\u201375. Springer-Verlag, 1995."},{"key":"51_CR7","unstructured":"H. Herbelin. Sequents qu\u2019on calcule, 1995. PhD Thesis, Universit\u00e9 Paris VII."},{"key":"51_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013061","volume-title":"Int. Conf. Logic Prog. Automated Reasoning","author":"M. Parigot","year":"1992","unstructured":"M. Parigot. \u03bb\u03bc-calculus: an algorithmic interpretation of classic natural deduction. In Int. Conf. Logic Prog. Automated Reasoning, volume 624 of Lecture Notes in Computer Science. Springer Verlag, 1992."},{"key":"51_CR9","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0003-4843(77)80004-1","volume":"12","author":"G. Pottinger","year":"1977","unstructured":"G. Pottinger. Normalization as a homomorphic image of cut-elimination. Annals of Mathematical Logic, 12:323\u2013357, 1977.","journal-title":"Annals of Mathematical Logic"},{"key":"51_CR10","volume-title":"Natural Deduction. A Proof-Theoretical Study","author":"D. Prawitz","year":"1965","unstructured":"D. Prawitz. Natural Deduction. A Proof-Theoretical Study. Almquist and Wiksell, Stockholm, 1965."},{"key":"51_CR11","unstructured":"A.M. Ungar. Normalization, Cut-eliminations and the Theory of Proofs. Number 28 in CSLI Lecture Notes. 1992."},{"key":"51_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of TLCA\u201999","author":"C. Urban","year":"1999","unstructured":"C. Urban and G. Bierman. Strong normalisation of cut-elimination in classical logic. In Proceedings of TLCA\u201999, Lecture Notes in Computer Science. Springer-Verlag, 1999."},{"key":"51_CR13","unstructured":"R. Vestergaard and J. Wells. Cut rules and explicit substitutions. In Second International Workshop on Explicit Substitutions, 1999."},{"key":"51_CR14","unstructured":"P. Wadler. A Curry-Howard isomorphism for sequent calculus, 1993. Manuscript."},{"key":"51_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0003-4843(74)90010-2","volume":"7","author":"J. Zucker","year":"1974","unstructured":"J. Zucker. The correspondence between cut-elimination and normalization. Annals of Mathematical Logic, 7:1\u2013112, 1974.","journal-title":"Annals of Mathematical Logic"}],"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-45022-X_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T10:00:41Z","timestamp":1551088841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45022-X_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677154","9783540450221"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45022-x_51","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}