{"id":"https://openalex.org/W2095381028","doi":"https://doi.org/10.1145/1088454.1088462","title":"Combining higher-order abstract syntax with first-order abstract syntax in ATS","display_name":"Combining higher-order abstract syntax with first-order abstract syntax in ATS","publication_year":2005,"publication_date":"2005-09-27","ids":{"openalex":"https://openalex.org/W2095381028","doi":"https://doi.org/10.1145/1088454.1088462","mag":"2095381028"},"language":"en","primary_location":{"id":"doi:10.1145/1088454.1088462","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1088454.1088462","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding","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/A5111560785","display_name":"K. Donnelly","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kevin Donnelly","raw_affiliation_strings":["Boston University"],"affiliations":[{"raw_affiliation_string":"Boston University","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101718310","display_name":"Hongwei Xi","orcid":"https://orcid.org/0000-0002-2885-8506"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hongwei Xi","raw_affiliation_strings":["Boston University"],"affiliations":[{"raw_affiliation_string":"Boston University","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111560785"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3701,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.85152795,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"9","issue":null,"first_page":"58","last_page":"63"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9835000038146973,"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.9763000011444092,"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/syntax","display_name":"Syntax","score":0.8896414041519165},{"id":"https://openalex.org/keywords/abstract-syntax","display_name":"Abstract syntax","score":0.7798382043838501},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7792885303497314},{"id":"https://openalex.org/keywords/abstract-syntax-tree","display_name":"Abstract syntax tree","score":0.6977145075798035},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6591549515724182},{"id":"https://openalex.org/keywords/syntax-error","display_name":"Syntax error","score":0.5952910780906677},{"id":"https://openalex.org/keywords/substitution","display_name":"Substitution (logic)","score":0.5599648356437683},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.5444870591163635},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.42386019229888916},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.3585379421710968}],"concepts":[{"id":"https://openalex.org/C60048249","wikidata":"https://www.wikidata.org/wiki/Q37437","display_name":"Syntax","level":2,"score":0.8896414041519165},{"id":"https://openalex.org/C114408938","wikidata":"https://www.wikidata.org/wiki/Q333373","display_name":"Abstract syntax","level":3,"score":0.7798382043838501},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7792885303497314},{"id":"https://openalex.org/C58646249","wikidata":"https://www.wikidata.org/wiki/Q127380","display_name":"Abstract syntax tree","level":3,"score":0.6977145075798035},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6591549515724182},{"id":"https://openalex.org/C11742125","wikidata":"https://www.wikidata.org/wiki/Q1195374","display_name":"Syntax error","level":4,"score":0.5952910780906677},{"id":"https://openalex.org/C2778220771","wikidata":"https://www.wikidata.org/wiki/Q1522579","display_name":"Substitution (logic)","level":2,"score":0.5599648356437683},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5444870591163635},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.42386019229888916},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.3585379421710968},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1088454.1088462","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1088454.1088462","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.126.2660","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.126.2660","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bu.edu/~hwxi/academic/papers/merlin05.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W119306600","https://openalex.org/W165446927","https://openalex.org/W1501212217","https://openalex.org/W1526298579","https://openalex.org/W1561822296","https://openalex.org/W1567853881","https://openalex.org/W1585676614","https://openalex.org/W1586302513","https://openalex.org/W1588934256","https://openalex.org/W1594912681","https://openalex.org/W1634581701","https://openalex.org/W1909842525","https://openalex.org/W1975082667","https://openalex.org/W1975957807","https://openalex.org/W1981858926","https://openalex.org/W2005192022","https://openalex.org/W2009464583","https://openalex.org/W2026928233","https://openalex.org/W2041562780","https://openalex.org/W2044758536","https://openalex.org/W2123360309","https://openalex.org/W2134801812","https://openalex.org/W2137850935","https://openalex.org/W2138164781","https://openalex.org/W2151038558","https://openalex.org/W2161555915","https://openalex.org/W2168162624","https://openalex.org/W2257565909","https://openalex.org/W4237428230","https://openalex.org/W4241226388","https://openalex.org/W4285719527","https://openalex.org/W4388299483","https://openalex.org/W4401149251","https://openalex.org/W6680258913"],"related_works":["https://openalex.org/W2613250302","https://openalex.org/W2077104824","https://openalex.org/W2005927140","https://openalex.org/W2390421503","https://openalex.org/W2387926336","https://openalex.org/W2536864162","https://openalex.org/W2143166528","https://openalex.org/W2051208666","https://openalex.org/W2073072874","https://openalex.org/W966509243"],"abstract_inverted_index":{"Abstract":[0],"Encodings":[1],"based":[2],"on":[3],"higher-order":[4,55,69,105],"abstract":[5,56,70,74,106],"syntax":[6,57,71,75,96],"represent":[7],"the":[8,14,23,33,99],"vari-ables":[9],"of":[10,16,25,78,82,101,112],"an":[11,110],"object-language":[12],"as":[13],"variables":[15],"a":[17,63,79,115],"meta-language.":[18],"Such":[19],"encodings":[20],"allow":[21],"for":[22,118],"reuse":[24],"ff-conversion,":[26],"substitutionand":[27],"hypothetical":[28],"judgments":[29],"already":[30],"defined":[31],"in":[32,58],"meta-language":[34],"and":[35,41,114,124],"thus":[36],"often":[37],"lead":[38],"to":[39,66],"simple":[40],"natural":[42],"formalization.":[43],"However,it":[44],"is":[45],"also":[46],"well-known":[47],"that":[48],"there":[49],"are":[50],"some":[51],"inherent":[52],"difficulties":[53],"with":[54,72],"supporting":[59],"recursive":[60,92],"definitions.We":[61],"demonstrate":[62],"novel":[64],"approach":[65],"explicitly":[67],"combining":[68],"first-order":[73],"thatmakes":[76],"use":[77],"(restricted)":[80],"form":[81],"dependent":[83],"types.":[84],"With":[85],"this":[86],"combination,":[87],"we":[88],"can":[89],"readily":[90],"define":[91],"functions":[93,103],"over":[94],"first-orderabstract":[95],"while":[97],"ensuring":[98],"correctness":[100],"these":[102],"through":[104],"syntax.":[107],"We":[108],"present":[109],"implemen-tation":[111],"substitution":[113],"verified":[116],"evaluator":[117],"pure":[119],"untyped":[120],"call-by-value":[121],"*-calculus.":[122],"Categories":[123],"Subject":[125],"Descriptors":[126],"D.3":[127],"[Software]:":[128],"Program-ming":[129],"Languages":[130]},"counts_by_year":[{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}