{"id":"https://openalex.org/W2965374511","doi":"https://doi.org/10.1109/lics.2019.8785708","title":"A type theory for cartesian closed bicategories (Extended Abstract)","display_name":"A type theory for cartesian closed bicategories (Extended Abstract)","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2965374511","doi":"https://doi.org/10.1109/lics.2019.8785708","mag":"2965374511"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2019.8785708","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785708","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/a9a7232b-27b4-4a66-908d-29ea56a72fa7","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080675787","display_name":"Marcelo Fiore","orcid":"https://orcid.org/0000-0001-8558-3492"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Marcelo Fiore","raw_affiliation_strings":["Department of Computer Science and Technology, University of Cambridge"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, University of Cambridge","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038782398","display_name":"Philip Saville","orcid":"https://orcid.org/0000-0002-8320-0280"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Philip Saville","raw_affiliation_strings":["Department of Computer Science and Technology, University of Cambridge"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, University of Cambridge","institution_ids":["https://openalex.org/I241749"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I241749"],"apc_list":null,"apc_paid":null,"fwci":0.7232,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.78650877,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"13"},"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.9979000091552734,"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.9979000091552734,"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/T10896","display_name":"Homotopy and Cohomology in Algebraic Topology","score":0.9753999710083008,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9657999873161316,"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/cartesian-closed-category","display_name":"Cartesian closed category","score":0.8691864013671875},{"id":"https://openalex.org/keywords/substitution","display_name":"Substitution (logic)","score":0.6341347098350525},{"id":"https://openalex.org/keywords/cartesian-coordinate-system","display_name":"Cartesian coordinate system","score":0.6188791990280151},{"id":"https://openalex.org/keywords/lambda-calculus","display_name":"Lambda calculus","score":0.5841743350028992},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.5802470445632935},{"id":"https://openalex.org/keywords/type-theory","display_name":"Type theory","score":0.5789106488227844},{"id":"https://openalex.org/keywords/universal-algebra","display_name":"Universal algebra","score":0.546241819858551},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.527574896812439},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47683778405189514},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.47177982330322266},{"id":"https://openalex.org/keywords/dependent-type","display_name":"Dependent type","score":0.46266841888427734},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43603238463401794},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.32941216230392456},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.31537699699401855},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.30685335397720337},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1988832652568817},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08075794577598572}],"concepts":[{"id":"https://openalex.org/C171032842","wikidata":"https://www.wikidata.org/wiki/Q1725874","display_name":"Cartesian closed category","level":2,"score":0.8691864013671875},{"id":"https://openalex.org/C2778220771","wikidata":"https://www.wikidata.org/wiki/Q1522579","display_name":"Substitution (logic)","level":2,"score":0.6341347098350525},{"id":"https://openalex.org/C16038011","wikidata":"https://www.wikidata.org/wiki/Q62912","display_name":"Cartesian coordinate system","level":2,"score":0.6188791990280151},{"id":"https://openalex.org/C135790938","wikidata":"https://www.wikidata.org/wiki/Q242028","display_name":"Lambda calculus","level":2,"score":0.5841743350028992},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.5802470445632935},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.5789106488227844},{"id":"https://openalex.org/C188971069","wikidata":"https://www.wikidata.org/wiki/Q1636734","display_name":"Universal algebra","level":3,"score":0.546241819858551},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.527574896812439},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47683778405189514},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.47177982330322266},{"id":"https://openalex.org/C20528804","wikidata":"https://www.wikidata.org/wiki/Q997433","display_name":"Dependent type","level":3,"score":0.46266841888427734},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43603238463401794},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.32941216230392456},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.31537699699401855},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30685335397720337},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1988832652568817},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08075794577598572},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/lics.2019.8785708","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2019.8785708","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/a9a7232b-27b4-4a66-908d-29ea56a72fa7","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/a9a7232b-27b4-4a66-908d-29ea56a72fa7","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fiore, M & Saville, P 2019, A type theory for cartesian closed bicategories : (Extended Abstract). in 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) : 24-27 June 2019 - Vancouver. Institute of Electrical and Electronics Engineers, pp. 1-13, Thirty-Fourth Annual ACM/IEEE Symposium on Logic in Computer Science, Vancouver, Canada, 24/06/19. https://doi.org/10.1109/LICS.2019.8785708","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.ed.ac.uk:publications/a9a7232b-27b4-4a66-908d-29ea56a72fa7","is_oa":false,"landing_page_url":"https://www.research.ed.ac.uk/portal/en/publications/a-type-theory-for-cartesian-closed-bicategories(a9a7232b-27b4-4a66-908d-29ea56a72fa7).html","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/a9a7232b-27b4-4a66-908d-29ea56a72fa7","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/a9a7232b-27b4-4a66-908d-29ea56a72fa7","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fiore, M & Saville, P 2019, A type theory for cartesian closed bicategories : (Extended Abstract). in 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) : 24-27 June 2019 - Vancouver. Institute of Electrical and Electronics Engineers, pp. 1-13, Thirty-Fourth Annual ACM/IEEE Symposium on Logic in Computer Science, Vancouver, Canada, 24/06/19. https://doi.org/10.1109/LICS.2019.8785708","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":67,"referenced_works":["https://openalex.org/W44595607","https://openalex.org/W115669730","https://openalex.org/W158035142","https://openalex.org/W171141860","https://openalex.org/W199863285","https://openalex.org/W223002628","https://openalex.org/W569543113","https://openalex.org/W578297193","https://openalex.org/W659508351","https://openalex.org/W823132808","https://openalex.org/W1484215330","https://openalex.org/W1490159878","https://openalex.org/W1520174560","https://openalex.org/W1555673433","https://openalex.org/W1649578155","https://openalex.org/W1677393765","https://openalex.org/W1836508668","https://openalex.org/W1858353210","https://openalex.org/W1987700231","https://openalex.org/W1988292549","https://openalex.org/W1990916178","https://openalex.org/W1996404651","https://openalex.org/W2000806582","https://openalex.org/W2045868464","https://openalex.org/W2046449629","https://openalex.org/W2077270594","https://openalex.org/W2079833819","https://openalex.org/W2088639858","https://openalex.org/W2089773888","https://openalex.org/W2094580575","https://openalex.org/W2120713972","https://openalex.org/W2126306617","https://openalex.org/W2129064963","https://openalex.org/W2143997926","https://openalex.org/W2208280833","https://openalex.org/W2295866357","https://openalex.org/W2567087906","https://openalex.org/W2571881501","https://openalex.org/W2615580850","https://openalex.org/W2734361589","https://openalex.org/W2766845045","https://openalex.org/W2784317049","https://openalex.org/W2952879408","https://openalex.org/W2963212557","https://openalex.org/W2964091627","https://openalex.org/W3099664084","https://openalex.org/W3102303293","https://openalex.org/W3104865824","https://openalex.org/W3114565313","https://openalex.org/W4205374018","https://openalex.org/W4206381645","https://openalex.org/W4210699837","https://openalex.org/W4212902885","https://openalex.org/W4233993919","https://openalex.org/W4247343810","https://openalex.org/W4250557834","https://openalex.org/W4285719527","https://openalex.org/W4295095665","https://openalex.org/W6604605383","https://openalex.org/W6605210160","https://openalex.org/W6623327223","https://openalex.org/W6636433743","https://openalex.org/W6638838395","https://openalex.org/W6661619876","https://openalex.org/W6731259602","https://openalex.org/W6731966548","https://openalex.org/W6745194170"],"related_works":["https://openalex.org/W1828583149","https://openalex.org/W1974294638","https://openalex.org/W2027614742","https://openalex.org/W2146437601","https://openalex.org/W2942236696","https://openalex.org/W2121730419","https://openalex.org/W2965374511","https://openalex.org/W1607720949","https://openalex.org/W2939157834","https://openalex.org/W3030045968"],"abstract_inverted_index":{"We":[0],"construct":[1],"an":[2,30],"internal":[3],"language":[4],"for":[5,69,116],"cartesian":[6,20,117],"closed":[7,21,118],"bicategories.":[8,119],"Precisely,":[9],"we":[10],"introduce":[11],"a":[12,19,55,81,86,110],"type":[13,82,91],"theory":[14,83,92],"modelling":[15],"the":[16,36,40,58,67,99,106],"structure":[17,51],"of":[18,57,60,89],"bicategory":[22],"and":[23,47,66,71,93,96],"show":[24],"that":[25,84],"its":[26],"syntactic":[27],"model":[28],"satisfies":[29],"appropriate":[31],"universal":[32,64],"property,":[33],"thereby":[34],"lifting":[35],"Curry-Howard-Lambek":[37],"correspondence":[38],"to":[39],"bicategorical":[41],"setting.":[42],"Our":[43],"approach":[44],"is":[45,52,80,105],"principled":[46],"practical.":[48],"Weak":[49],"substitution":[50],"constructed":[53],"using":[54],"bicategori-fication":[56],"notion":[59],"abstract":[61],"clone":[62],"from":[63,75],"algebra,":[65],"rules":[68],"products":[70],"exponentials":[72],"are":[73],"synthesised":[74],"semantic":[76],"considerations.":[77],"The":[78],"result":[79],"employs":[85],"novel":[87],"combination":[88],"2-dimensional":[90],"explicit":[94],"substitution,":[95],"directly":[97],"generalises":[98],"Simply-Typed":[100],"Lambda":[101],"Calculus.":[102],"This":[103],"work":[104],"first":[107],"step":[108],"in":[109],"programme":[111],"aimed":[112],"at":[113],"proving":[114],"coherence":[115]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}