{"id":"https://openalex.org/W2108836085","doi":"https://doi.org/10.1016/j.entcs.2005.06.014","title":"Programming Examples Needing Polymorphic Recursion","display_name":"Programming Examples Needing Polymorphic Recursion","publication_year":2005,"publication_date":"2005-07-01","ids":{"openalex":"https://openalex.org/W2108836085","doi":"https://doi.org/10.1016/j.entcs.2005.06.014","mag":"2108836085"},"language":"en","primary_location":{"id":"doi:10.1016/j.entcs.2005.06.014","doi":"https://doi.org/10.1016/j.entcs.2005.06.014","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2005.06.014","pdf_url":"https://www.sciencedirect.com/science/article/pii/S1571066105050607/pdf","source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","jufo-1","norway-1","poland-40","russia-white-list-3"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.sciencedirect.com/science/article/pii/S1571066105050607/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"J.J. Hallett","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J.J. Hallett","raw_affiliation_strings":["Department of Computer Science, Boston University, Boston, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Boston University, Boston, USA","institution_ids":["https://openalex.org/I111088046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090898185","display_name":"Assaf J. Kfoury","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"A.J. Kfoury","raw_affiliation_strings":["Department of Computer Science, Boston University, Boston, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Boston University, Boston, USA","institution_ids":["https://openalex.org/I111088046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5090898185"],"corresponding_institution_ids":["https://openalex.org/I111088046"],"apc_list":null,"apc_paid":null,"fwci":2.3079,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.88506835,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":"136","issue":null,"first_page":"57","last_page":"102"},"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/1712","display_name":"Software"},"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/1712","display_name":"Software"},"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.0,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.0,"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/polymorphic-recursion","display_name":"polymorphic recursion","score":1.0},{"id":"https://openalex.org/keywords/type-inference","display_name":"type inference","score":0.8569999933242798},{"id":"https://openalex.org/keywords/intersection-types","display_name":"intersection types","score":0.9879999756813049},{"id":"https://openalex.org/keywords/polymorphism","display_name":"polymorphism","score":0.5910000205039978},{"id":"https://openalex.org/keywords/type-systems","display_name":"type systems","score":0.46399998664855957},{"id":"https://openalex.org/keywords/programming-examples","display_name":"programming examples","score":0.4339999854564667}],"concepts":[{"id":"https://openalex.org/C198370458","wikidata":"https://www.wikidata.org/wiki/Q586459","display_name":"Type inference","level":3,"score":0.8337377309799194},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7613470554351807},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7435828447341919},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6661956906318665},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6293851733207703},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5609698295593262},{"id":"https://openalex.org/C55128367","wikidata":"https://www.wikidata.org/wiki/Q2552799","display_name":"System F","level":3,"score":0.5190380215644836},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.5083035826683044},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5024495124816895},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.48600706458091736},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.4359566271305084},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.43105271458625793},{"id":"https://openalex.org/C135790938","wikidata":"https://www.wikidata.org/wiki/Q242028","display_name":"Lambda calculus","level":2,"score":0.426447331905365},{"id":"https://openalex.org/C138958017","wikidata":"https://www.wikidata.org/wiki/Q190087","display_name":"Data type","level":2,"score":0.4215506613254547},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.32622721791267395},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14000818133354187},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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":6,"locations":[{"id":"doi:10.1016/j.entcs.2005.06.014","doi":"https://doi.org/10.1016/j.entcs.2005.06.014","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2005.06.014","pdf_url":"https://www.sciencedirect.com/science/article/pii/S1571066105050607/pdf","source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","jufo-1","norway-1","poland-40","russia-white-list-3"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1.7925","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.7925","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bu.edu/techreports/ps/2004-004-polymorphic-recursion-progams.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.140.1960","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.1960","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.church-project.org/reports/electronic/Hal+Kfo:BUCS-TR-2004-004.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.147.745","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.745","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.church-project.org/reports/electronic/Hal+Kfo:BU-2003.pdf.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.4.3177","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.3177","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.church-project.org/reports/electronic/Hal+Kfo:BUCS-TR-2004-004.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.504.1974","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.504.1974","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://itrs04.di.unito.it/papers/hk.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1016/j.entcs.2005.06.014","doi":"https://doi.org/10.1016/j.entcs.2005.06.014","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2005.06.014","pdf_url":"https://www.sciencedirect.com/science/article/pii/S1571066105050607/pdf","source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","jufo-1","norway-1","poland-40","russia-white-list-3"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2108836085.pdf","grobid_xml":"https://content.openalex.org/works/W2108836085.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W975212003","https://openalex.org/W1964952791","https://openalex.org/W1993695344","https://openalex.org/W2016076634","https://openalex.org/W2055065270","https://openalex.org/W2068336423","https://openalex.org/W2072881702","https://openalex.org/W2087381628","https://openalex.org/W2105045857","https://openalex.org/W2131916293","https://openalex.org/W2154632906","https://openalex.org/W6664184109"],"related_works":["https://openalex.org/W1563270810","https://openalex.org/W2101722211","https://openalex.org/W2137676482","https://openalex.org/W1964952791","https://openalex.org/W2026379854","https://openalex.org/W1754134429","https://openalex.org/W2120101915","https://openalex.org/W7095805563","https://openalex.org/W7100942389","https://openalex.org/W4406222053"],"abstract_inverted_index":{"Inferring":[0],"types":[1,90,146],"for":[2,32,106,126,144],"polymorphic":[3,9,33,48,127],"recursive":[4],"function":[5],"definitions":[6],"(abbreviated":[7],"to":[8,76,102],"recursion)":[10],"is":[11,25,75],"a":[12,86,110,119],"recurring":[13],"topic":[14],"on":[15,142,156],"the":[16,27,59,104,136],"mailing":[17],"lists":[18],"of":[19,67,72,80,88,95,122,158],"popular":[20],"typed":[21],"programming":[22,45],"languages.":[23],"This":[24,41],"despite":[26],"fact":[28],"that":[29,78],"type":[30,56,123,132,151],"inference":[31,113],"recursion":[34,49],"using":[35,85],"\u2200-types":[36],"has":[37],"been":[38],"proved":[39],"undecidable.":[40],"report":[42,74],"presents":[43],"several":[44],"examples":[46,82,143],"involving":[47],"and":[50,65],"determines":[51],"their":[52],"typability":[53],"under":[54],"various":[55],"systems,":[57],"including":[58],"Hindley-Milner":[60],"system,":[61,64],"an":[62,92,154],"intersection-type":[63,112],"extensions":[66],"these":[68,81],"two.":[69],"The":[70],"goal":[71],"this":[73],"show":[77],"many":[79],"are":[83],"typable":[84],"system":[87],"intersection":[89],"as":[91],"alternative":[93],"form":[94],"polymorphism.":[96],"By":[97],"accomplishing":[98],"this,":[99],"we":[100,140],"hope":[101],"lay":[103],"foundation":[105],"future":[107],"research":[108],"into":[109],"decidable":[111],"algorithm.":[114],"We":[115],"do":[116],"not":[117],"provide":[118],"comprehensive":[120],"survey":[121],"systems":[124,157],"appropriate":[125],"recursion,":[128],"with":[129,153],"or":[130],"without":[131,150],"annotations":[133],"inserted":[134],"in":[135],"source":[137],"language.":[138],"Rather,":[139],"focus":[141],"which":[145],"may":[147],"be":[148],"inferred":[149],"annotations,":[152],"emphasis":[155],"intersection-":[159],"types.":[160]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}