{"id":"https://openalex.org/W2066221810","doi":"https://doi.org/10.1016/s1571-0661(04)00105-7","title":"Matching typed and untyped realizability","display_name":"Matching typed and untyped realizability","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2066221810","doi":"https://doi.org/10.1016/s1571-0661(04)00105-7","mag":"2066221810"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)00105-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)00105-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(04)00105-7","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073192680","display_name":"John Longley","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":"John Longley","raw_affiliation_strings":["Laboratory for the Foundations of Computer Science, University of Edinburgh, King's Buildings, Edinburgh EH9 3JZ, Scotland","Laboratory for the Foundations of Computer Science, University of Edinburgh, King's Buildings, Edinburgh EH9 3JZ, Scotland#TAB#"],"affiliations":[{"raw_affiliation_string":"Laboratory for the Foundations of Computer Science, University of Edinburgh, King's Buildings, Edinburgh EH9 3JZ, Scotland","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"Laboratory for the Foundations of Computer Science, University of Edinburgh, King's Buildings, Edinburgh EH9 3JZ, Scotland#TAB#","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5073192680"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":3.6362,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.93067566,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"23","issue":"1","first_page":"74","last_page":"100"},"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.9995999932289124,"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.9995999932289124,"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/T12002","display_name":"Computability, Logic, AI Algorithms","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"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9957000017166138,"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.9602053165435791},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5681642889976501},{"id":"https://openalex.org/keywords/computability","display_name":"Computability","score":0.5585724711418152},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5403454899787903},{"id":"https://openalex.org/keywords/system-f","display_name":"System F","score":0.4807412624359131},{"id":"https://openalex.org/keywords/interpretation","display_name":"Interpretation (philosophy)","score":0.4773975908756256},{"id":"https://openalex.org/keywords/typed-lambda-calculus","display_name":"Typed lambda calculus","score":0.472347617149353},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46683469414711},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.4615841507911682},{"id":"https://openalex.org/keywords/combinatory-logic","display_name":"Combinatory logic","score":0.45864254236221313},{"id":"https://openalex.org/keywords/topos-theory","display_name":"Topos theory","score":0.43639498949050903},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.42732763290405273},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.42399734258651733},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.4108031392097473},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3930712342262268},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35226815938949585},{"id":"https://openalex.org/keywords/lambda-calculus","display_name":"Lambda calculus","score":0.24349290132522583},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1604517102241516},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1549559235572815}],"concepts":[{"id":"https://openalex.org/C2776378722","wikidata":"https://www.wikidata.org/wiki/Q3454417","display_name":"Realizability","level":2,"score":0.9602053165435791},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5681642889976501},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.5585724711418152},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5403454899787903},{"id":"https://openalex.org/C55128367","wikidata":"https://www.wikidata.org/wiki/Q2552799","display_name":"System F","level":3,"score":0.4807412624359131},{"id":"https://openalex.org/C527412718","wikidata":"https://www.wikidata.org/wiki/Q855395","display_name":"Interpretation (philosophy)","level":2,"score":0.4773975908756256},{"id":"https://openalex.org/C142156749","wikidata":"https://www.wikidata.org/wiki/Q2607208","display_name":"Typed lambda calculus","level":3,"score":0.472347617149353},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46683469414711},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.4615841507911682},{"id":"https://openalex.org/C79678938","wikidata":"https://www.wikidata.org/wiki/Q1481571","display_name":"Combinatory logic","level":2,"score":0.45864254236221313},{"id":"https://openalex.org/C182141236","wikidata":"https://www.wikidata.org/wiki/Q2143621","display_name":"Topos theory","level":2,"score":0.43639498949050903},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.42732763290405273},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.42399734258651733},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.4108031392097473},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3930712342262268},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35226815938949585},{"id":"https://openalex.org/C135790938","wikidata":"https://www.wikidata.org/wiki/Q242028","display_name":"Lambda calculus","level":2,"score":0.24349290132522583},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1604517102241516},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1549559235572815},{"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},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1016/s1571-0661(04)00105-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)00105-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.883.4853","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.883.4853","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"http://www.research.ed.ac.uk/portal/files/17651294/1_s2.0_S1571066104001057_main.pdf","raw_type":"text"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/fc35f3e8-7c99-4991-9c36-c84925e1b027","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/fc35f3e8-7c99-4991-9c36-c84925e1b027","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Longley, J 1999, 'Matching typed and untyped realizability', Electronic Notes in Theoretical Computer Science, vol. 23, no. 1, pp. 74-100. https://doi.org/10.1016/S1571-0661(04)00105-7","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.ed.ac.uk:publications/fc35f3e8-7c99-4991-9c36-c84925e1b027","is_oa":true,"landing_page_url":"http://linkinghub.elsevier.com/retrieve/pii/S1571066104001057","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":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)00105-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)00105-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.4000000059604645,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W126568045","https://openalex.org/W1512478964","https://openalex.org/W1517661647","https://openalex.org/W1565620163","https://openalex.org/W1587118842","https://openalex.org/W1605765292","https://openalex.org/W1847465957","https://openalex.org/W1985955425","https://openalex.org/W1988097129","https://openalex.org/W1989069191","https://openalex.org/W1993746530","https://openalex.org/W1996516260","https://openalex.org/W2005968294","https://openalex.org/W2007270285","https://openalex.org/W2010959827","https://openalex.org/W2012319728","https://openalex.org/W2024189573","https://openalex.org/W2042945291","https://openalex.org/W2043566933","https://openalex.org/W2066221810","https://openalex.org/W2072497723","https://openalex.org/W2093541252","https://openalex.org/W2113885619","https://openalex.org/W2115726813","https://openalex.org/W2119310054","https://openalex.org/W2165446401","https://openalex.org/W2271497292","https://openalex.org/W2291208220","https://openalex.org/W2530006810","https://openalex.org/W2905135108","https://openalex.org/W4211265583","https://openalex.org/W4243731873","https://openalex.org/W6651239619","https://openalex.org/W6656426685"],"related_works":["https://openalex.org/W2027907817","https://openalex.org/W1983399101","https://openalex.org/W4388555446","https://openalex.org/W2561189364","https://openalex.org/W2803077385","https://openalex.org/W1762811400","https://openalex.org/W3105392254","https://openalex.org/W1592479913","https://openalex.org/W2036107204","https://openalex.org/W2612830858"],"abstract_inverted_index":{"Realizability":[0],"interpretations":[1],"of":[2,14,33,50,81,118,124,126,169],"logics":[3],"are":[4,131,135],"given":[5],"by":[6],"saying":[7],"what":[8,150,158],"it":[9],"means":[10],"for":[11,121,139],"computational":[12,22],"objects":[13,23,46],"some":[15,56,116,132,167],"kind":[16],"to":[17,106,172,180],"realize":[18],"logical":[19,111,170],"formulae.":[20,83],"The":[21],"in":[24,72,153,176],"question":[25],"might":[26,43],"be":[27,44],"drawn":[28],"from":[29],"an":[30],"untyped":[31,64,100],"universe":[32],"computation,":[34],"such":[35,47],"as":[36,48,109],"a":[37,51,62,68,89,122],"partial":[38],"combinatory":[39],"algebra,":[40],"or":[41],"they":[42,76],"typed":[45,70,96,140],"terms":[49],"PCF-style":[52],"programming":[53,155],"language.":[54],"In":[55,84],"instances,":[57],"one":[58],"can":[59],"show":[60],"that":[61,75,134],"particular":[63,69,129,177],"realizability":[65,101,163],"interpretation":[66],"matches":[67],"one,":[71],"the":[73,78,95,99],"sense":[74],"give":[77,115],"same":[79],"set":[80],"realizable":[82],"this":[85,107,119],"case,":[86],"we":[87,104],"have":[88],"very":[90],"good":[91],"fit":[92],"indeed":[93],"between":[94,149],"language":[97],"and":[98,157],"model":[102],"\u2014":[103],"refer":[105],"condition":[108],"(constructive)":[110],"full":[112],"abstraction.":[113],"We":[114,165],"examples":[117,168],"situation":[120],"variety":[123],"extensions":[125],"PCF.":[127],"Of":[128],"interest":[130],"models":[133],"logically":[136],"fully":[137],"abstract":[138],"languages":[141,156],"including":[142],"non-functional":[143],"features.":[144],"Our":[145],"results":[146],"establish":[147],"connections":[148],"is":[151,159],"computable":[152],"various":[154,162],"true":[160],"inside":[161],"toposes.":[164],"consider":[166],"formulae":[171],"illustrate":[173],"these":[174],"ideas,":[175],"their":[178],"application":[179],"exact":[181],"real-number":[182],"computability.":[183]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}