{"id":"https://openalex.org/W2507710874","doi":"https://doi.org/10.1145/3009837.3009878","title":"Dijkstra monads for free","display_name":"Dijkstra monads for free","publication_year":2016,"publication_date":"2016-12-22","ids":{"openalex":"https://openalex.org/W2507710874","doi":"https://doi.org/10.1145/3009837.3009878","mag":"2507710874"},"language":"en","primary_location":{"id":"doi:10.1145/3009837.3009878","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3009837.3009878","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1608.06499","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050436525","display_name":"Danel Ahman","orcid":"https://orcid.org/0000-0001-6595-2756"},"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"]},{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]},{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["GB","US"],"is_corresponding":true,"raw_author_name":"Danel Ahman","raw_affiliation_strings":["University of Edinburgh, UK / Microsoft Research, USA","School of Informatics [Edimbourg]"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, UK / Microsoft Research, USA","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4210164937","https://openalex.org/I98677209"]},{"raw_affiliation_string":"School of Informatics [Edimbourg]","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5106466226","display_name":"C\u0103t\u0103lin Hri\u0163cu","orcid":"https://orcid.org/0000-0001-8919-8081"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210132990","display_name":"State Key Laboratory of Cryptology","ror":"https://ror.org/02pn5rj08","country_code":"CN","type":"government","lineage":["https://openalex.org/I4210132990"]}],"countries":["CN","US"],"is_corresponding":false,"raw_author_name":"C\u0103t\u0103lin Hri\u0163cu","raw_affiliation_strings":["Inria, France / Microsoft Research, USA","Programming securely with cryptography"],"affiliations":[{"raw_affiliation_string":"Inria, France / Microsoft Research, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Programming securely with cryptography","institution_ids":["https://openalex.org/I4210132990"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083750560","display_name":"Kenji Maillard","orcid":"https://orcid.org/0000-0001-5554-3203"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210132990","display_name":"State Key Laboratory of Cryptology","ror":"https://ror.org/02pn5rj08","country_code":"CN","type":"government","lineage":["https://openalex.org/I4210132990"]}],"countries":["CN","US"],"is_corresponding":false,"raw_author_name":"Kenji Maillard","raw_affiliation_strings":["Inria, France / ENS, France / Microsoft Research, USA","Programming securely with cryptography"],"affiliations":[{"raw_affiliation_string":"Inria, France / ENS, France / Microsoft Research, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Programming securely with cryptography","institution_ids":["https://openalex.org/I4210132990"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108010549","display_name":"Guido Mart\u00ednez","orcid":"https://orcid.org/0009-0005-5831-9991"},"institutions":[{"id":"https://openalex.org/I4210132990","display_name":"State Key Laboratory of Cryptology","ror":"https://ror.org/02pn5rj08","country_code":"CN","type":"government","lineage":["https://openalex.org/I4210132990"]},{"id":"https://openalex.org/I4141589","display_name":"National University of Rosario","ror":"https://ror.org/02tphfq59","country_code":"AR","type":"education","lineage":["https://openalex.org/I4141589"]}],"countries":["AR","CN"],"is_corresponding":false,"raw_author_name":"Guido Mart\u00ednez","raw_affiliation_strings":["Inria, France / Rosario National University, Argentina","Programming securely with cryptography"],"affiliations":[{"raw_affiliation_string":"Inria, France / Rosario National University, Argentina","institution_ids":["https://openalex.org/I4141589"]},{"raw_affiliation_string":"Programming securely with cryptography","institution_ids":["https://openalex.org/I4210132990"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070609290","display_name":"Gordon Plotkin","orcid":"https://orcid.org/0000-0001-8496-6096"},"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"]},{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"Gordon Plotkin","raw_affiliation_strings":["University of Edinburgh, UK / Microsoft Research, USA","School of Informatics [Edimbourg]"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, UK / Microsoft Research, USA","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4210164937","https://openalex.org/I98677209"]},{"raw_affiliation_string":"School of Informatics [Edimbourg]","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055019834","display_name":"Jonathan Protzenko","orcid":"https://orcid.org/0000-0001-7347-3050"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jonathan Protzenko","raw_affiliation_strings":["Microsoft Research, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102801489","display_name":"Aseem Rastogi","orcid":"https://orcid.org/0000-0003-3283-8011"},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Aseem Rastogi","raw_affiliation_strings":["Microsoft Research, India"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, India","institution_ids":["https://openalex.org/I4210124949"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039334115","display_name":"Nikhil Swamy","orcid":"https://orcid.org/0000-0001-5348-9266"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nikhil Swamy","raw_affiliation_strings":["Microsoft Research, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":5,"institutions_distinct_count":8,"corresponding_author_ids":["https://openalex.org/A5050436525"],"corresponding_institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4210164937","https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":4.79190694,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.97680808,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"515","last_page":"529"},"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/T11424","display_name":"Security and Verification in Computing","score":0.9988999962806702,"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.9925000071525574,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8388108015060425},{"id":"https://openalex.org/keywords/dependent-type","display_name":"Dependent type","score":0.7609871625900269},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.715107798576355},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7074771523475647},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6349067687988281},{"id":"https://openalex.org/keywords/type-theory","display_name":"Type theory","score":0.6342349648475647},{"id":"https://openalex.org/keywords/hoare-logic","display_name":"Hoare logic","score":0.5390068888664246},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.5041831731796265},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4588213264942169},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39848965406417847},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1825667917728424},{"id":"https://openalex.org/keywords/natural-deduction","display_name":"Natural deduction","score":0.1324007213115692},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.0734117329120636}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8388108015060425},{"id":"https://openalex.org/C20528804","wikidata":"https://www.wikidata.org/wiki/Q997433","display_name":"Dependent type","level":3,"score":0.7609871625900269},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.715107798576355},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7074771523475647},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6349067687988281},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.6342349648475647},{"id":"https://openalex.org/C104949639","wikidata":"https://www.wikidata.org/wiki/Q1375924","display_name":"Hoare logic","level":3,"score":0.5390068888664246},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.5041831731796265},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4588213264942169},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39848965406417847},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1825667917728424},{"id":"https://openalex.org/C62073222","wikidata":"https://www.wikidata.org/wiki/Q1572108","display_name":"Natural deduction","level":2,"score":0.1324007213115692},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0734117329120636},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/3009837.3009878","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3009837.3009878","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1608.06499","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1608.06499","pdf_url":"https://arxiv.org/pdf/1608.06499","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:HAL:hal-01424794v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01424794","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"44th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL), 2017, Paris, France. pp.515-529, ⟨10.1145/3009837.3009878⟩","raw_type":"Conference papers"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/05c25950-2f17-4c04-a620-8439cceeff40","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/05c25950-2f17-4c04-a620-8439cceeff40","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Ahman, D, Hritcu, C, Maillard, K, Mart\u00ednez, G, Plotkin, G, Protzenko, J, Rastogi, A & Swamy, N 2017, Dijkstra Monads for Free. in Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages. ACM SIGPLAN Notices, no. 1, vol. 52, pp. 515-529, 44th ACM SIGPLAN Symposium on Principles of Programming Languages 2017, Paris, France, 15/01/17. https://doi.org/10.1145/3009837.3009878","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.ed.ac.uk:publications/05c25950-2f17-4c04-a620-8439cceeff40","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11820/05c25950-2f17-4c04-a620-8439cceeff40","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"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":"Ahman, D, Hritcu, C, Maillard, K, Mart\u00ednez, G, Plotkin, G, Protzenko, J, Rastogi, A & Swamy, N 2017, Dijkstra Monads for Free. in Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages. ACM SIGPLAN Notices, no. 1, vol. 52, pp. 515-529, 44th ACM SIGPLAN Symposium on Principles of Programming Languages 2017, Paris, France, 15/01/17. https://doi.org/10.1145/3009837.3009878","raw_type":"contributionToPeriodical"},{"id":"doi:10.48550/arxiv.1608.06499","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1608.06499","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1608.06499","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1608.06499","pdf_url":"https://arxiv.org/pdf/1608.06499","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W156309329","https://openalex.org/W1830421783","https://openalex.org/W1967019306","https://openalex.org/W1974921390","https://openalex.org/W1977285241","https://openalex.org/W1980476455","https://openalex.org/W1986402635","https://openalex.org/W1990409169","https://openalex.org/W2008880956","https://openalex.org/W2030360570","https://openalex.org/W2037984920","https://openalex.org/W2048536148","https://openalex.org/W2066210260","https://openalex.org/W2073904768","https://openalex.org/W2097327552","https://openalex.org/W2099741881","https://openalex.org/W2113069707","https://openalex.org/W2114347252","https://openalex.org/W2118671630","https://openalex.org/W2122049982","https://openalex.org/W2127203965","https://openalex.org/W2129671708","https://openalex.org/W2130427425","https://openalex.org/W2149996206","https://openalex.org/W2156876717","https://openalex.org/W2162298406","https://openalex.org/W2170528665","https://openalex.org/W2212044066","https://openalex.org/W2259919125","https://openalex.org/W2267469130","https://openalex.org/W2291662397","https://openalex.org/W2294422796","https://openalex.org/W2295914203","https://openalex.org/W2338036611","https://openalex.org/W2460339236","https://openalex.org/W2560355278","https://openalex.org/W4244177239","https://openalex.org/W4253277433","https://openalex.org/W6606350199","https://openalex.org/W6674953262","https://openalex.org/W6676618520","https://openalex.org/W6683097175"],"related_works":["https://openalex.org/W2109631547","https://openalex.org/W1976278597","https://openalex.org/W1677332761","https://openalex.org/W1559167525","https://openalex.org/W2264209468","https://openalex.org/W2114058479","https://openalex.org/W3006935326","https://openalex.org/W1510554082","https://openalex.org/W2114705282","https://openalex.org/W4387793259"],"abstract_inverted_index":{"Dijkstra":[0,50,76],"monads":[1,51,77],"enable":[2],"a":[3,59,82,102,114,123,132],"dependent":[4,93],"type":[5,94],"theory":[6],"to":[7,64],"be":[8,53],"enhanced":[9],"with":[10,22,122],"support":[11],"for":[12],"specifying":[13],"and":[14,43,84,113,126,137],"verifying":[15],"effectful":[16],"code":[17],"via":[18,109],"weakest":[19],"preconditions.":[20],"Together":[21],"their":[23],"closely":[24],"related":[25],"counterparts,":[26],"Hoare":[27,39],"monads,":[28],"they":[29],"provide":[30],"the":[31,65,70],"basis":[32],"on":[33],"which":[34],"verification":[35],"tools":[36],"like":[37],"F*,":[38],"Type":[40],"Theory":[41],"(HTT),":[42],"Ynot":[44],"are":[45],"built.":[46],"We":[47,96],"show":[48],"that":[49],"can":[52],"derived":[54],"\"for":[55],"free\"":[56],"by":[57],"applying":[58],"continuation-passing":[60],"style":[61],"(CPS)":[62],"translation":[63],"standard":[66],"monadic":[67],"definitions":[68],"of":[69,87,135],"underlying":[71],"computational":[72],"effects.":[73],"Automatically":[74],"deriving":[75],"in":[78,92,100],"this":[79],"way":[80,86],"provides":[81],"correct-by-construction":[83],"efficient":[85],"reasoning":[88],"about":[89],"user-defined":[90],"effects":[91],"theories.":[95],"demonstrate":[97],"these":[98],"ideas":[99],"EMF*,":[101],"new":[103],"dependently":[104],"typed":[105],"calculus,":[106],"validating":[107],"it":[108],"both":[110],"formal":[111],"proof":[112],"prototype":[115],"implementation":[116],"within":[117,140],"F*.":[118,141],"Besides":[119],"equipping":[120],"F*":[121],"more":[124],"uniform":[125],"extensible":[127],"effect":[128],"system,":[129],"EMF*":[130],"enables":[131],"novel":[133],"mixture":[134],"intrinsic":[136],"extrinsic":[138],"proofs":[139]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":8}],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2016-09-16T00:00:00"}