{"id":"https://openalex.org/W2160668778","doi":"https://doi.org/10.1017/s0956796899003482","title":"Compilation and equivalence of imperative objects","display_name":"Compilation and equivalence of imperative objects","publication_year":1999,"publication_date":"1999-07-01","ids":{"openalex":"https://openalex.org/W2160668778","doi":"https://doi.org/10.1017/s0956796899003482","mag":"2160668778"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796899003482","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796899003482","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/1AA6AF3D5AB7A4270503884EFF380211/S0956796899003482a.pdf/div-class-title-compilation-and-equivalence-of-imperative-objects-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/1AA6AF3D5AB7A4270503884EFF380211/S0956796899003482a.pdf/div-class-title-compilation-and-equivalence-of-imperative-objects-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078684560","display_name":"Andrew D. Gordon","orcid":"https://orcid.org/0000-0002-5809-2484"},"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"]},{"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":["GB","IN"],"is_corresponding":false,"raw_author_name":"ANDREW D. GORDON","raw_affiliation_strings":["Current affiliation: Microsoft Research. E-mail:","University of Cambridge Computer Laboratory, University of Cambridge, Cambridge, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Current affiliation: Microsoft Research. E-mail:","institution_ids":["https://openalex.org/I4210124949"]},{"raw_affiliation_string":"University of Cambridge Computer Laboratory, University of Cambridge, Cambridge, UK","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054049067","display_name":"Paul D. Hankin","orcid":null},"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":"PAUL D. HANKIN","raw_affiliation_strings":["University of Cambridge Computer Laboratory, University of Cambridge, Cambridge, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Cambridge Computer Laboratory, University of Cambridge, Cambridge, UK","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111582061","display_name":"S\u00f8ren B. Lassen","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]},{"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"]},{"id":"https://openalex.org/I4210087405","display_name":"Danish National Research Foundation","ror":"https://ror.org/00znyv691","country_code":"DK","type":"nonprofit","lineage":["https://openalex.org/I4210087405"]}],"countries":["DK","GB"],"is_corresponding":false,"raw_author_name":"S\u00d8REN B. LASSEN","raw_affiliation_strings":["BRICS","Basic Research in Computer Science, Centre of the Danish National Research Foundation","Current affiliation: University of Cambridge Computer Laboratory. E-mail:","Department of Computer Science, University of Aarhus, Aarhus, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"BRICS","institution_ids":[]},{"raw_affiliation_string":"Basic Research in Computer Science, Centre of the Danish National Research Foundation","institution_ids":["https://openalex.org/I4210087405"]},{"raw_affiliation_string":"Current affiliation: University of Cambridge Computer Laboratory. E-mail:","institution_ids":["https://openalex.org/I241749"]},{"raw_affiliation_string":"Department of Computer Science, University of Aarhus, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.161,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.89702417,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"9","issue":"4","first_page":"373","last_page":"426"},"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.9836999773979187,"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.9758999943733215,"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/correctness","display_name":"Correctness","score":0.8716108798980713},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.7808554172515869},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7267401218414307},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6757537126541138},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6312058568000793},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.5590483546257019},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.4838051199913025},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4247022867202759},{"id":"https://openalex.org/keywords/object-oriented-programming","display_name":"Object-oriented programming","score":0.4151465892791748},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32506635785102844},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2617908716201782},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19408094882965088}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8716108798980713},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.7808554172515869},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7267401218414307},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6757537126541138},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6312058568000793},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.5590483546257019},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.4838051199913025},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4247022867202759},{"id":"https://openalex.org/C73752529","wikidata":"https://www.wikidata.org/wiki/Q79872","display_name":"Object-oriented programming","level":2,"score":0.4151465892791748},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32506635785102844},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2617908716201782},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19408094882965088}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0956796899003482","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796899003482","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/1AA6AF3D5AB7A4270503884EFF380211/S0956796899003482a.pdf/div-class-title-compilation-and-equivalence-of-imperative-objects-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s0956796899003482","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796899003482","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/1AA6AF3D5AB7A4270503884EFF380211/S0956796899003482a.pdf/div-class-title-compilation-and-equivalence-of-imperative-objects-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.4699999988079071,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2160668778.pdf","grobid_xml":"https://content.openalex.org/works/W2160668778.grobid-xml"},"referenced_works_count":57,"referenced_works":["https://openalex.org/W67134903","https://openalex.org/W1484313699","https://openalex.org/W1486211078","https://openalex.org/W1531693393","https://openalex.org/W1539402181","https://openalex.org/W1544633123","https://openalex.org/W1557268818","https://openalex.org/W1559299058","https://openalex.org/W1563488194","https://openalex.org/W1580344507","https://openalex.org/W1583103249","https://openalex.org/W1597122400","https://openalex.org/W1597169141","https://openalex.org/W1604099552","https://openalex.org/W1747936984","https://openalex.org/W1808214913","https://openalex.org/W1829244603","https://openalex.org/W1973030866","https://openalex.org/W1997143185","https://openalex.org/W1997753121","https://openalex.org/W2005403834","https://openalex.org/W2007270285","https://openalex.org/W2010525351","https://openalex.org/W2018474310","https://openalex.org/W2026928233","https://openalex.org/W2038218207","https://openalex.org/W2040908214","https://openalex.org/W2053534205","https://openalex.org/W2068840591","https://openalex.org/W2071471611","https://openalex.org/W2078334802","https://openalex.org/W2088735483","https://openalex.org/W2089674328","https://openalex.org/W2092367588","https://openalex.org/W2098830227","https://openalex.org/W2101247081","https://openalex.org/W2103859677","https://openalex.org/W2104890704","https://openalex.org/W2113757735","https://openalex.org/W2118229393","https://openalex.org/W2118883965","https://openalex.org/W2122940757","https://openalex.org/W2137783828","https://openalex.org/W2141568518","https://openalex.org/W2147283777","https://openalex.org/W2154617594","https://openalex.org/W2160668778","https://openalex.org/W2160740215","https://openalex.org/W2170810021","https://openalex.org/W2476379118","https://openalex.org/W2732467558","https://openalex.org/W2914260883","https://openalex.org/W4242631312","https://openalex.org/W4248320979","https://openalex.org/W4254312383","https://openalex.org/W4285719527","https://openalex.org/W6632224487"],"related_works":["https://openalex.org/W3008339103","https://openalex.org/W2404647514","https://openalex.org/W1667647204","https://openalex.org/W4247536566","https://openalex.org/W3119814709","https://openalex.org/W2018477250","https://openalex.org/W1508895727","https://openalex.org/W4252501555","https://openalex.org/W2003848320","https://openalex.org/W2104890704"],"abstract_inverted_index":{"We":[0,31],"adopt":[1],"the":[2,43,52,77,110,138,153],"untyped":[3],"imperative":[4,154],"object":[5,155],"calculus":[6],"of":[7,20,54,76,79,98,104,116,141,143,149],"Abadi":[8,66],"and":[9,22,36,67,106,148],"Cardelli":[10],"as":[11],"a":[12,34,37,59,73,82,87,102,113],"minimal":[13],"setting":[14],"in":[15,127],"which":[16],"to":[17,81],"study":[18,140],"problems":[19],"compilation":[21,80],"program":[23],"equivalence":[24,53,97,151],"that":[25,63,95],"arise":[26],"when":[27],"compiling":[28],"object-oriented":[29,145],"languages.":[30],"present":[32],"both":[33],"big-step":[35],"small-step":[38,88],"substitution-based":[39,56],"operational":[40,118,150],"semantics":[41,57,61],"for":[42,131,152],"calculus.":[44,156],"Our":[45,69,91],"first":[46,139],"two":[47],"results":[48],"are":[49],"theorems":[50],"asserting":[51],"our":[55,128],"with":[58,101],"closure-based":[60],"like":[62],"given":[64],"by":[65],"Cardelli.":[68],"third":[70],"result":[71,93],"is":[72,94,137],"direct":[74],"proof":[75],"correctness":[78,142],"stack-based":[83],"abstract":[84,146],"machine":[85],"via":[86],"decompilation":[89],"algorithm.":[90],"fourth":[92],"contextual":[96],"objects":[99],"coincides":[100],"form":[103],"Mason":[105],"Talcott's":[107],"CIU":[108],"equivalence;":[109],"latter":[111],"provides":[112],"tractable":[114],"means":[115],"establishing":[117],"equivalences.":[119],"Finally,":[120],"we":[121],"prove":[122],"correct":[123],"an":[124,144],"algorithm,":[125],"used":[126],"prototype":[129],"compiler,":[130],"statically":[132],"resolving":[133],"method":[134],"offsets.":[135],"This":[136],"machine,":[147]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}