{"id":"https://openalex.org/W2104795876","doi":"https://doi.org/10.1145/1596550.1596567","title":"Biorthogonality, step-indexing and compiler correctness","display_name":"Biorthogonality, step-indexing and compiler correctness","publication_year":2009,"publication_date":"2009-08-31","ids":{"openalex":"https://openalex.org/W2104795876","doi":"https://doi.org/10.1145/1596550.1596567","mag":"2104795876"},"language":"en","primary_location":{"id":"doi:10.1145/1596550.1596567","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1596550.1596567","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th ACM SIGPLAN international conference on Functional programming","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/A5023252122","display_name":"Nick Benton","orcid":null},"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/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":true,"raw_author_name":"Nick Benton","raw_affiliation_strings":["Microsoft Research, Cambridge, United Kingdom","Microsoft Research, Cambridge, United Kingdom ("],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Cambridge, United Kingdom","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"Microsoft Research, Cambridge, United Kingdom (","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035382393","display_name":"Chung-Kil Hur","orcid":"https://orcid.org/0000-0002-1656-0913"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Chung-Kil Hur","raw_affiliation_strings":["University of Cambridge, Cambridge, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Cambridge, Cambridge, United Kingdom","institution_ids":["https://openalex.org/I241749"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023252122"],"corresponding_institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"],"apc_list":null,"apc_paid":null,"fwci":17.6148,"has_fulltext":false,"cited_by_count":120,"citation_normalized_percentile":{"value":0.99292931,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"97","last_page":"108"},"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.9997000098228455,"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.9997000098228455,"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.9908999800682068,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/programming-language","display_name":"Programming language","score":0.8238571286201477},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8104734420776367},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.8058781623840332},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.789480447769165},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.6599290370941162},{"id":"https://openalex.org/keywords/denotational-semantics","display_name":"Denotational semantics","score":0.6585626602172852},{"id":"https://openalex.org/keywords/compiler-correctness","display_name":"Compiler correctness","score":0.5611525774002075},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5517522692680359},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.482810378074646},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.47219929099082947},{"id":"https://openalex.org/keywords/compiler-construction","display_name":"Compiler construction","score":0.4450230896472931},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.43748411536216736},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.3993105888366699},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36945661902427673},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1074242889881134}],"concepts":[{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.8238571286201477},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8104734420776367},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8058781623840332},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.789480447769165},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6599290370941162},{"id":"https://openalex.org/C207648694","wikidata":"https://www.wikidata.org/wiki/Q1189746","display_name":"Denotational semantics","level":4,"score":0.6585626602172852},{"id":"https://openalex.org/C68366613","wikidata":"https://www.wikidata.org/wiki/Q5156378","display_name":"Compiler correctness","level":3,"score":0.5611525774002075},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5517522692680359},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.482810378074646},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.47219929099082947},{"id":"https://openalex.org/C9957790","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler construction","level":3,"score":0.4450230896472931},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.43748411536216736},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.3993105888366699},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36945661902427673},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1074242889881134},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1596550.1596567","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1596550.1596567","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th ACM SIGPLAN international conference on Functional programming","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.146.2953","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.146.2953","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/~nick/realize.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.150.1732","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.1732","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/~nick/icfp074-benton.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.163.9988","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.9988","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.pps.jussieu.fr/~gil/publications/realize.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.219.4844","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.4844","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cl.cam.ac.uk/~ckh25/publications/realize.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1508098446","https://openalex.org/W1511668635","https://openalex.org/W1593280365","https://openalex.org/W1596014701","https://openalex.org/W1808214913","https://openalex.org/W1813662263","https://openalex.org/W1965602413","https://openalex.org/W1969600954","https://openalex.org/W1982866418","https://openalex.org/W1991984504","https://openalex.org/W1992347193","https://openalex.org/W2005968294","https://openalex.org/W2007270285","https://openalex.org/W2007974484","https://openalex.org/W2034043336","https://openalex.org/W2038176982","https://openalex.org/W2038237961","https://openalex.org/W2050469558","https://openalex.org/W2100559921","https://openalex.org/W2102339469","https://openalex.org/W2113757735","https://openalex.org/W2114702512","https://openalex.org/W2127625071","https://openalex.org/W2129695855","https://openalex.org/W2157480301","https://openalex.org/W2160740215","https://openalex.org/W2561675875","https://openalex.org/W2914920194","https://openalex.org/W3141241911","https://openalex.org/W4229652664","https://openalex.org/W4242150334","https://openalex.org/W4285719527","https://openalex.org/W6638366060","https://openalex.org/W6652040434","https://openalex.org/W6678583010"],"related_works":["https://openalex.org/W2155757092","https://openalex.org/W1517926351","https://openalex.org/W3003940348","https://openalex.org/W2555958265","https://openalex.org/W2515020773","https://openalex.org/W2134898533","https://openalex.org/W2534689250","https://openalex.org/W2104795876","https://openalex.org/W1542063909","https://openalex.org/W3118490272"],"abstract_inverted_index":{"We":[0],"define":[1],"logical":[2],"relations":[3],"between":[4],"the":[5,17,69],"denotational":[6],"semantics":[7],"of":[8,20,44,59],"a":[9,24,42,49,60],"simply":[10],"typed":[11],"functional":[12],"language":[13],"with":[14],"recursion":[15],"and":[16,35,53],"operational":[18],"behaviour":[19],"low-level":[21,45],"programs":[22],"in":[23,68],"variant":[25],"SECD":[26],"machine.":[27],"The":[28,63],"relations,":[29],"which":[30],"are":[31,54],"defined":[32],"using":[33],"biorthogonality":[34],"stepindexing,":[36],"capture":[37],"what":[38],"it":[39],"means":[40],"for":[41],"piece":[43],"code":[46],"to":[47,56],"implement":[48],"mathematical,":[50],"domain-theoretic":[51],"function":[52],"used":[55],"prove":[57],"correctness":[58],"simple":[61],"compiler.":[62],"results":[64],"have":[65],"been":[66],"formalized":[67],"Coq":[70],"proof":[71],"assistant.":[72]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":12}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}