{"id":"https://openalex.org/W2949578585","doi":"https://doi.org/10.2168/lmcs-7(2:16)2011","title":"Logical Step-Indexed Logical Relations","display_name":"Logical Step-Indexed Logical Relations","publication_year":2011,"publication_date":"2011-06-07","ids":{"openalex":"https://openalex.org/W2949578585","doi":"https://doi.org/10.2168/lmcs-7(2:16)2011","mag":"2949578585"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-7(2:16)2011","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-7(2:16)2011","pdf_url":"https://lmcs.episciences.org/698/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":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/698/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050585539","display_name":"Derek Dreyer","orcid":"https://orcid.org/0000-0002-3884-6867"},"institutions":[{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Derek Dreyer","raw_affiliation_strings":["MPI-SWS, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MPI-SWS, Germany","institution_ids":["https://openalex.org/I4210121786"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084250644","display_name":"Amal Ahmed","orcid":"https://orcid.org/0000-0001-7424-572X"},"institutions":[{"id":"https://openalex.org/I592451","display_name":"Indiana University","ror":"https://ror.org/01kg8sb98","country_code":"US","type":"education","lineage":["https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amal Ahmed","raw_affiliation_strings":["Indiana University, USA"],"raw_orcid":"https://orcid.org/0000-0001-7424-572X","affiliations":[{"raw_affiliation_string":"Indiana University, USA","institution_ids":["https://openalex.org/I592451"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055959064","display_name":"Lars Birkedal","orcid":"https://orcid.org/0000-0003-1320-0098"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Lars Birkedal","raw_affiliation_strings":["IT University of Copenhagen, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1982,"has_fulltext":true,"cited_by_count":57,"citation_normalized_percentile":{"value":0.90043075,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"Volume 7, Issue 2","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.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.9994000196456909,"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.9991000294685364,"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/mathematical-proof","display_name":"Mathematical proof","score":0.6320246458053589},{"id":"https://openalex.org/keywords/equivalence-relation","display_name":"Equivalence relation","score":0.6209078431129456},{"id":"https://openalex.org/keywords/binary-relation","display_name":"Binary relation","score":0.5745040774345398},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5693764090538025},{"id":"https://openalex.org/keywords/logical-consequence","display_name":"Logical consequence","score":0.514313817024231},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.503849446773529},{"id":"https://openalex.org/keywords/modal-logic","display_name":"Modal logic","score":0.4921104311943054},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.47437745332717896},{"id":"https://openalex.org/keywords/logical-equivalence","display_name":"Logical equivalence","score":0.4721774458885193},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4343242347240448},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42476382851600647},{"id":"https://openalex.org/keywords/logical-connective","display_name":"Logical connective","score":0.42415809631347656},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.4174045920372009},{"id":"https://openalex.org/keywords/logical-framework","display_name":"Logical framework","score":0.4104347825050354},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.3736684322357178},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3685078024864197},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3429866433143616},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1465039849281311}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6320246458053589},{"id":"https://openalex.org/C156103551","wikidata":"https://www.wikidata.org/wiki/Q130998","display_name":"Equivalence relation","level":2,"score":0.6209078431129456},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.5745040774345398},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5693764090538025},{"id":"https://openalex.org/C134752490","wikidata":"https://www.wikidata.org/wiki/Q374182","display_name":"Logical consequence","level":2,"score":0.514313817024231},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.503849446773529},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.4921104311943054},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.47437745332717896},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.4721774458885193},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4343242347240448},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42476382851600647},{"id":"https://openalex.org/C194989596","wikidata":"https://www.wikidata.org/wiki/Q211790","display_name":"Logical connective","level":2,"score":0.42415809631347656},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.4174045920372009},{"id":"https://openalex.org/C20693621","wikidata":"https://www.wikidata.org/wiki/Q6667502","display_name":"Logical framework","level":2,"score":0.4104347825050354},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.3736684322357178},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3685078024864197},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3429866433143616},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1465039849281311},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.2168/lmcs-7(2:16)2011","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-7(2:16)2011","pdf_url":"https://lmcs.episciences.org/698/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"},{"id":"pmh:oai:arXiv.org:1103.0510","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1103.0510","pdf_url":"https://arxiv.org/pdf/1103.0510","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":null,"raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.770.6430","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.770.6430","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1103.0510.pdf","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:e61ee486b64647049af4439dff107ba2","is_oa":true,"landing_page_url":"https://doaj.org/article/e61ee486b64647049af4439dff107ba2","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 7, Issue 2 (2011)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-7(2:16)2011","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-7(2:16)2011","pdf_url":"https://lmcs.episciences.org/698/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/W2949578585.pdf","grobid_xml":"https://content.openalex.org/works/W2949578585.grobid-xml"},"referenced_works_count":43,"referenced_works":["https://openalex.org/W1480685649","https://openalex.org/W1508098446","https://openalex.org/W1589260337","https://openalex.org/W1799596037","https://openalex.org/W1847926715","https://openalex.org/W1956373135","https://openalex.org/W1973030866","https://openalex.org/W1991984504","https://openalex.org/W1992889841","https://openalex.org/W2045564677","https://openalex.org/W2057292961","https://openalex.org/W2060852846","https://openalex.org/W2085080904","https://openalex.org/W2091779700","https://openalex.org/W2100559921","https://openalex.org/W2100747331","https://openalex.org/W2101254143","https://openalex.org/W2104795876","https://openalex.org/W2112121519","https://openalex.org/W2116509046","https://openalex.org/W2123329569","https://openalex.org/W2125379835","https://openalex.org/W2132181573","https://openalex.org/W2134181241","https://openalex.org/W2135365827","https://openalex.org/W2144562508","https://openalex.org/W2149412346","https://openalex.org/W2152787740","https://openalex.org/W2153128836","https://openalex.org/W2161773169","https://openalex.org/W2163690888","https://openalex.org/W2267818505","https://openalex.org/W3003392917","https://openalex.org/W3016757878","https://openalex.org/W3082353674","https://openalex.org/W4210653864","https://openalex.org/W4229652664","https://openalex.org/W4230665378","https://openalex.org/W4232387295","https://openalex.org/W4242021682","https://openalex.org/W4251232459","https://openalex.org/W4252501555","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4366544912","https://openalex.org/W2096644947","https://openalex.org/W3021442973","https://openalex.org/W1983131890","https://openalex.org/W2015686858","https://openalex.org/W1600220056","https://openalex.org/W2044829924","https://openalex.org/W4313642989","https://openalex.org/W4283810044","https://openalex.org/W4390765570"],"abstract_inverted_index":{"Appel":[0],"and":[1,12,30,43,80,94,116,161],"McAllester's":[2],"\"step-indexed\"":[3],"logical":[4,75,127,145],"relations":[5,76,104],"have":[6],"proven":[7],"to":[8,51,70],"be":[9],"a":[10,86,126,149],"simple":[11],"effective":[13],"technique":[14],"for":[15,97,129],"reasoning":[16,130],"about":[17,72,132],"programs":[18,133],"in":[19,77,124,134],"languages":[20],"with":[21,139,154],"semantically":[22],"interesting":[23],"types,":[24],"such":[25],"as":[26],"general":[27,31,140],"recursive":[28,141],"types":[29],"reference":[32],"types.":[33,142],"However,":[34],"proofs":[35],"using":[36],"step-indexed":[37,74],"models":[38],"typically":[39],"involve":[40],"tedious,":[41],"error-prone,":[42],"proof-obscuring":[44],"step-index":[45],"arithmetic,":[46],"so":[47],"it":[48],"is":[49,90],"important":[50],"develop":[52],"clean,":[53],"high-level,":[54],"equational":[55],"proof":[56],"principles":[57],"that":[58],"avoid":[59],"mention":[60],"of":[61,107,151],"step":[62],"indices.":[63],"In":[64],"this":[65,144],"paper,":[66],"we":[67,84,147,156],"show":[68],"how":[69],"reason":[71],"binary":[73],"an":[78],"abstract":[79],"elegant":[81],"way.":[82],"Specifically,":[83],"define":[85],"logic":[87,96],"LSLR,":[88],"which":[89,155],"inspired":[91],"by":[92,105],"Plotkin":[93],"Abadi's":[95],"parametricity,":[98],"but":[99],"also":[100],"supports":[101],"recursively":[102],"defined":[103],"means":[106],"the":[108],"modal":[109,119],"\"later\"":[110],"operator":[111],"from":[112],"Appel,":[113],"Melli\\`es,":[114],"Richards,":[115],"Vouillon's":[117],"\"very":[118],"model\"":[120],"paper.":[121],"We":[122],"encode":[123],"LSLR":[125],"relation":[128],"relationally":[131],"call-by-value":[135],"System":[136],"F":[137],"extended":[138],"Using":[143],"relation,":[146],"derive":[148],"set":[150],"useful":[152],"rules":[153],"can":[157],"prove":[158],"contextual":[159],"equivalence":[160],"approximation":[162],"results":[163],"without":[164],"counting":[165],"steps.":[166]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}