{"id":"https://openalex.org/W2046290385","doi":"https://doi.org/10.1145/2804302.2804307","title":"Improving Haskell types with SMT","display_name":"Improving Haskell types with SMT","publication_year":2015,"publication_date":"2015-08-24","ids":{"openalex":"https://openalex.org/W2046290385","doi":"https://doi.org/10.1145/2804302.2804307","mag":"2046290385"},"language":"en","primary_location":{"id":"doi:10.1145/2804302.2804307","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2804302.2804307","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2015 ACM SIGPLAN Symposium on Haskell","raw_type":"proceedings-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/A5078168035","display_name":"Iavor S. Diatchki","orcid":"https://orcid.org/0009-0000-7795-4708"},"institutions":[{"id":"https://openalex.org/I4210140281","display_name":"Galois (United States)","ror":"https://ror.org/03g8y8161","country_code":"US","type":"company","lineage":["https://openalex.org/I4210140281"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Iavor S. Diatchki","raw_affiliation_strings":["Galois, USA"],"affiliations":[{"raw_affiliation_string":"Galois, USA","institution_ids":["https://openalex.org/I4210140281"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078168035"],"corresponding_institution_ids":["https://openalex.org/I4210140281"],"apc_list":null,"apc_paid":null,"fwci":3.883,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.94057652,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"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.9998000264167786,"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.9998000264167786,"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.9976999759674072,"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/T11424","display_name":"Security and Verification in Computing","score":0.9918000102043152,"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/haskell","display_name":"Haskell","score":0.9424865245819092},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8325909376144409},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.8178975582122803},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6269058585166931},{"id":"https://openalex.org/keywords/type-theory","display_name":"Type theory","score":0.5525767207145691},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.45655858516693115},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4400302767753601},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42872336506843567},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.4143831431865692},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.34405550360679626},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1344892680644989}],"concepts":[{"id":"https://openalex.org/C2780624054","wikidata":"https://www.wikidata.org/wiki/Q34010","display_name":"Haskell","level":3,"score":0.9424865245819092},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8325909376144409},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.8178975582122803},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6269058585166931},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.5525767207145691},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.45655858516693115},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4400302767753601},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42872336506843567},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.4143831431865692},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.34405550360679626},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1344892680644989},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2804302.2804307","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2804302.2804307","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2015 ACM SIGPLAN Symposium on Haskell","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7099999785423279,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1522857917","https://openalex.org/W2015617966","https://openalex.org/W2028880435","https://openalex.org/W2039211229","https://openalex.org/W2045900383","https://openalex.org/W2069858276","https://openalex.org/W2088727454","https://openalex.org/W2136758562","https://openalex.org/W2156285626","https://openalex.org/W2159595840","https://openalex.org/W2164778826","https://openalex.org/W2516704912","https://openalex.org/W2770340794","https://openalex.org/W2913986094","https://openalex.org/W4205241946","https://openalex.org/W6683303659","https://openalex.org/W6726419559","https://openalex.org/W6828535928"],"related_works":["https://openalex.org/W2112263414","https://openalex.org/W3004782279","https://openalex.org/W1602185604","https://openalex.org/W2028779182","https://openalex.org/W4242678340","https://openalex.org/W2140654465","https://openalex.org/W2129253059","https://openalex.org/W1488646450","https://openalex.org/W4296274916","https://openalex.org/W3006157134"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2],"technique":[3,13],"for":[4,19],"integrating":[5],"GHC's":[6],"type-checker":[7],"with":[8,52],"an":[9],"SMT":[10,70],"solver.":[11],"The":[12],"was":[14],"developed":[15],"to":[16,43,50],"add":[17],"support":[18],"reasoning":[20,59],"about":[21,60],"type-level":[22,61],"functions":[23],"on":[24],"natural":[25],"numbers,":[26],"and":[27,46],"so":[28],"our":[29],"implementation":[30],"uses":[31],"the":[32,38],"theory":[33,67],"of":[34],"linear":[35],"arithmetic.":[36],"However,":[37],"approach":[39],"is":[40],"not":[41],"limited":[42],"this":[44],"theory,":[45],"makes":[47],"it":[48],"possible":[49],"experiment":[51],"other":[53,66],"external":[54],"decision":[55],"procedures,":[56],"such":[57],"as":[58],"booleans,":[62],"bit-vectors,":[63],"or":[64],"any":[65],"supported":[68],"by":[69],"solvers.":[71]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}