{"id":"https://openalex.org/W2105641926","doi":"https://doi.org/10.1145/1481861.1481873","title":"Relational parametricity for references and recursive types","display_name":"Relational parametricity for references and recursive types","publication_year":2009,"publication_date":"2009-01-24","ids":{"openalex":"https://openalex.org/W2105641926","doi":"https://doi.org/10.1145/1481861.1481873","mag":"2105641926"},"language":"en","primary_location":{"id":"doi:10.1145/1481861.1481873","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1481861.1481873","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 4th international workshop on Types in language design and implementation","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/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, DK-2300 Copenhagen S, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, DK-2300 Copenhagen S, Denmark","institution_ids":["https://openalex.org/I83467386"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111987405","display_name":"Kristian St\u00f8vring","orcid":null},"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":"Kristian St\u00f8vring","raw_affiliation_strings":["IT University of Copenhagen, DK-2300 Copenhagen S, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, DK-2300 Copenhagen S, Denmark","institution_ids":["https://openalex.org/I83467386"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019115412","display_name":"Jacob Thamsborg","orcid":null},"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":"Jacob Thamsborg","raw_affiliation_strings":["IT University of Copenhagen, DK-2300 Copenhagen S, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, DK-2300 Copenhagen S, Denmark","institution_ids":["https://openalex.org/I83467386"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.0768,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.94007972,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"91","last_page":"104"},"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.9998000264167786,"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.9998000264167786,"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.9980999827384949,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9941999912261963,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7410846948623657},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6667388081550598},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6044828295707703},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.6027733087539673},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5590319037437439},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.549205482006073},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5258191823959351},{"id":"https://openalex.org/keywords/well-founded-semantics","display_name":"Well-founded semantics","score":0.4835914969444275},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4593643546104431},{"id":"https://openalex.org/keywords/denotational-semantics","display_name":"Denotational semantics","score":0.4050692319869995},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2108316421508789},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18639206886291504},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.13255587220191956}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7410846948623657},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6667388081550598},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6044828295707703},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.6027733087539673},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5590319037437439},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.549205482006073},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5258191823959351},{"id":"https://openalex.org/C89497691","wikidata":"https://www.wikidata.org/wiki/Q7981058","display_name":"Well-founded semantics","level":5,"score":0.4835914969444275},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4593643546104431},{"id":"https://openalex.org/C207648694","wikidata":"https://www.wikidata.org/wiki/Q1189746","display_name":"Denotational semantics","level":4,"score":0.4050692319869995},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2108316421508789},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18639206886291504},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.13255587220191956}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/1481861.1481873","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1481861.1481873","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 4th international workshop on Types in language design and implementation","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/886abcc0-5b63-11de-8664-000ea68e967b","is_oa":false,"landing_page_url":"https://pure.itu.dk/portal/da/publications/886abcc0-5b63-11de-8664-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Birkedal, L, St\u00f8vring, K & Thamsborg, J J 2009, Relational Parametricity for References and Recursive Types. in A Kennedy & A Ahmed (eds), \u00a0Proceedings of TLDI'09: 2009 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, Savannah, GA, USA, January 24, 2009.. Association for Computing Machinery, pp. 91-104.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.142.2781","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.2781","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.it-c.dk/~birkedal/papers/poswsr-conf.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.516.7593","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.516.7593","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.itu.dk/people/thamsborg/shadow.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.517.1620","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.517.1620","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://itu.dk/~kss/papers/tldi09.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.564.9349","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.564.9349","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.itu.dk/people/thamsborg/longshadow.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.699999988079071,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W326743114","https://openalex.org/W1480685649","https://openalex.org/W1491719272","https://openalex.org/W1495825275","https://openalex.org/W1508098446","https://openalex.org/W1530251842","https://openalex.org/W1557561422","https://openalex.org/W1568326153","https://openalex.org/W1580157489","https://openalex.org/W1596161732","https://openalex.org/W1815958522","https://openalex.org/W1956373135","https://openalex.org/W1965602413","https://openalex.org/W1991984504","https://openalex.org/W1992889841","https://openalex.org/W1994376732","https://openalex.org/W2002475773","https://openalex.org/W2018103337","https://openalex.org/W2045564677","https://openalex.org/W2055395262","https://openalex.org/W2057292961","https://openalex.org/W2060852846","https://openalex.org/W2099116867","https://openalex.org/W2100559921","https://openalex.org/W2101444617","https://openalex.org/W2112122837","https://openalex.org/W2112242174","https://openalex.org/W2122220040","https://openalex.org/W2125379835","https://openalex.org/W2128271514","https://openalex.org/W2149412346","https://openalex.org/W2152787740","https://openalex.org/W2161773169","https://openalex.org/W2738472525","https://openalex.org/W2763348751","https://openalex.org/W3098849834","https://openalex.org/W3103448499","https://openalex.org/W4229652664","https://openalex.org/W4230665378","https://openalex.org/W4251576870","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W91938043","https://openalex.org/W3129725704","https://openalex.org/W2070801544","https://openalex.org/W2072493788","https://openalex.org/W1988438613","https://openalex.org/W2077853828","https://openalex.org/W1487472891","https://openalex.org/W1508065823","https://openalex.org/W2348616540","https://openalex.org/W3036972880"],"abstract_inverted_index":{"We":[0,86,106],"present":[1,93],"a":[2,7,31,54,100,117],"possible":[3],"world":[4],"semantics":[5,45,111,120],"for":[6],"call-by-value":[8],"higher-order":[9],"programming":[10,32],"language":[11,33],"with":[12,34,114],"impredicative":[13,40],"polymorphism,":[14],"general":[15,84],"references,":[16],"and":[17,92,121],"recursive":[18,75],"types.":[19,76],"The":[20],"model":[21,39],"is":[22,58,62,112],"one":[23],"of":[24,30,46,68,74,83,99,125],"the":[25,44,66,72,78,89,109],"first":[26],"relationally":[27],"parametric":[28],"models":[29],"all":[35],"these":[36],"features.":[37],"To":[38],"polymorphism":[41],"we":[42],"define":[43],"types":[47],"via":[48,130],"parameterized":[49],"(world-indexed)":[50],"logical":[51,69],"relations":[52,70],"over":[53],"universal":[55],"domain.":[56],"It":[57],"well-known":[59],"that":[60,108],"it":[61],"non-trivial":[63],"to":[64,103,116],"show":[65],"existence":[67],"in":[71],"presence":[73],"Here":[77],"problems":[79,90],"are":[80,91],"exacerbated":[81],"because":[82],"references.":[85,105],"explain":[87],"what":[88],"our":[94],"solution,":[95],"which":[96],"makes":[97],"use":[98],"novel":[101],"approach":[102],"modeling":[104],"prove":[107],"resulting":[110],"adequate":[113],"respect":[115],"standard":[118],"operational":[119],"include":[122],"simple":[123],"examples":[124],"reasoning":[126],"about":[127],"contextual":[128],"equivalence":[129],"parametricity.":[131]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}