{"id":"https://openalex.org/W2035713914","doi":"https://doi.org/10.1017/s0960129514000127","title":"Containers, monads and induction recursion","display_name":"Containers, monads and induction recursion","publication_year":2014,"publication_date":"2014-11-20","ids":{"openalex":"https://openalex.org/W2035713914","doi":"https://doi.org/10.1017/s0960129514000127","mag":"2035713914"},"language":"en","primary_location":{"id":"doi:10.1017/s0960129514000127","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129514000127","pdf_url":null,"source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"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":"Mathematical Structures in Computer Science","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/A5044225957","display_name":"Neil Ghani","orcid":null},"institutions":[{"id":"https://openalex.org/I3130035786","display_name":"University Ucinf","ror":"https://ror.org/02cs9pv18","country_code":"CL","type":"education","lineage":["https://openalex.org/I3130035786"]},{"id":"https://openalex.org/I181647926","display_name":"University of Strathclyde","ror":"https://ror.org/00n3w3b69","country_code":"GB","type":"education","lineage":["https://openalex.org/I181647926"]}],"countries":["CL","GB"],"is_corresponding":true,"raw_author_name":"NEIL GHANI","raw_affiliation_strings":["Department of Computer and Information Sciences, University of Strathclyde, Glasgow G1 1XH, Scotland Email:","Computer And Information Sciences"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, University of Strathclyde, Glasgow G1 1XH, Scotland Email:","institution_ids":["https://openalex.org/I181647926"]},{"raw_affiliation_string":"Computer And Information Sciences","institution_ids":["https://openalex.org/I3130035786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068566330","display_name":"Peter Hancock","orcid":null},"institutions":[{"id":"https://openalex.org/I181647926","display_name":"University of Strathclyde","ror":"https://ror.org/00n3w3b69","country_code":"GB","type":"education","lineage":["https://openalex.org/I181647926"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"PETER HANCOCK","raw_affiliation_strings":["Department of Computer and Information Sciences, University of Strathclyde, Glasgow G1 1XH, Scotland Email:","University of Strathclyde"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, University of Strathclyde, Glasgow G1 1XH, Scotland Email:","institution_ids":["https://openalex.org/I181647926"]},{"raw_affiliation_string":"University of Strathclyde","institution_ids":["https://openalex.org/I181647926"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044225957"],"corresponding_institution_ids":["https://openalex.org/I181647926","https://openalex.org/I3130035786"],"apc_list":null,"apc_paid":null,"fwci":0.4229,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.74637309,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"26","issue":"1","first_page":"89","last_page":"113"},"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.9998999834060669,"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.9998999834060669,"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.9954000115394592,"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.9886999726295471,"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/recursion","display_name":"Recursion (computer science)","score":0.9021039605140686},{"id":"https://openalex.org/keywords/mutual-recursion","display_name":"Mutual recursion","score":0.5887992978096008},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5820363759994507},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4961603581905365},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48945677280426025},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.47540292143821716},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.46780040860176086},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.46497583389282227},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.42337676882743835},{"id":"https://openalex.org/keywords/double-recursion","display_name":"Double recursion","score":0.42021408677101135},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.41954877972602844},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3544391989707947},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33821436762809753},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3354448080062866},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.24855592846870422}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.9021039605140686},{"id":"https://openalex.org/C124416688","wikidata":"https://www.wikidata.org/wiki/Q3454656","display_name":"Mutual recursion","level":3,"score":0.5887992978096008},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5820363759994507},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4961603581905365},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48945677280426025},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.47540292143821716},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.46780040860176086},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.46497583389282227},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.42337676882743835},{"id":"https://openalex.org/C139503435","wikidata":"https://www.wikidata.org/wiki/Q5300083","display_name":"Double recursion","level":3,"score":0.42021408677101135},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.41954877972602844},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3544391989707947},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33821436762809753},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3354448080062866},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.24855592846870422},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0960129514000127","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129514000127","pdf_url":null,"source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"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":"Mathematical Structures in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:strathprints.strath.ac.uk:55282","is_oa":false,"landing_page_url":"https://strathprints.strath.ac.uk/55282/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402226","display_name":"Strathprints: The University of Strathclyde institutional repository (University of Strathclyde)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I181647926","host_organization_name":"University of Strathclyde","host_organization_lineage":["https://openalex.org/I181647926"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[{"id":"https://openalex.org/G2402030049","display_name":null,"funder_award_id":"EP/G033056/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":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1530894146","https://openalex.org/W1539303361","https://openalex.org/W1558175043","https://openalex.org/W1593841126","https://openalex.org/W1836508668","https://openalex.org/W2034621723","https://openalex.org/W2035241416","https://openalex.org/W2058174669","https://openalex.org/W2079640625","https://openalex.org/W2088156780","https://openalex.org/W2120713972","https://openalex.org/W2132221175","https://openalex.org/W2229616979","https://openalex.org/W2296612922","https://openalex.org/W4213279211"],"related_works":["https://openalex.org/W2006836388","https://openalex.org/W2896379815","https://openalex.org/W2155605358","https://openalex.org/W2374742784","https://openalex.org/W223586891","https://openalex.org/W1563586960","https://openalex.org/W560887346","https://openalex.org/W1509114718","https://openalex.org/W4246540581","https://openalex.org/W2065302945"],"abstract_inverted_index":{"Induction":[0],"recursion":[1,27,80,103,155],"offers":[2],"the":[3,14,68,83,94,97,121],"possibility":[4],"of":[5,17,39,63,72,85,96,153],"a":[6,18,32,36,42,59,134,147],"clean,":[7],"simple":[8],"and":[9,41,131,140,149],"yet":[10],"powerful":[11],"meta-language":[12],"for":[13,157],"type":[15,65,70],"system":[16],"dependently":[19],"typed":[20],"programming":[21],"language.":[22],"At":[23],"its":[24],"crux,":[25],"induction":[26,79,138,154],"allows":[28],"us":[29],"to":[30,52,82,109,145],"define":[31],"universe,":[33],"that":[34],"is":[35,108,117],"set":[37],"U":[38,47,57,88],"codes":[40,86],"decoding":[43],"function":[44,98],"T":[45,99],":":[46,56],"\u2192":[48],"D":[49],"which":[50,116],"assigns":[51],"every":[53],"code":[54],"u":[55,62],",":[58,100],"value":[60],"T,":[61],"some":[64],"D,":[66],"e.g.":[67],"large":[69],"Set":[71],"small":[73],"types":[74],"or":[75],"sets.":[76],"The":[77],"name":[78],"refers":[81],"build-up":[84],"in":[87,120,126,159],"using":[89],"inductive":[90],"clauses,":[91],"simultaneously":[92],"with":[93],"definition":[95,152],"by":[101],"structural":[102],"on":[104],"codes.":[105],"Our":[106],"contribution":[107],"(i)":[110],"bring":[111],"out":[112],"explicitly":[113],"algebraic":[114],"structure":[115],"less":[118],"visible":[119],"original":[122],"type-theoretic":[123],"presentation":[124],"\u2013":[125],"particular":[127],"showing":[128],"how":[129],"containers":[130],"monads":[132],"play":[133],"pivotal":[135],"role":[136],"within":[137],"recursion;":[139],"(ii)":[141],"use":[142,158],"these":[143],"structures":[144],"present":[146],"clean":[148],"high":[150],"level":[151],"suitable":[156],"functional":[160],"programming.":[161]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}