{"id":"https://openalex.org/W4414570809","doi":"https://doi.org/10.1007/978-3-032-06085-3_23","title":"An Agda Formalization of\u00a0Nonassociative Lambek Calculus and\u00a0its Metatheory","display_name":"An Agda Formalization of\u00a0Nonassociative Lambek Calculus and\u00a0its Metatheory","publication_year":2025,"publication_date":"2025-09-25","ids":{"openalex":"https://openalex.org/W4414570809","doi":"https://doi.org/10.1007/978-3-032-06085-3_23"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-032-06085-3_23","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-06085-3_23","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-06085-3_23.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-06085-3_23.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012979981","display_name":"Niccol\u00f2 Veltr\u00ec","orcid":"https://orcid.org/0000-0002-7230-3436"},"institutions":[{"id":"https://openalex.org/I111112146","display_name":"Tallinn University of Technology","ror":"https://ror.org/0443cwa12","country_code":"EE","type":"education","lineage":["https://openalex.org/I111112146"]}],"countries":["EE"],"is_corresponding":true,"raw_author_name":"Niccol\u00f2 Veltri","raw_affiliation_strings":["Tallinn University of Technology, Tallinn, Estonia"],"affiliations":[{"raw_affiliation_string":"Tallinn University of Technology, Tallinn, Estonia","institution_ids":["https://openalex.org/I111112146"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054807631","display_name":"Cheng-Syuan Wan","orcid":"https://orcid.org/0000-0003-2053-1688"},"institutions":[{"id":"https://openalex.org/I111112146","display_name":"Tallinn University of Technology","ror":"https://ror.org/0443cwa12","country_code":"EE","type":"education","lineage":["https://openalex.org/I111112146"]}],"countries":["EE"],"is_corresponding":false,"raw_author_name":"Cheng-Syuan Wan","raw_affiliation_strings":["Tallinn University of Technology, Tallinn, Estonia"],"affiliations":[{"raw_affiliation_string":"Tallinn University of Technology, Tallinn, Estonia","institution_ids":["https://openalex.org/I111112146"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5012979981"],"corresponding_institution_ids":["https://openalex.org/I111112146"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.42744742,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"433","last_page":"452"},"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.9990000128746033,"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.9990000128746033,"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.9907000064849854,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9835000038146973,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cut-elimination-theorem","display_name":"Cut-elimination theorem","score":0.6547999978065491},{"id":"https://openalex.org/keywords/sequent-calculus","display_name":"Sequent calculus","score":0.6291999816894531},{"id":"https://openalex.org/keywords/natural-deduction","display_name":"Natural deduction","score":0.5888000130653381},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.5812000036239624},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5649999976158142},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.5415999889373779},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.4966999888420105},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.4456999897956848},{"id":"https://openalex.org/keywords/curry\u2013howard-correspondence","display_name":"Curry\u2013Howard correspondence","score":0.42160001397132874}],"concepts":[{"id":"https://openalex.org/C111404639","wikidata":"https://www.wikidata.org/wiki/Q376166","display_name":"Cut-elimination theorem","level":4,"score":0.6547999978065491},{"id":"https://openalex.org/C65880906","wikidata":"https://www.wikidata.org/wiki/Q1771121","display_name":"Sequent calculus","level":3,"score":0.6291999816894531},{"id":"https://openalex.org/C62073222","wikidata":"https://www.wikidata.org/wiki/Q1572108","display_name":"Natural deduction","level":2,"score":0.5888000130653381},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.5812000036239624},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5649999976158142},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.553600013256073},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.5415999889373779},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.4966999888420105},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.4456999897956848},{"id":"https://openalex.org/C85343465","wikidata":"https://www.wikidata.org/wiki/Q975734","display_name":"Curry\u2013Howard correspondence","level":3,"score":0.42160001397132874},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.42089998722076416},{"id":"https://openalex.org/C137800194","wikidata":"https://www.wikidata.org/wiki/Q11713455","display_name":"Interpolation (computer graphics)","level":3,"score":0.4198000133037567},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.4172999858856201},{"id":"https://openalex.org/C195653647","wikidata":"https://www.wikidata.org/wiki/Q7625047","display_name":"Structural proof theory","level":4,"score":0.414900004863739},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.4083000123500824},{"id":"https://openalex.org/C89421646","wikidata":"https://www.wikidata.org/wiki/Q843632","display_name":"Sequent","level":2,"score":0.3937999904155731},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38199999928474426},{"id":"https://openalex.org/C2780432614","wikidata":"https://www.wikidata.org/wiki/Q864213","display_name":"Conservative extension","level":2,"score":0.37880000472068787},{"id":"https://openalex.org/C171482190","wikidata":"https://www.wikidata.org/wiki/Q3257974","display_name":"Minimal logic","level":5,"score":0.3702999949455261},{"id":"https://openalex.org/C3746660","wikidata":"https://www.wikidata.org/wiki/Q1068763","display_name":"Rule of inference","level":2,"score":0.3474999964237213},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.34439998865127563},{"id":"https://openalex.org/C6489637","wikidata":"https://www.wikidata.org/wiki/Q7250002","display_name":"Proof calculus","level":3,"score":0.33739998936653137},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32429999113082886},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.3231000006198883},{"id":"https://openalex.org/C13766981","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Automated proof checking","level":3,"score":0.30979999899864197},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.3093999922275543},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.29600000381469727},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.27730000019073486},{"id":"https://openalex.org/C40220748","wikidata":"https://www.wikidata.org/wiki/Q4227156","display_name":"Coinduction","level":3,"score":0.26600000262260437},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2606000006198883},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.25920000672340393}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-032-06085-3_23","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-06085-3_23","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-06085-3_23.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.1007/978-3-032-06085-3_23","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-06085-3_23","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-06085-3_23.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7569880742","display_name":null,"funder_award_id":"PSG749","funder_id":"https://openalex.org/F4320321090","funder_display_name":"Eesti Teadusagentuur"}],"funders":[{"id":"https://openalex.org/F4320321090","display_name":"Eesti Teadusagentuur","ror":"https://ror.org/00jjeja18"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414570809.pdf","grobid_xml":"https://content.openalex.org/works/W4414570809.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W81761572","https://openalex.org/W1568029361","https://openalex.org/W1574172746","https://openalex.org/W1584996725","https://openalex.org/W1602191112","https://openalex.org/W1679173830","https://openalex.org/W1991478887","https://openalex.org/W1996712532","https://openalex.org/W2073713091","https://openalex.org/W2083658940","https://openalex.org/W2084466352","https://openalex.org/W2098316338","https://openalex.org/W2114633883","https://openalex.org/W2618076222","https://openalex.org/W4242125186","https://openalex.org/W4315630423","https://openalex.org/W4400211218","https://openalex.org/W4412684103","https://openalex.org/W6910423583"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"presents":[3],"a":[4,100,110,121],"formalization":[5],"of":[6,38,103,105,113,124],"the":[7,12,39,69,78,90,94,117,125],"nonassociative":[8],"Lambek":[9],"calculus":[10,18],"in":[11,29,48],"Agda":[13],"proof":[14],"assistant.":[15],"The":[16,36],"sequent":[17],"for":[19],"this":[20],"logic":[21],"has":[22],"sequents":[23],"with":[24],"binary":[25],"trees":[26],"as":[27,34,120],"antecedents,":[28],"which":[30,82],"formulae":[31],"are":[32,97],"stored":[33],"leaves.":[35],"shape":[37],"antecedents":[40],"creates":[41],"subtleties":[42],"when":[43],"proving":[44],"logical":[45],"properties,":[46],"since":[47],"many":[49],"cases":[50],"one":[51],"needs":[52],"to":[53,67,73],"analyze":[54],"equalities":[55,63],"involving":[56],"sequentially-composed":[57],"trees.":[58],"We":[59,86,107],"formally":[60],"characterize":[61],"these":[62],"and":[64,77,93],"show":[65,87],"how":[66],"employ":[68],"resulting":[70],"technical":[71],"lemma":[72],"prove":[74,109],"cut":[75,91,127],"admissibility":[76],"Maehara":[79,114],"interpolation":[80,95,118],"properly,":[81],"implies":[83],"Craig":[84],"interpolation.":[85],"that":[88],"both":[89],"rule":[92],"procedure":[96,119],"well-defined":[98],"wrt.":[99],"certain":[101],"notion":[102],"equivalence":[104],"derivations.":[106],"additionally":[108],"proof-relevant":[111],"version":[112],"interpolation,":[115],"exhibiting":[116],"right":[122],"inverse":[123],"admissible":[126],"rule.":[128]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}