{"id":"https://openalex.org/W2162329184","doi":"https://doi.org/10.1109/lics.2002.1029833","title":"Observational equivalence of 3rd-order Idealized Algol is decidable","display_name":"Observational equivalence of 3rd-order Idealized Algol is decidable","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2162329184","doi":"https://doi.org/10.1109/lics.2002.1029833","mag":"2162329184"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2002.1029833","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2002.1029833","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025152913","display_name":"C.-H. Luke Ong","orcid":"https://orcid.org/0000-0001-7509-680X"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"C.-H.L. Ong","raw_affiliation_strings":["Computing Laboratory, Oxford University, UK"],"affiliations":[{"raw_affiliation_string":"Computing Laboratory, Oxford University, UK","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5025152913"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":7.9554,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.97414032,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"245","last_page":"256"},"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.9994999766349792,"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.9994999766349792,"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.9973000288009644,"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/T11567","display_name":"semigroups and automata theory","score":0.9954000115394592,"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/finitary","display_name":"Finitary","score":0.9537994861602783},{"id":"https://openalex.org/keywords/observational-equivalence","display_name":"Observational equivalence","score":0.9165933132171631},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7718265056610107},{"id":"https://openalex.org/keywords/game-semantics","display_name":"Game semantics","score":0.5915064215660095},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.5574938058853149},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.5188202261924744},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5096468925476074},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4613047242164612},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.45391446352005005},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4433942437171936},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42988765239715576},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.4108749330043793},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35061201453208923},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3294903039932251},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.30258482694625854},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24437794089317322},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2429513931274414},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.24099135398864746},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.1724810004234314},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.16180753707885742},{"id":"https://openalex.org/keywords/denotational-semantics","display_name":"Denotational semantics","score":0.11087802052497864}],"concepts":[{"id":"https://openalex.org/C2778003309","wikidata":"https://www.wikidata.org/wiki/Q5450381","display_name":"Finitary","level":2,"score":0.9537994861602783},{"id":"https://openalex.org/C2777721189","wikidata":"https://www.wikidata.org/wiki/Q17121921","display_name":"Observational equivalence","level":2,"score":0.9165933132171631},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7718265056610107},{"id":"https://openalex.org/C9672783","wikidata":"https://www.wikidata.org/wiki/Q65122115","display_name":"Game semantics","level":5,"score":0.5915064215660095},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.5574938058853149},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.5188202261924744},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5096468925476074},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4613047242164612},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.45391446352005005},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4433942437171936},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42988765239715576},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.4108749330043793},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35061201453208923},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3294903039932251},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.30258482694625854},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24437794089317322},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2429513931274414},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.24099135398864746},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.1724810004234314},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.16180753707885742},{"id":"https://openalex.org/C207648694","wikidata":"https://www.wikidata.org/wiki/Q1189746","display_name":"Denotational semantics","level":4,"score":0.11087802052497864}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lics.2002.1029833","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2002.1029833","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.18.7057","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.7057","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.comlab.ox.ac.uk/pub/Documents/techpapers/Luke.Ong/lics02.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","score":0.6299999952316284,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W605212316","https://openalex.org/W1567525491","https://openalex.org/W1580140755","https://openalex.org/W1595465781","https://openalex.org/W1870018393","https://openalex.org/W1977216954","https://openalex.org/W1986683780","https://openalex.org/W1993997214","https://openalex.org/W2012140001","https://openalex.org/W2018379587","https://openalex.org/W2024189573","https://openalex.org/W2048387852","https://openalex.org/W2102161786","https://openalex.org/W2109548990","https://openalex.org/W2131390643","https://openalex.org/W2156992159","https://openalex.org/W4285719527","https://openalex.org/W6633904043","https://openalex.org/W6635513180","https://openalex.org/W6676239410"],"related_works":["https://openalex.org/W2039777175","https://openalex.org/W1511257926","https://openalex.org/W2522490152","https://openalex.org/W3196258201","https://openalex.org/W2049492436","https://openalex.org/W2113414099","https://openalex.org/W2053341755","https://openalex.org/W1602383402","https://openalex.org/W2135774937","https://openalex.org/W1981776739"],"abstract_inverted_index":{"We":[0],"prove":[1],"that":[2,25,73,153],"observational":[3,88,111,154],"equivalence":[4,112,155],"of":[5,28,32,35,78,82,113,120,134,137],"3rd-order":[6,114],"finitary":[7,115],"Idealized":[8],"Algol":[9],"(IA)":[10],"is":[11,43,51,92,124,159],"decidable":[12],"using":[13],"Game":[14],"Semantics.":[15],"By":[16],"modelling":[17],"state":[18],"explicitly":[19],"in":[20],"our":[21],"games,":[22],"we":[23,65,105,151],"show":[24,152],"the":[26,49,75,79,102],"denotation":[27,81],"a":[29,44,54,67,107,127,131],"term":[30],"M":[31],"this":[33,157],"fragment":[34,158],"IA":[36,138,148],"(built":[37],"up":[38],"from":[39],"finite":[40,55],"base":[41],"types)":[42],"compactly":[45],"innocent":[46],"strategy-with-state":[47],"i.e.":[48],"strategy":[50],"generated":[52],"by":[53],"view":[56],"function":[57],"f/sub":[58,63],"M/.":[59],"Given":[60],"any":[61,98],"such":[62,85],"M/,":[64],"construct":[66],"real-time":[68],"deterministic":[69],"pushdown":[70],"automata":[71],"(DPDA)":[72],"recognizes":[74],"complete":[76],"plays":[77,86],"knowing-strategy":[80],"M.":[83],"Since":[84],"characterize":[87],"equivalence,":[89],"and":[90,139],"there":[91],"an":[93],"algorithm":[94],"for":[95,109,129,156],"deciding":[96,110],"whether":[97],"two":[99],"DPDAs":[100],"recognize":[101],"same":[103],"language,":[104],"obtain":[106],"procedure":[108],"IA.":[116],"This":[117],"algorithmic":[118],"representation":[119],"program":[121],"meanings,":[122],"which":[123],"compositional,":[125],"provides":[126],"foundation":[128],"model-checking":[130],"wide":[132],"range":[133],"behavioural":[135],"properties":[136],"other":[140],"cognate":[141],"programming":[142],"languages.":[143],"Another":[144],"result":[145],"concerns":[146],"2nd-order":[147],"with":[149],"recursion:":[150],"undecidable.":[160]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}