{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:54:39Z","timestamp":1776891279088,"version":"3.51.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","issue":"6","license":[{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[1999,11]]},"abstract":"<jats:p>\n                    We derive a confluent \u03bb-calculus with a catch\/throw mechanism (called \u03bb\n                    <jats:sub>ct<\/jats:sub>\n                    -calculus) from \nParigot's \u03bb\u03bc-calculus. We also present several translations from one calculus into the other \nwhich are morphisms for the reduction. We use them to show that the \u03bb\n                    <jats:sub>ct<\/jats:sub>\n                    -calculus is a \nretract of \u03bb\u03bc-calculus (these calculi are isomorphic if we consider only convertibility). As a \nby-product, we obtain the subject reduction property for the \u03bb\n                    <jats:sub>ct<\/jats:sub>\n                    -calculus, as well as the strong \nnormalization for \u03bb\n                    <jats:sub>ct<\/jats:sub>\n                    -terms typable in the second order classical natural deduction.\n                  <\/jats:p>","DOI":"10.1017\/s0956796899003512","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T09:26:15Z","timestamp":1027761975000},"page":"625-647","source":"Crossref","is-referenced-by-count":15,"title":["A confluent \u03bb-calculus with a catch\/throw mechanism"],"prefix":"10.46298","volume":"9","author":[{"given":"TRISTAN","family":"CROLARD","sequence":"first","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[1999,11,1]]},"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796899003512","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:18:31Z","timestamp":1776889111000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796899003512\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,11]]},"references-count":0,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1999,11]]}},"alternative-id":["S0956796899003512"],"URL":"https:\/\/doi.org\/10.1017\/s0956796899003512","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,11]]}}}