{"id":"https://openalex.org/W2075337691","doi":"https://doi.org/10.1017/s0956796899003524","title":"Lambda terms for natural deduction, sequent calculus and cut elimination","display_name":"Lambda terms for natural deduction, sequent calculus and cut elimination","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2075337691","doi":"https://doi.org/10.1017/s0956796899003524","mag":"2075337691"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796899003524","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796899003524","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/C94BB5ECFC2E2B3F3EF4F8920A2840BC/S0956796899003524a.pdf/div-class-title-lambda-terms-for-natural-deduction-sequent-calculus-and-cut-elimination-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/C94BB5ECFC2E2B3F3EF4F8920A2840BC/S0956796899003524a.pdf/div-class-title-lambda-terms-for-natural-deduction-sequent-calculus-and-cut-elimination-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016150987","display_name":"Henk Barendregt","orcid":"https://orcid.org/0000-0002-3735-4078"},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]},{"id":"https://openalex.org/I84470341","display_name":"Catholic University of America","ror":"https://ror.org/047yk3s18","country_code":"US","type":"education","lineage":["https://openalex.org/I84470341"]}],"countries":["NL","US"],"is_corresponding":true,"raw_author_name":"HENK BARENDREGT","raw_affiliation_strings":["Department of Computer Science, Catholic University, Toernooiveld 1, 6525 ED Nijmegen, The Netherlands (e-mail:","Department of Computer Science, Catholic University, Toernooiveld 1, 6525 ED Nijmegen, The Netherlands (e-mail: [email\u00a0protected])#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Catholic University, Toernooiveld 1, 6525 ED Nijmegen, The Netherlands (e-mail:","institution_ids":["https://openalex.org/I145872427"]},{"raw_affiliation_string":"Department of Computer Science, Catholic University, Toernooiveld 1, 6525 ED Nijmegen, The Netherlands (e-mail: [email\u00a0protected])#TAB#","institution_ids":["https://openalex.org/I84470341"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031880141","display_name":"Silvia Ghilezan","orcid":"https://orcid.org/0000-0003-2253-8285"},"institutions":[{"id":"https://openalex.org/I170726198","display_name":"University of Novi Sad","ror":"https://ror.org/00xa57a59","country_code":"RS","type":"education","lineage":["https://openalex.org/I170726198"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"SILVIA GHILEZAN","raw_affiliation_strings":["Faculty of Engineering, University of Novi Sad, Trg Dositeja Obradovi\u0107a 6, 21000 Novi Sad, Yugoslavia (e-mail:","Faculty of Engineering, University of Novi Sad, Trg Dositeja Obradovi\u0107a 6, 21000 Novi Sad, Yugoslavia (e-mail: gsilvia@uns.ns.ac.yu)"],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, University of Novi Sad, Trg Dositeja Obradovi\u0107a 6, 21000 Novi Sad, Yugoslavia (e-mail:","institution_ids":["https://openalex.org/I170726198"]},{"raw_affiliation_string":"Faculty of Engineering, University of Novi Sad, Trg Dositeja Obradovi\u0107a 6, 21000 Novi Sad, Yugoslavia (e-mail: gsilvia@uns.ns.ac.yu)","institution_ids":["https://openalex.org/I170726198"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016150987"],"corresponding_institution_ids":["https://openalex.org/I145872427","https://openalex.org/I84470341"],"apc_list":null,"apc_paid":null,"fwci":1.5942,"has_fulltext":true,"cited_by_count":32,"citation_normalized_percentile":{"value":0.86925173,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"10","issue":"1","first_page":"121","last_page":"134"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9797999858856201,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9664000272750854,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sequent-calculus","display_name":"Sequent calculus","score":0.9018211364746094},{"id":"https://openalex.org/keywords/natural-deduction","display_name":"Natural deduction","score":0.8873741030693054},{"id":"https://openalex.org/keywords/sequent","display_name":"Sequent","score":0.8757054209709167},{"id":"https://openalex.org/keywords/cut-elimination-theorem","display_name":"Cut-elimination theorem","score":0.7257685661315918},{"id":"https://openalex.org/keywords/curry\u2013howard-correspondence","display_name":"Curry\u2013Howard correspondence","score":0.6632462739944458},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.6618133783340454},{"id":"https://openalex.org/keywords/system-f","display_name":"System F","score":0.6173308491706848},{"id":"https://openalex.org/keywords/lambda-calculus","display_name":"Lambda calculus","score":0.6152547001838684},{"id":"https://openalex.org/keywords/simply-typed-lambda-calculus","display_name":"Simply typed lambda calculus","score":0.6112908720970154},{"id":"https://openalex.org/keywords/typed-lambda-calculus","display_name":"Typed lambda calculus","score":0.610746443271637},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.5185278654098511},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.4766155779361725},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47416841983795166},{"id":"https://openalex.org/keywords/natural-number","display_name":"Natural number","score":0.435596227645874},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.4300968647003174},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37749698758125305},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33362680673599243},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3228505253791809},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2771415710449219},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2705082893371582},{"id":"https://openalex.org/keywords/proof-calculus","display_name":"Proof calculus","score":0.09404367208480835},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.061641186475753784}],"concepts":[{"id":"https://openalex.org/C65880906","wikidata":"https://www.wikidata.org/wiki/Q1771121","display_name":"Sequent calculus","level":3,"score":0.9018211364746094},{"id":"https://openalex.org/C62073222","wikidata":"https://www.wikidata.org/wiki/Q1572108","display_name":"Natural deduction","level":2,"score":0.8873741030693054},{"id":"https://openalex.org/C89421646","wikidata":"https://www.wikidata.org/wiki/Q843632","display_name":"Sequent","level":2,"score":0.8757054209709167},{"id":"https://openalex.org/C111404639","wikidata":"https://www.wikidata.org/wiki/Q376166","display_name":"Cut-elimination theorem","level":4,"score":0.7257685661315918},{"id":"https://openalex.org/C85343465","wikidata":"https://www.wikidata.org/wiki/Q975734","display_name":"Curry\u2013Howard correspondence","level":3,"score":0.6632462739944458},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.6618133783340454},{"id":"https://openalex.org/C55128367","wikidata":"https://www.wikidata.org/wiki/Q2552799","display_name":"System F","level":3,"score":0.6173308491706848},{"id":"https://openalex.org/C135790938","wikidata":"https://www.wikidata.org/wiki/Q242028","display_name":"Lambda calculus","level":2,"score":0.6152547001838684},{"id":"https://openalex.org/C61237538","wikidata":"https://www.wikidata.org/wiki/Q855192","display_name":"Simply typed lambda calculus","level":4,"score":0.6112908720970154},{"id":"https://openalex.org/C142156749","wikidata":"https://www.wikidata.org/wiki/Q2607208","display_name":"Typed lambda calculus","level":3,"score":0.610746443271637},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.5185278654098511},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.4766155779361725},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47416841983795166},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.435596227645874},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.4300968647003174},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37749698758125305},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33362680673599243},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3228505253791809},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2771415710449219},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2705082893371582},{"id":"https://openalex.org/C6489637","wikidata":"https://www.wikidata.org/wiki/Q7250002","display_name":"Proof calculus","level":3,"score":0.09404367208480835},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.061641186475753784},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1017/s0956796899003524","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796899003524","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/C94BB5ECFC2E2B3F3EF4F8920A2840BC/S0956796899003524a.pdf/div-class-title-lambda-terms-for-natural-deduction-sequent-calculus-and-cut-elimination-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.23.9553","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.9553","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.kun.nl/~silviagh/papers/bg.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.39.4097","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.4097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.kun.nl/pub/CompMath.Found/bg3.ps.Z","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.45.5100","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.5100","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.kun.nl/pub/CompMath.Found/bg2.ps.Z","raw_type":"text"},{"id":"pmh:oai:repository.ubn.ru.nl:2066/17262","is_oa":false,"landing_page_url":"http://hdl.handle.net/2066/17262","pdf_url":null,"source":{"id":"https://openalex.org/S4306401067","display_name":"Radboud Repository (Radboud University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145872427","host_organization_name":"Radboud University Nijmegen","host_organization_lineage":["https://openalex.org/I145872427"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Functional Programming, 10, 1, pp. 121-134","raw_type":"Article / Letter to editor"}],"best_oa_location":{"id":"doi:10.1017/s0956796899003524","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796899003524","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/C94BB5ECFC2E2B3F3EF4F8920A2840BC/S0956796899003524a.pdf/div-class-title-lambda-terms-for-natural-deduction-sequent-calculus-and-cut-elimination-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2075337691.pdf","grobid_xml":"https://content.openalex.org/works/W2075337691.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1487717359","https://openalex.org/W1488538795","https://openalex.org/W1494407580","https://openalex.org/W1678934127","https://openalex.org/W1795577507","https://openalex.org/W1930495812","https://openalex.org/W1979324125","https://openalex.org/W1983271240","https://openalex.org/W1988983596","https://openalex.org/W1990370351","https://openalex.org/W2010737695","https://openalex.org/W2027959102","https://openalex.org/W2030752324","https://openalex.org/W2044758536","https://openalex.org/W2055224523","https://openalex.org/W2086742209","https://openalex.org/W2126650211","https://openalex.org/W2134699386","https://openalex.org/W4206013133","https://openalex.org/W4210568629","https://openalex.org/W4211036707","https://openalex.org/W6814866840"],"related_works":["https://openalex.org/W2761902706","https://openalex.org/W3123171335","https://openalex.org/W2153353244","https://openalex.org/W32986836","https://openalex.org/W4205386752","https://openalex.org/W2075337691","https://openalex.org/W2055962247","https://openalex.org/W2042469880","https://openalex.org/W851658754","https://openalex.org/W2285424334"],"abstract_inverted_index":{"It":[0],"is":[1,6,62,113,119],"well":[2],"known":[3],"that":[4,165],"there":[5],"an":[7],"isomorphism":[8],"between":[9,41],"natural":[10,46,79],"deduction":[11,47,80],"derivations":[12,44,48],"and":[13,45,84],"typed":[14,166],"lambda":[15,74,108,149,167],"terms.":[16,109],"Moreover,":[17,129],"normalising":[18],"these":[19],"terms":[20,150,168],"corresponds":[21],"to":[22,78,87],"eliminating":[23],"cuts":[24],"in":[25,151],"the":[26,85,101,116,124,130,147,163],"equivalent":[27,68],"sequent":[28,42,88],"calculus":[29,43,89],"derivations.":[30],"Several":[31],"papers":[32],"have":[33],"been":[34],"written":[35],"on":[36],"this":[37],"topic.":[38],"The":[39,60,110,154],"correspondence":[40,61,126],"is,":[49],"however,":[50],"not":[51],"a":[52,136,159,170],"one-one":[53],"map,":[54],"which":[55],"causes":[56],"some":[57],"syntactic":[58],"technicalities.":[59],"best":[63],"explained":[64],"by":[65],"two":[66,94],"extensionally":[67],"type":[69,132],"assignment":[70,104,133],"systems":[71,95],"for":[72,99,106],"untyped":[73],"terms,":[75],"one":[76,118],"corresponding":[77],"(\u03bb":[81,90,139],"N":[82],")":[83],"other":[86],"L":[91,140],").":[92,142],"These":[93],"constitute":[96],"different":[97],"grammars":[98],"generating":[100],"same":[102],"(type":[103],"relation":[105],"untyped)":[107],"second":[111,131],"grammar":[112],"ambiguous,":[114],"but":[115],"first":[117],"not.":[120],"This":[121,143],"fact":[122,164],"explains":[123],"many-one":[125],"mentioned":[127],"above.":[128],"system":[134],"has":[135],"\u2018cut-free\u2019":[137],"fragment":[138,144],"cf":[141],"generates":[145],"exactly":[146],"typeable":[148],"normal":[152,171],"form.":[153,172],"cut":[155],"elimination":[156],"theorem":[157],"becomes":[158],"simple":[160],"consequence":[161],"of":[162],"possess":[169]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-23T09:07:50.710637","created_date":"2025-10-10T00:00:00"}