{"id":"https://openalex.org/W2793582322","doi":"https://doi.org/10.1017/s0956796818000023","title":"A tutorial on computational classical logic and the sequent calculus","display_name":"A tutorial on computational classical logic and the sequent calculus","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2793582322","doi":"https://doi.org/10.1017/s0956796818000023","mag":"2793582322"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796818000023","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0956796818000023","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020454182","display_name":"Paul Downen","orcid":"https://orcid.org/0000-0003-0165-9387"},"institutions":[{"id":"https://openalex.org/I181233156","display_name":"University of Oregon","ror":"https://ror.org/0293rh119","country_code":"US","type":"education","lineage":["https://openalex.org/I181233156"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"PAUL DOWNEN","raw_affiliation_strings":["University of Oregon, USA (e-mail:"],"affiliations":[{"raw_affiliation_string":"University of Oregon, USA (e-mail:","institution_ids":["https://openalex.org/I181233156"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064696313","display_name":"Zena M. Ariola","orcid":"https://orcid.org/0000-0001-5551-8294"},"institutions":[{"id":"https://openalex.org/I181233156","display_name":"University of Oregon","ror":"https://ror.org/0293rh119","country_code":"US","type":"education","lineage":["https://openalex.org/I181233156"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"ZENA M. ARIOLA","raw_affiliation_strings":["University of Oregon, USA (e-mail:"],"affiliations":[{"raw_affiliation_string":"University of Oregon, USA (e-mail:","institution_ids":["https://openalex.org/I181233156"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020454182"],"corresponding_institution_ids":["https://openalex.org/I181233156"],"apc_list":null,"apc_paid":null,"fwci":0.4887,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.71585589,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"28","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":1.0,"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":1.0,"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/T10142","display_name":"Formal Methods in Verification","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9972000122070312,"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","display_name":"Sequent","score":0.8470249176025391},{"id":"https://openalex.org/keywords/sequent-calculus","display_name":"Sequent calculus","score":0.8318476676940918},{"id":"https://openalex.org/keywords/cut-elimination-theorem","display_name":"Cut-elimination theorem","score":0.6437414884567261},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6108731627464294},{"id":"https://openalex.org/keywords/natural-deduction","display_name":"Natural deduction","score":0.5711850523948669},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.5309144258499146},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.49207085371017456},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.45116567611694336},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.41517436504364014},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33235442638397217},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.32855552434921265},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3181896507740021},{"id":"https://openalex.org/keywords/proof-calculus","display_name":"Proof calculus","score":0.27562928199768066},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.21470943093299866},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1914922297000885},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.16655808687210083},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.13869118690490723}],"concepts":[{"id":"https://openalex.org/C89421646","wikidata":"https://www.wikidata.org/wiki/Q843632","display_name":"Sequent","level":2,"score":0.8470249176025391},{"id":"https://openalex.org/C65880906","wikidata":"https://www.wikidata.org/wiki/Q1771121","display_name":"Sequent calculus","level":3,"score":0.8318476676940918},{"id":"https://openalex.org/C111404639","wikidata":"https://www.wikidata.org/wiki/Q376166","display_name":"Cut-elimination theorem","level":4,"score":0.6437414884567261},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6108731627464294},{"id":"https://openalex.org/C62073222","wikidata":"https://www.wikidata.org/wiki/Q1572108","display_name":"Natural deduction","level":2,"score":0.5711850523948669},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.5309144258499146},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.49207085371017456},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.45116567611694336},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.41517436504364014},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33235442638397217},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.32855552434921265},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3181896507740021},{"id":"https://openalex.org/C6489637","wikidata":"https://www.wikidata.org/wiki/Q7250002","display_name":"Proof calculus","level":3,"score":0.27562928199768066},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.21470943093299866},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1914922297000885},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.16655808687210083},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.13869118690490723},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"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/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0956796818000023","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0956796818000023","pdf_url":null,"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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.49000000953674316,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W4861723","https://openalex.org/W40564209","https://openalex.org/W159715351","https://openalex.org/W184349421","https://openalex.org/W1514384332","https://openalex.org/W1567048749","https://openalex.org/W1580664042","https://openalex.org/W1738264400","https://openalex.org/W1783388813","https://openalex.org/W1911436531","https://openalex.org/W1971461250","https://openalex.org/W1980939032","https://openalex.org/W1981830935","https://openalex.org/W1982205631","https://openalex.org/W1985185257","https://openalex.org/W2000862401","https://openalex.org/W2008920425","https://openalex.org/W2016326123","https://openalex.org/W2030663607","https://openalex.org/W2039977878","https://openalex.org/W2040871029","https://openalex.org/W2053198071","https://openalex.org/W2070324762","https://openalex.org/W2077444071","https://openalex.org/W2102706914","https://openalex.org/W2127114597","https://openalex.org/W2131807903","https://openalex.org/W2135287414","https://openalex.org/W2144747140","https://openalex.org/W2145617779","https://openalex.org/W2151716725","https://openalex.org/W2152013675","https://openalex.org/W2156268797","https://openalex.org/W2323803659","https://openalex.org/W2509085585","https://openalex.org/W2911865844","https://openalex.org/W4238292764","https://openalex.org/W4242509346"],"related_works":["https://openalex.org/W2584381231","https://openalex.org/W1562648369","https://openalex.org/W4253113110","https://openalex.org/W4289719533","https://openalex.org/W2023557900","https://openalex.org/W4295728898","https://openalex.org/W1566344352","https://openalex.org/W2137780954","https://openalex.org/W3090765541","https://openalex.org/W2891688494"],"abstract_inverted_index":{"Abstract":[0],"We":[1,88,113],"present":[2],"a":[3,42,45,56,70,107,129],"model":[4],"of":[5,12,24,32,53,64,120,148,155,163,183],"computation":[6,121,167],"that":[7,72,185],"heavily":[8],"emphasizes":[9],"the":[10,15,51,61,65,99,117,123,146,153,161,170,189,203],"concept":[11,147],"duality":[13,130],"and":[14,80,96,178,192,195],"interaction":[16],"between":[17,131],"opposites\u2013production":[18],"interacts":[19],"with":[20],"consumption.":[21],"The":[22],"symmetry":[23],"this":[25,174],"framework":[26],"naturally":[27],"explains":[28],"more":[29],"complicated":[30],"features":[31],"programming":[33],"languages":[34,136],"through":[35],"relatively":[36],"familiar":[37],"concepts.":[38,87],"For":[39],"example,":[40],"binding":[41],"value":[43],"to":[44,49,104,128,139,160,202],"variable":[46],"is":[47,158],"dual":[48,138],"manipulating":[50],"flow":[52],"control":[54,78],"in":[55,83,122,152,169,188],"program.":[57],"By":[58],"looking":[59],"at":[60],"computational":[62],"interpretation":[63],"sequent":[66,94,124,171],"calculus,":[67],"we":[68,143,176],"find":[69],"language":[71],"lets":[73],"us":[74,106],"speak":[75],"about":[76],"duality,":[77],"flow,":[79],"evaluation":[81,132],"order":[82],"programs":[84],"as":[85],"first-class":[86],"begin":[89],"by":[90],"reviewing":[91],"Gentzen's":[92],"LK":[93],"calculus":[95,125],"show":[97],"how":[98,116,145,197],"Curry\u2013Howard":[100],"isomorphism":[101],"still":[102],"applies":[103],"give":[105],"different":[108,181],"basis":[109],"for":[110,166],"expressing":[111],"computation.":[112],"then":[114],"illustrate":[115,196],"fundamental":[118],"dilemma":[119],"gives":[126],"rise":[127],"strategies":[133],":":[134],"strict":[135],"are":[137,199],"lazy":[140],"languages.":[141],"Finally,":[142],"discuss":[144],"focusing":[149,184],",":[150],"developed":[151],"setting":[154],"proof":[156],"search,":[157],"related":[159],"idea":[162],"type":[164],"safety":[165],"expressed":[168],"calculus.":[172],"In":[173],"regard,":[175],"compare":[177],"contrast":[179],"two":[180,200],"methods":[182],"have":[186],"appeared":[187],"literature,":[190],"static":[191],"dynamic":[193],"focusing,":[194],"they":[198],"means":[201],"same":[204],"end.":[205]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}