{"id":"https://openalex.org/W2064016983","doi":"https://doi.org/10.1145/2505879.2505899","title":"A logical correspondence between natural semantics and abstract machines","display_name":"A logical correspondence between natural semantics and abstract machines","publication_year":2013,"publication_date":"2013-09-16","ids":{"openalex":"https://openalex.org/W2064016983","doi":"https://doi.org/10.1145/2505879.2505899","mag":"2064016983"},"language":"en","primary_location":{"id":"doi:10.1145/2505879.2505899","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2505879.2505899","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming","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/A5046367864","display_name":"Robert J. Simmons","orcid":"https://orcid.org/0000-0003-2420-3067"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Robert J. Simmons","raw_affiliation_strings":["Carnegie Mellon University"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063302317","display_name":"Ian Zerny","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"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Ian Zerny","raw_affiliation_strings":["Aarhus University"],"affiliations":[{"raw_affiliation_string":"Aarhus University","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046367864"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.4942,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.7680289,"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":"109","last_page":"119"},"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.9962999820709229,"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.9958999752998352,"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/computer-science","display_name":"Computer science","score":0.7189067006111145},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.6466690301895142},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5232923626899719},{"id":"https://openalex.org/keywords/proof-theoretic-semantics","display_name":"Proof-theoretic semantics","score":0.518161416053772},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.5162477493286133},{"id":"https://openalex.org/keywords/abstract-machine","display_name":"Abstract machine","score":0.46721234917640686},{"id":"https://openalex.org/keywords/logical-conjunction","display_name":"Logical conjunction","score":0.4582388401031494},{"id":"https://openalex.org/keywords/truth-table","display_name":"Truth table","score":0.4426710903644562},{"id":"https://openalex.org/keywords/logical-consequence","display_name":"Logical consequence","score":0.4323657751083374},{"id":"https://openalex.org/keywords/logical-analysis","display_name":"Logical analysis","score":0.41774994134902954},{"id":"https://openalex.org/keywords/formal-semantics","display_name":"Formal semantics (linguistics)","score":0.41463011503219604},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3483240306377411},{"id":"https://openalex.org/keywords/denotational-semantics","display_name":"Denotational semantics","score":0.3477616310119629},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3440667390823364},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.241417795419693},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17164278030395508}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7189067006111145},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.6466690301895142},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5232923626899719},{"id":"https://openalex.org/C61151141","wikidata":"https://www.wikidata.org/wiki/Q7249983","display_name":"Proof-theoretic semantics","level":5,"score":0.518161416053772},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.5162477493286133},{"id":"https://openalex.org/C88977235","wikidata":"https://www.wikidata.org/wiki/Q787114","display_name":"Abstract machine","level":2,"score":0.46721234917640686},{"id":"https://openalex.org/C21847791","wikidata":"https://www.wikidata.org/wiki/Q191081","display_name":"Logical conjunction","level":2,"score":0.4582388401031494},{"id":"https://openalex.org/C56949724","wikidata":"https://www.wikidata.org/wiki/Q219079","display_name":"Truth table","level":2,"score":0.4426710903644562},{"id":"https://openalex.org/C134752490","wikidata":"https://www.wikidata.org/wiki/Q374182","display_name":"Logical consequence","level":2,"score":0.4323657751083374},{"id":"https://openalex.org/C2983390893","wikidata":"https://www.wikidata.org/wiki/Q1092582","display_name":"Logical analysis","level":3,"score":0.41774994134902954},{"id":"https://openalex.org/C146499914","wikidata":"https://www.wikidata.org/wiki/Q5469969","display_name":"Formal semantics (linguistics)","level":2,"score":0.41463011503219604},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3483240306377411},{"id":"https://openalex.org/C207648694","wikidata":"https://www.wikidata.org/wiki/Q1189746","display_name":"Denotational semantics","level":4,"score":0.3477616310119629},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3440667390823364},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.241417795419693},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17164278030395508},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C6260981","wikidata":"https://www.wikidata.org/wiki/Q745328","display_name":"Mathematical statistics","level":2,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/2505879.2505899","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2505879.2505899","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.cmu.edu:compsci-3791","is_oa":false,"landing_page_url":"http://repository.cmu.edu/cgi/viewcontent.cgi?article=3791&context=compsci","pdf_url":null,"source":{"id":"https://openalex.org/S4306400668","display_name":"Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Department","raw_type":"text"},{"id":"pmh:doi:10.1184/r1/6587567","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":null,"raw_type":"Journal contribution"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.353.5055","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.353.5055","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~rjsimmon/papers/lics13.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/c9349709-999c-4eb9-8648-88454d561cf0","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/c9349709-999c-4eb9-8648-88454d561cf0","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Simmons , R J & Zerny, I 2013, A logical correspondence between natural semantics and abstract machines. in R Pe\u00f1a & T Schrijvers (eds), Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming, PPDP '13 . Association for Computing Machinery, pp. 109-119 , Symposium on Principles and Practice of Declarative Programming, Madrid, Spain, 16/09/2013. https://doi.org/10.1145/2505879.2505899","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6568338423","display_name":null,"funder_award_id":"NGN-44","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"}],"funders":[{"id":"https://openalex.org/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"},{"id":"https://openalex.org/F4320334779","display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","ror":"https://ror.org/00snfqn58"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":58,"referenced_works":["https://openalex.org/W1863899","https://openalex.org/W77859606","https://openalex.org/W102259843","https://openalex.org/W103061485","https://openalex.org/W193007183","https://openalex.org/W203501420","https://openalex.org/W1488692405","https://openalex.org/W1498395593","https://openalex.org/W1516314631","https://openalex.org/W1518650316","https://openalex.org/W1523618566","https://openalex.org/W1553101649","https://openalex.org/W1562530348","https://openalex.org/W1563538580","https://openalex.org/W1572670118","https://openalex.org/W1585398629","https://openalex.org/W1727609483","https://openalex.org/W1760139041","https://openalex.org/W1966571454","https://openalex.org/W1966776129","https://openalex.org/W1974190112","https://openalex.org/W1981224255","https://openalex.org/W1982866418","https://openalex.org/W1988185893","https://openalex.org/W2013885073","https://openalex.org/W2016799432","https://openalex.org/W2020259928","https://openalex.org/W2023132547","https://openalex.org/W2025317149","https://openalex.org/W2032673545","https://openalex.org/W2043416466","https://openalex.org/W2048417351","https://openalex.org/W2049641148","https://openalex.org/W2052908260","https://openalex.org/W2056025285","https://openalex.org/W2061740608","https://openalex.org/W2086201554","https://openalex.org/W2102259218","https://openalex.org/W2102435409","https://openalex.org/W2107103878","https://openalex.org/W2113098044","https://openalex.org/W2117692498","https://openalex.org/W2134291411","https://openalex.org/W2149013004","https://openalex.org/W2151423950","https://openalex.org/W2159869514","https://openalex.org/W2328580899","https://openalex.org/W2490166346","https://openalex.org/W2911795893","https://openalex.org/W2914260883","https://openalex.org/W4210723206","https://openalex.org/W4231445347","https://openalex.org/W4250452878","https://openalex.org/W4285719527","https://openalex.org/W4412315250","https://openalex.org/W6605642342","https://openalex.org/W6631265401","https://openalex.org/W6637839698"],"related_works":["https://openalex.org/W2109790275","https://openalex.org/W3049678769","https://openalex.org/W4214732606","https://openalex.org/W4244520143","https://openalex.org/W30461449","https://openalex.org/W4230844979","https://openalex.org/W2254294467","https://openalex.org/W2048735591","https://openalex.org/W4299710766","https://openalex.org/W2505040841"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,24,42,62,65],"logical":[3,28,43,67,80],"correspondence":[4,12,29],"between":[5],"natural":[6,25],"semantics":[7,51],"and":[8,16,52,72],"abstract":[9,21,53],"machines.":[10],"This":[11],"enables":[13],"the":[14,31,76,79],"mechanical":[15],"fully-correct":[17],"construction":[18],"of":[19,46,57,78],"an":[20],"machine":[22],"from":[23],"semantics.":[26,60],"Our":[27],"mirrors":[30],"Reynolds":[32],"functional":[33,48],"correspondence,":[34],"but":[35],"we":[36,69],"manipulate":[37],"semantic":[38],"specifications":[39],"encoded":[40],"in":[41],"framework":[44],"instead":[45],"manipulating":[47],"programs.":[49],"Natural":[50],"machines":[54],"are":[55],"instances":[56],"substructural":[58,66],"operational":[59],"As":[61],"byproduct,":[63],"using":[64],"framework,":[68],"bring":[70],"concurrent":[71],"stateful":[73],"models":[74],"into":[75],"domain":[77],"correspondence.":[81]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}