{"id":"https://openalex.org/W1969518459","doi":"https://doi.org/10.1145/2631172.2631175","title":"A Framework for the Verified Transformation of Functional Programs","display_name":"A Framework for the Verified Transformation of Functional Programs","publication_year":2014,"publication_date":"2014-07-11","ids":{"openalex":"https://openalex.org/W1969518459","doi":"https://doi.org/10.1145/2631172.2631175","mag":"1969518459"},"language":"en","primary_location":{"id":"doi:10.1145/2631172.2631175","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2631172.2631175","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 International Workshop on Logical Frameworks and Meta-languages: Theory and Practice","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/A5080344559","display_name":"Gopalan Nadathur","orcid":"https://orcid.org/0000-0001-8456-3369"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Gopalan Nadathur","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Minnesota"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Minnesota","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5080344559"],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05278545,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"1"},"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.9991999864578247,"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.9991999864578247,"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.996399998664856,"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.9878000020980835,"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/computer-science","display_name":"Computer science","score":0.728020191192627},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7101302742958069},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.6108690500259399},{"id":"https://openalex.org/keywords/syntax","display_name":"Syntax","score":0.5823133587837219},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5454561710357666},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.545242190361023},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.4833890497684479},{"id":"https://openalex.org/keywords/abstract-syntax","display_name":"Abstract syntax","score":0.45030319690704346},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.4382185935974121},{"id":"https://openalex.org/keywords/argument","display_name":"Argument (complex analysis)","score":0.41557133197784424},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4122840166091919},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22080793976783752}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.728020191192627},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7101302742958069},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.6108690500259399},{"id":"https://openalex.org/C60048249","wikidata":"https://www.wikidata.org/wiki/Q37437","display_name":"Syntax","level":2,"score":0.5823133587837219},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5454561710357666},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.545242190361023},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.4833890497684479},{"id":"https://openalex.org/C114408938","wikidata":"https://www.wikidata.org/wiki/Q333373","display_name":"Abstract syntax","level":3,"score":0.45030319690704346},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.4382185935974121},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.41557133197784424},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4122840166091919},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22080793976783752},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2631172.2631175","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2631172.2631175","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 International Workshop on Logical Frameworks and Meta-languages: Theory and Practice","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1999702466","https://openalex.org/W1481700938","https://openalex.org/W2741053223","https://openalex.org/W1493824320","https://openalex.org/W592311106","https://openalex.org/W2972366161","https://openalex.org/W4319165641","https://openalex.org/W4380901377","https://openalex.org/W1977834309","https://openalex.org/W2003151706"],"abstract_inverted_index":{"The":[0,72,124],"compilation":[1],"of":[2,22,39,70,74,92,101,105,109,120,146,184,188],"functional":[3,160],"programs":[4],"relies":[5],"on":[6,180],"transformations":[7,50,162],"that":[8,19,48,59,126,212],"simplify":[9],"their":[10,15,173],"structure":[11,69],"while":[12],"ostensibly":[13],"preserving":[14],"meanings.":[16],"We":[17,195],"argue":[18],"the":[20,23,27,36,46,49,56,67,79,93,98,106,110,121,130,144,150,182,202],"combination":[21],"\u03bbProlog":[24],"language":[25],"and":[26,53,64,133,141,163,193],"Abella":[28,128,205],"interactive":[29],"theorem-prover":[30],"provide":[31],"a":[32,135,185,210],"natural":[33],"framework":[34],"for":[35,82,97,138,206],"verified":[37,174],"implementation":[38],"such":[40,88],"transformations.":[41,123],"Underlying":[42],"this":[43,154],"argument":[44],"is":[45,84,213],"fact":[47],"are":[51],"syntax-directed":[52],"rule-based,":[54],"with":[55],"important":[57],"proviso":[58],"they":[60],"pay":[61],"attention":[62],"to":[63,86,201],"also":[65,197],"modify":[66],"binding":[68],"programs.":[71],"logic":[73,81,112,125,132,203],"higher-order":[75,99,186],"hereditary":[76],"Harrop":[77],"formulas,":[78],"HoHH":[80,111,131,151],"short,":[83],"well-suited":[85],"formalizing":[87],"descriptions":[89],"especially":[90,178],"because":[91],"support":[94],"it":[95],"provides":[96,134],"representation":[100,187],"syntax.":[102],"By":[103],"virtue":[104],"computational":[107],"interpretation":[108],"embodied":[113],"in":[114,149,172,190,216],"\u03bbProlog,":[115],"these":[116,166],"formalizations":[117],"become":[118],"implementations":[119],"corresponding":[122],"underlies":[127],"embeds":[129],"complementary":[136],"capability":[137],"reasoning":[139],"flexibly":[140],"succinctly":[142],"about":[143],"properties":[145],"specifications":[147],"written":[148],"logic.":[152],"In":[153],"presentation,":[155],"we":[156,176],"will":[157,177,196],"consider":[158],"typical":[159],"program":[161],"show":[164],"how":[165],"twin":[167],"capabilities":[168],"can":[169],"be":[170],"exploited":[171],"implementation;":[175],"focus":[179],"demonstrating":[181],"benefits":[183],"syntax":[189],"both":[191],"specification":[192],"reasoning.":[194],"discuss":[198],"an":[199],"extension":[200],"underlying":[204],"treating":[207],"logical":[208],"relations,":[209],"notion":[211],"often":[214],"needed":[215],"semantics":[217],"preservation":[218],"arguments.":[219]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}