{"id":"https://openalex.org/W2517371102","doi":"https://doi.org/10.1145/2951913.2951921","title":"Talking bananas: structural recursion for session types","display_name":"Talking bananas: structural recursion for session types","publication_year":2016,"publication_date":"2016-08-29","ids":{"openalex":"https://openalex.org/W2517371102","doi":"https://doi.org/10.1145/2951913.2951921","mag":"2517371102"},"language":"en","primary_location":{"id":"doi:10.1145/2951913.2951921","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2951913.2951921","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/20.500.11820/a6d9c929-db27-4d5b-a5b6-8d654fafeae0","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061903791","display_name":"Sam Lindley","orcid":"https://orcid.org/0000-0002-1360-4714"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Sam Lindley","raw_affiliation_strings":["University of Edinburgh, UK"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067671067","display_name":"J. Garrett Morris","orcid":"https://orcid.org/0000-0002-3992-1080"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"J. Garrett Morris","raw_affiliation_strings":["University of Edinburgh, UK"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061903791"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":9.2761,"has_fulltext":true,"cited_by_count":67,"citation_normalized_percentile":{"value":0.97905439,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"434","last_page":"447"},"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.9991000294685364,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/recursion","display_name":"Recursion (computer science)","score":0.9219701290130615},{"id":"https://openalex.org/keywords/session","display_name":"Session (web analytics)","score":0.8666244745254517},{"id":"https://openalex.org/keywords/mutual-recursion","display_name":"Mutual recursion","score":0.8201104402542114},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7190051674842834},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5979428887367249},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5447403788566589},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.5328629016876221},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5209766030311584},{"id":"https://openalex.org/keywords/primitive-recursive-function","display_name":"Primitive recursive function","score":0.4972393810749054},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4933106005191803},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.4440368711948395},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4305137097835541},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.4292735457420349},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.36718541383743286},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3292784094810486},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23908433318138123},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.23136502504348755},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.09187451004981995}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.9219701290130615},{"id":"https://openalex.org/C2779182362","wikidata":"https://www.wikidata.org/wiki/Q17126187","display_name":"Session (web analytics)","level":2,"score":0.8666244745254517},{"id":"https://openalex.org/C124416688","wikidata":"https://www.wikidata.org/wiki/Q3454656","display_name":"Mutual recursion","level":3,"score":0.8201104402542114},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7190051674842834},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5979428887367249},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5447403788566589},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.5328629016876221},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5209766030311584},{"id":"https://openalex.org/C9986523","wikidata":"https://www.wikidata.org/wiki/Q1570472","display_name":"Primitive recursive function","level":2,"score":0.4972393810749054},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4933106005191803},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.4440368711948395},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4305137097835541},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.4292735457420349},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.36718541383743286},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3292784094810486},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23908433318138123},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.23136502504348755},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.09187451004981995},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2951913.2951921","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2951913.2951921","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.ed.ac.uk:publications/a6d9c929-db27-4d5b-a5b6-8d654fafeae0","is_oa":true,"landing_page_url":"http://dl.acm.org/citation.cfm?id=2951921","pdf_url":"http://hdl.handle.net/20.500.11820/a6d9c929-db27-4d5b-a5b6-8d654fafeae0","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":""},{"id":"pmh:oai:pure.ed.ac.uk:openaire/a6d9c929-db27-4d5b-a5b6-8d654fafeae0","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/a6d9c929-db27-4d5b-a5b6-8d654fafeae0","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":"Lindley, S & Morris, J G 2016, Talking bananas : Structural Recursion for Session Types. in ICFP 2016 Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming. ACM SIGPLAN Notices, no. 9, vol. 51, Nara, Japan, pp. 437-447, 21st ACM SIGPLAN International Conference on Functional Programming, Nara, Japan, 18/09/16. https://doi.org/10.1145/2951913.2951921","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:publications/a6d9c929-db27-4d5b-a5b6-8d654fafeae0","is_oa":true,"landing_page_url":"http://dl.acm.org/citation.cfm?id=2951921","pdf_url":"http://hdl.handle.net/20.500.11820/a6d9c929-db27-4d5b-a5b6-8d654fafeae0","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":""},"sustainable_development_goals":[{"score":0.47999998927116394,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G1798638720","display_name":"From Data Types to Session Types---A Basis for Concurrency and Distribution","funder_award_id":"EP/K034413/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7918631928","display_name":null,"funder_award_id":"EP/K034413/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2517371102.pdf","grobid_xml":"https://content.openalex.org/works/W2517371102.grobid-xml"},"referenced_works_count":51,"referenced_works":["https://openalex.org/W79336753","https://openalex.org/W91113134","https://openalex.org/W183006709","https://openalex.org/W241121309","https://openalex.org/W352085490","https://openalex.org/W1498393124","https://openalex.org/W1543368493","https://openalex.org/W1549565321","https://openalex.org/W1571615440","https://openalex.org/W1607623316","https://openalex.org/W1608714802","https://openalex.org/W1673934254","https://openalex.org/W1784055113","https://openalex.org/W1889888010","https://openalex.org/W1941373452","https://openalex.org/W2004063149","https://openalex.org/W2010649834","https://openalex.org/W2021838450","https://openalex.org/W2035971861","https://openalex.org/W2042360145","https://openalex.org/W2061786858","https://openalex.org/W2088881461","https://openalex.org/W2105716349","https://openalex.org/W2123633662","https://openalex.org/W2124126159","https://openalex.org/W2128280268","https://openalex.org/W2138552902","https://openalex.org/W2143566245","https://openalex.org/W2144850774","https://openalex.org/W2152309268","https://openalex.org/W2293728411","https://openalex.org/W2340622488","https://openalex.org/W2483412402","https://openalex.org/W2505732535","https://openalex.org/W2561675875","https://openalex.org/W2914468402","https://openalex.org/W2955123331","https://openalex.org/W3047969424","https://openalex.org/W3146867048","https://openalex.org/W4213338968","https://openalex.org/W4236046808","https://openalex.org/W4251292774","https://openalex.org/W4255673994","https://openalex.org/W6603250414","https://openalex.org/W6603736743","https://openalex.org/W6634383297","https://openalex.org/W6636304400","https://openalex.org/W6639094429","https://openalex.org/W6658150473","https://openalex.org/W6697263422","https://openalex.org/W6781874215"],"related_works":["https://openalex.org/W1996792588","https://openalex.org/W2584778959","https://openalex.org/W2006836388","https://openalex.org/W1596057910","https://openalex.org/W2167424714","https://openalex.org/W2074941524","https://openalex.org/W2517371102","https://openalex.org/W1563586960","https://openalex.org/W4388310202","https://openalex.org/W2175003829"],"abstract_inverted_index":{"Session":[0],"types":[1,19,38],"provide":[2],"static":[3],"guarantees":[4],"that":[5,50,62],"concurrent":[6,27],"programs":[7],"respect":[8],"communication":[9],"protocols.":[10],"We":[11,33,60],"give":[12],"a":[13,25],"novel":[14],"account":[15],"of":[16,23,29,46,74],"recursive":[17,37,57,77],"session":[18,58,78],"in":[20,71],"the":[21,30,42,72],"context":[22],"GV,":[24],"small":[26],"extension":[28],"linear":[31],"\u03bb-calculus.":[32],"extend":[34],"GV":[35],"with":[36],"and":[39,48],"catamorphisms,":[40],"following":[41],"initial":[43],"algebra":[44],"semantics":[45],"recursion,":[47],"show":[49,61],"doing":[51],"so":[52],"naturally":[53],"gives":[54],"rise":[55],"to":[56,66],"types.":[59,79],"this":[63],"principled":[64],"approach":[65],"recursion":[67],"resolves":[68],"long-standing":[69],"problems":[70],"treatment":[73],"duality":[75],"for":[76]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":14},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}