{"id":"https://openalex.org/W4416851184","doi":"https://doi.org/10.46298/lmcs-21(4:25)2025","title":"Simplifying explicit subtyping coercions in a polymorphic calculus with effects","display_name":"Simplifying explicit subtyping coercions in a polymorphic calculus with effects","publication_year":2025,"publication_date":"2025-12-01","ids":{"openalex":"https://openalex.org/W4416851184","doi":"https://doi.org/10.46298/lmcs-21(4:25)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(4:25)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:25)2025","pdf_url":"https://lmcs.episciences.org/17009/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/17009/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067218728","display_name":"Filip Koprivec","orcid":"https://orcid.org/0000-0001-9624-9369"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Filip Koprivec","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5078127242","display_name":"Matija Pretnar","orcid":"https://orcid.org/0000-0001-7755-2303"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matija Pretnar","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5067218728"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20762813,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 21, Issue 4","issue":null,"first_page":null,"last_page":null},"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.8432000279426575,"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.8432000279426575,"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/T11424","display_name":"Security and Verification in Computing","score":0.03830000013113022,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.021400000900030136,"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/subtyping","display_name":"Subtyping","score":0.7778000235557556},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4675999879837036},{"id":"https://openalex.org/keywords/structuring","display_name":"Structuring","score":0.4255000054836273},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.33660000562667847},{"id":"https://openalex.org/keywords/dependent-type","display_name":"Dependent type","score":0.303600013256073},{"id":"https://openalex.org/keywords/program-optimization","display_name":"Program optimization","score":0.2596000134944916}],"concepts":[{"id":"https://openalex.org/C83852419","wikidata":"https://www.wikidata.org/wiki/Q2713292","display_name":"Subtyping","level":2,"score":0.7778000235557556},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7696999907493591},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5859000086784363},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4675999879837036},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4406000077724457},{"id":"https://openalex.org/C2775945657","wikidata":"https://www.wikidata.org/wiki/Q381442","display_name":"Structuring","level":2,"score":0.4255000054836273},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3968000113964081},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.33660000562667847},{"id":"https://openalex.org/C20528804","wikidata":"https://www.wikidata.org/wiki/Q997433","display_name":"Dependent type","level":3,"score":0.303600013256073},{"id":"https://openalex.org/C139571649","wikidata":"https://www.wikidata.org/wiki/Q1156793","display_name":"Program optimization","level":3,"score":0.2596000134944916},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.2554999887943268},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.25529998540878296},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.2540999948978424},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.46298/lmcs-21(4:25)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:25)2025","pdf_url":"https://lmcs.episciences.org/17009/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(4:25)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:25)2025","pdf_url":"https://lmcs.episciences.org/17009/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4416851184.pdf","grobid_xml":"https://content.openalex.org/works/W4416851184.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Algebraic":[0],"effect":[1,30],"handlers":[2],"are":[3,44],"becoming":[4],"an":[5],"increasingly":[6],"popular":[7],"way":[8],"of":[9,21,40,49,72,99,108],"structuring":[10],"effectful":[11,62],"computations,":[12],"and":[13,75,92],"their":[14],"performance":[15,95],"is":[16,28],"often":[17],"a":[18,60,97],"concern.":[19],"One":[20],"the":[22,38,70,85,89,106,109,112,116],"proposed":[23],"approaches":[24],"towards":[25],"efficient":[26,125],"compilation":[27],"tracking":[29],"information":[31],"through":[32],"explicit":[33],"subtyping":[34],"coercions.":[35],"However,":[36],"in":[37,88,122],"presence":[39],"polymorphism,":[41],"these":[42],"coercions":[43],"compiled":[45,50],"into":[46],"additional":[47],"arguments":[48],"functions,":[51],"incurring":[52],"significant":[53],"overhead.":[54],"In":[55,81],"this":[56],"paper,":[57],"we":[58,83,102],"present":[59],"polymorphic":[61],"calculus,":[63],"identify":[64],"simplification":[65,86],"phases":[66],"needed":[67],"to":[68],"reduce":[69],"number":[71,98],"unnecessary":[73],"constraints,":[74],"prove":[76,105],"that":[77,115],"they":[78],"preserve":[79],"semantics.":[80],"addition,":[82],"implement":[84],"algorithm":[87,117],"Eff":[90],"language":[91],"evaluate":[93],"its":[94],"on":[96],"benchmarks.":[100],"Though":[101],"do":[103],"not":[104],"optimality":[107],"presented":[110],"simplifications,":[111],"results":[113],"show":[114],"eliminates":[118],"all":[119],"coercions,":[120],"resulting":[121],"code":[123],"as":[124,126],"manually":[127],"monomorphised":[128],"one.":[129]},"counts_by_year":[],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-12-01T00:00:00"}