{"id":"https://openalex.org/W3175997608","doi":"https://doi.org/10.1109/lics52264.2021.9470514","title":"Evidenced Frames: A Unifying Framework Broadening Realizability Models","display_name":"Evidenced Frames: A Unifying Framework Broadening Realizability Models","publication_year":2021,"publication_date":"2021-06-29","ids":{"openalex":"https://openalex.org/W3175997608","doi":"https://doi.org/10.1109/lics52264.2021.9470514","mag":"3175997608"},"language":"en","primary_location":{"id":"doi:10.1109/lics52264.2021.9470514","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics52264.2021.9470514","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-03422961","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029629129","display_name":"Liron Cohen","orcid":"https://orcid.org/0000-0002-6608-3000"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Liron Cohen","raw_affiliation_strings":["Ben-Gurion University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010564634","display_name":"\u00c9tienne Miquey","orcid":"https://orcid.org/0000-0002-5987-6547"},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Etienne Miquey","raw_affiliation_strings":["\u00c9NS de Lyon"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\u00c9NS de Lyon","institution_ids":["https://openalex.org/I113428412"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001655224","display_name":"Ross Tate","orcid":"https://orcid.org/0000-0002-7608-4605"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ross Tate","raw_affiliation_strings":["Cornell University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell University","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1465,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.36783538,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"13"},"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.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.995199978351593,"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/realizability","display_name":"Realizability","score":0.9841086864471436},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.6110220551490784},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5991940498352051},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5288107395172119},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5096137523651123},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.4956134557723999},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.45628485083580017},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.4204689860343933},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3630548119544983},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3451555371284485},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28150051832199097},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2016180455684662},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1446060836315155}],"concepts":[{"id":"https://openalex.org/C2776378722","wikidata":"https://www.wikidata.org/wiki/Q3454417","display_name":"Realizability","level":2,"score":0.9841086864471436},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.6110220551490784},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5991940498352051},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5288107395172119},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5096137523651123},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.4956134557723999},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.45628485083580017},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.4204689860343933},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3630548119544983},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3451555371284485},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28150051832199097},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2016180455684662},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1446060836315155},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lics52264.2021.9470514","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics52264.2021.9470514","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-03422961v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-03422961","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"LICS 2021, Jul 2021, Rome, Italy. ⟨10.1109/LICS52264.2021.9470514⟩","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-03422961v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-03422961","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"LICS 2021, Jul 2021, Rome, Italy. ⟨10.1109/LICS52264.2021.9470514⟩","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6399999856948853,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W134205731","https://openalex.org/W142679191","https://openalex.org/W143876802","https://openalex.org/W624912723","https://openalex.org/W629880895","https://openalex.org/W1463471154","https://openalex.org/W1520893111","https://openalex.org/W1720922313","https://openalex.org/W1763978647","https://openalex.org/W1997143185","https://openalex.org/W2016326123","https://openalex.org/W2021790140","https://openalex.org/W2033693919","https://openalex.org/W2043566933","https://openalex.org/W2068413129","https://openalex.org/W2082631236","https://openalex.org/W2096877663","https://openalex.org/W2100490097","https://openalex.org/W2107359728","https://openalex.org/W2118238767","https://openalex.org/W2135287414","https://openalex.org/W2291208220","https://openalex.org/W2786132250","https://openalex.org/W2787682953","https://openalex.org/W2798115558","https://openalex.org/W2798724293","https://openalex.org/W2799398422","https://openalex.org/W2963271462","https://openalex.org/W2963769921","https://openalex.org/W2995889279","https://openalex.org/W3098075529","https://openalex.org/W3098832446","https://openalex.org/W3101322289","https://openalex.org/W3102331275","https://openalex.org/W3102365561","https://openalex.org/W3144889436","https://openalex.org/W4214621180","https://openalex.org/W4233046245","https://openalex.org/W4243933121","https://openalex.org/W6605920947","https://openalex.org/W6620004856","https://openalex.org/W6637656526","https://openalex.org/W6675387980","https://openalex.org/W6785867332","https://openalex.org/W6793045953"],"related_works":["https://openalex.org/W1603488308","https://openalex.org/W4298120007","https://openalex.org/W2136737082","https://openalex.org/W2321910655","https://openalex.org/W3173554384","https://openalex.org/W1517224694","https://openalex.org/W1857750633","https://openalex.org/W2051968535","https://openalex.org/W2284538163","https://openalex.org/W2169713163"],"abstract_inverted_index":{"Constructive":[0],"foundations":[1],"have":[2,20],"for":[3,10,91,141,169,174,191],"decades":[4],"been":[5],"built":[6],"upon":[7],"realizability":[8,18,77,93,195],"models":[9,19,78,94,106,143],"higher-order":[11,145],"logic":[12],"and":[13,31,163,193],"type":[14],"theory.":[15],"However,":[16],"traditional":[17],"a":[21,88,138],"rather":[22],"limited":[23],"notion":[24],"of":[25,49,130,144],"computation,":[26,131],"which":[27],"only":[28],"supports":[29],"non-termination":[30],"avoids":[32],"many":[33],"other":[34],"commonly":[35],"used":[36],"effects.":[37],"Work":[38],"to":[39,57,160],"address":[40],"these":[41,70,161],"limitations":[42,71],"has":[43],"typically":[44],"overlaid":[45],"structure":[46,75],"on":[47],"top":[48],"existing":[50,166],"models,":[51,162],"such":[52,114],"as":[53,115],"by":[54,72],"using":[55],"powersets":[56],"represent":[58],"non-determinism,":[59],"but":[60],"kept":[61],"the":[62,74,108,127,165],"realizers":[63,109],"themselves":[64,110],"deterministic.":[65],"This":[66],"paper":[67],"alternatively":[68],"addresses":[69],"making":[73],"underlying":[76],"more":[79],"flexible.":[80],"To":[81],"this":[82,103],"end,":[83],"we":[84,132,151,182],"introduce":[85],"evidenced":[86,135,154,185],"frames:":[87],"general-purpose":[89],"framework":[90,140,173],"building":[92],"that":[95,102,117,134,153,164,184],"support":[96],"diverse":[97],"effectful":[98],"computations.":[99],"We":[100],"demonstrate":[101,133],"flexibility":[104],"permits":[105],"wherein":[107],"can":[111,118],"be":[112],"effectful,":[113],"\u03bb-terms":[116],"manipulate":[119],"state,":[120],"reduce":[121],"non-deterministically,":[122],"or":[123],"fail":[124],"entirely.":[125],"Beyond":[126],"broader":[128],"notions":[129],"frames":[136,155,186],"form":[137],"unifying":[139,192],"(realizability)":[142],"dependent":[146],"predicate":[147],"logic.":[148],"In":[149],"particular,":[150],"prove":[152],"are":[156],"complete":[157],"with":[158],"respect":[159],"completeness":[167],"construction":[168],"implicative":[170],"algebras-another":[171],"foundational":[172],"realizability-factors":[175],"through":[176],"our":[177],"simpler":[178],"construction.":[179],"As":[180],"such,":[181],"conclude":[183],"offer":[187],"an":[188],"ideal":[189],"domain":[190],"broadening":[194],"models.":[196]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}