{"id":"https://openalex.org/W1760076687","doi":"https://doi.org/10.1109/lics.2002.1029837","title":"Computational adequacy for recursive types in models of intuitionistic set theory","display_name":"Computational adequacy for recursive types in models of intuitionistic set theory","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W1760076687","doi":"https://doi.org/10.1109/lics.2002.1029837","mag":"1760076687"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2002.1029837","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2002.1029837","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 17th Annual IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/1c86b93d-bdcc-42bc-96ba-5f2dea5d114a","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110256373","display_name":"Alex Simpson","orcid":null},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"A. Simpson","raw_affiliation_strings":["LFCS, Division of Informatics, University of Edinburgh, UK","[Div. of Informatics, Edinburgh Univ., UK]"],"affiliations":[{"raw_affiliation_string":"LFCS, Division of Informatics, University of Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"[Div. of Informatics, Edinburgh Univ., UK]","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110256373"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":0.9359,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.80042345,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"287","last_page":"298"},"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.9991000294685364,"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.9842000007629395,"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/realizability","display_name":"Realizability","score":0.7976897954940796},{"id":"https://openalex.org/keywords/set-theory","display_name":"Set theory","score":0.6143598556518555},{"id":"https://openalex.org/keywords/interpretation","display_name":"Interpretation (philosophy)","score":0.6073175072669983},{"id":"https://openalex.org/keywords/abstract-interpretation","display_name":"Abstract interpretation","score":0.5752362012863159},{"id":"https://openalex.org/keywords/denotational-semantics","display_name":"Denotational semantics","score":0.5684588551521301},{"id":"https://openalex.org/keywords/domain-theory","display_name":"Domain theory","score":0.5623811483383179},{"id":"https://openalex.org/keywords/type-theory","display_name":"Type theory","score":0.5411727428436279},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5247592926025391},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5007264614105225},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48980021476745605},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.4816219210624695},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.45935750007629395},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.4320821166038513},{"id":"https://openalex.org/keywords/truth-value","display_name":"Truth value","score":0.4139117896556854},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40859636664390564},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.3959534466266632},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3707939386367798},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.3139004111289978},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2706106901168823},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2039271593093872},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09132474660873413}],"concepts":[{"id":"https://openalex.org/C2776378722","wikidata":"https://www.wikidata.org/wiki/Q3454417","display_name":"Realizability","level":2,"score":0.7976897954940796},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.6143598556518555},{"id":"https://openalex.org/C527412718","wikidata":"https://www.wikidata.org/wiki/Q855395","display_name":"Interpretation (philosophy)","level":2,"score":0.6073175072669983},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.5752362012863159},{"id":"https://openalex.org/C207648694","wikidata":"https://www.wikidata.org/wiki/Q1189746","display_name":"Denotational semantics","level":4,"score":0.5684588551521301},{"id":"https://openalex.org/C29585364","wikidata":"https://www.wikidata.org/wiki/Q1079166","display_name":"Domain theory","level":2,"score":0.5623811483383179},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.5411727428436279},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5247592926025391},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5007264614105225},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48980021476745605},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.4816219210624695},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.45935750007629395},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.4320821166038513},{"id":"https://openalex.org/C46274116","wikidata":"https://www.wikidata.org/wiki/Q185521","display_name":"Truth value","level":2,"score":0.4139117896556854},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40859636664390564},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.3959534466266632},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3707939386367798},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.3139004111289978},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2706106901168823},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2039271593093872},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09132474660873413},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"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":9,"locations":[{"id":"doi:10.1109/lics.2002.1029837","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2002.1029837","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 17th Annual IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.153.6157","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.6157","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcs.ed.ac.uk/home/als/Research/cartinmist.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.153.8960","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.8960","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcs.ed.ac.uk/~als/Research/rec_adequacy.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.20.5049","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.5049","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcs.ed.ac.uk/home/als/Research/rec_adequacy.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.57.7955","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.7955","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dcs.edinburgh.ac.uk/home/als/Research/cartinmist-rims.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.96.4427","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.4427","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.kurims.kyoto-u.ac.jp/preprint/file/RIMS1410.pdf","raw_type":"text"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/1c86b93d-bdcc-42bc-96ba-5f2dea5d114a","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/1c86b93d-bdcc-42bc-96ba-5f2dea5d114a","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Simpson, A 2002, Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory. in Logic in Computer Science, 2002. Proceedings. 17th Annual IEEE Symposium on . Institute of Electrical and Electronics Engineers, pp. 287-298. https://doi.org/10.1109/LICS.2002.1029837","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.ed.ac.uk:publications/1baaebb4-f8de-4d58-8d0c-4545582c526a","is_oa":false,"landing_page_url":"http://hdl.handle.net/20.500.11820/1baaebb4-f8de-4d58-8d0c-4545582c526a","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:pure.ed.ac.uk:publications/1c86b93d-bdcc-42bc-96ba-5f2dea5d114a","is_oa":false,"landing_page_url":"http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1029837","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/1c86b93d-bdcc-42bc-96ba-5f2dea5d114a","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/1c86b93d-bdcc-42bc-96ba-5f2dea5d114a","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Simpson, A 2002, Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory. in Logic in Computer Science, 2002. Proceedings. 17th Annual IEEE Symposium on . Institute of Electrical and Electronics Engineers, pp. 287-298. https://doi.org/10.1109/LICS.2002.1029837","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[{"score":0.4099999964237213,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W16477519","https://openalex.org/W79336753","https://openalex.org/W89881250","https://openalex.org/W569543113","https://openalex.org/W997000086","https://openalex.org/W1498439614","https://openalex.org/W1511232673","https://openalex.org/W1514596527","https://openalex.org/W1520893111","https://openalex.org/W1532092775","https://openalex.org/W1534018603","https://openalex.org/W1538467230","https://openalex.org/W1553206107","https://openalex.org/W1565457335","https://openalex.org/W1566009901","https://openalex.org/W1589613545","https://openalex.org/W1605765292","https://openalex.org/W1679875858","https://openalex.org/W1989069191","https://openalex.org/W2000451268","https://openalex.org/W2007270285","https://openalex.org/W2017817571","https://openalex.org/W2024873396","https://openalex.org/W2049362364","https://openalex.org/W2060852846","https://openalex.org/W2065261632","https://openalex.org/W2079770504","https://openalex.org/W2102574008","https://openalex.org/W2107093915","https://openalex.org/W2117318327","https://openalex.org/W2121306658","https://openalex.org/W2123630974","https://openalex.org/W2142922307","https://openalex.org/W2146255646","https://openalex.org/W2150223832","https://openalex.org/W2170322156","https://openalex.org/W2291208220","https://openalex.org/W2337267853","https://openalex.org/W4211080362","https://openalex.org/W4214621180","https://openalex.org/W4243369031","https://openalex.org/W4243933121","https://openalex.org/W6600660742"],"related_works":["https://openalex.org/W2755363016","https://openalex.org/W1542328151","https://openalex.org/W3036972880","https://openalex.org/W2604377475","https://openalex.org/W2803229276","https://openalex.org/W2952451744","https://openalex.org/W4298869501","https://openalex.org/W2126542638","https://openalex.org/W1966054964","https://openalex.org/W1486532074"],"abstract_inverted_index":{"We":[0,53,113],"present":[1],"a":[2,10,42,128],"general":[3],"axiomatic":[4],"construction":[5,21],"of":[6,8,20,30,33,44,58,68,75,83,105,144],"models":[7,26,32,104],"FPC,":[9,119],"recursively":[11],"typed":[12],"lambda-calculus":[13],"with":[14],"call-by-value":[15],"operational":[16,140],"semantics.":[17],"Our":[18],"method":[19],"is":[22,87],"to":[23,40,60,91,97,117,133,146],"obtain":[24,41],"such":[25],"as":[27],"full":[28],"subcategories":[29],"categorical":[31],"intuitionistic":[34,106],"set":[35,77,81,108],"theory.":[36,78],"This":[37],"allows":[38],"us":[39],"notion":[43],"model":[45,129],"that":[46,55],"encompasses":[47],"both":[48],"domain-theoretic":[49],"and":[50,120,124,141],"realizability":[51],"models.":[52],"show":[54],"the":[56,66,73,76,131,139],"existence":[57],"solutions":[59,96],"recursive":[61,69,98],"domain":[62,99],"equations,":[63],"needed":[64],"for":[65,130,138],"interpretation":[67,132],"types,":[70],"depends":[71],"on":[72,127],"strength":[74],"The":[79],"internal":[80],"theory":[82,109],"an":[84],"elementary":[85],"topos":[86],"not":[88],"strong":[89],"enough":[90],"guarantee":[92],"their":[93],"existence.":[94],"However,":[95],"equations":[100],"do":[101],"exist":[102],"if":[103],"Zermelo-Fraenkel":[107],"are":[110],"used":[111],"instead":[112],"apply":[114],"this":[115],"result":[116],"interpret":[118],"we":[121],"provide":[122],"necessary":[123],"sufficient":[125],"conditions":[126],"be":[134],"computationally":[135],"adequate,":[136],"i.e.":[137],"denotational":[142],"notions":[143],"termination":[145],"agree.":[147]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}