{"id":"https://openalex.org/W2779768383","doi":"https://doi.org/10.1145/3162067","title":"Recursive programs in normal form (short paper)","display_name":"Recursive programs in normal form (short paper)","publication_year":2017,"publication_date":"2017-12-25","ids":{"openalex":"https://openalex.org/W2779768383","doi":"https://doi.org/10.1145/3162067","mag":"2779768383"},"language":"en","primary_location":{"id":"doi:10.1145/3162067","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3162067","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation","raw_type":"proceedings-article"},"type":"conference-paper","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/A5057699688","display_name":"Barry Jay","orcid":null},"institutions":[{"id":"https://openalex.org/I114017466","display_name":"University of Technology Sydney","ror":"https://ror.org/03f0f6041","country_code":"AU","type":"education","lineage":["https://openalex.org/I114017466"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Barry Jay","raw_affiliation_strings":["University of Technology Sydney, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Technology Sydney, Australia","institution_ids":["https://openalex.org/I114017466"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5057699688"],"corresponding_institution_ids":["https://openalex.org/I114017466"],"apc_list":null,"apc_paid":null,"fwci":0.2766,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.57895483,"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":"67","last_page":"73"},"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.9998999834060669,"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.9998999834060669,"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.9984999895095825,"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.9832000136375427,"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/rewriting","display_name":"Rewriting","score":0.8698643445968628},{"id":"https://openalex.org/keywords/primitive-recursive-function","display_name":"Primitive recursive function","score":0.6489157676696777},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.6414041519165039},{"id":"https://openalex.org/keywords/typed-lambda-calculus","display_name":"Typed lambda calculus","score":0.6310631036758423},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.62371826171875},{"id":"https://openalex.org/keywords/lambda-calculus","display_name":"Lambda calculus","score":0.5882205367088318},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.5244805216789246},{"id":"https://openalex.org/keywords/logic-program","display_name":"Logic program","score":0.5192254185676575},{"id":"https://openalex.org/keywords/confluence","display_name":"Confluence","score":0.47101888060569763},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4707176089286804},{"id":"https://openalex.org/keywords/program-transformation","display_name":"Program transformation","score":0.46329984068870544},{"id":"https://openalex.org/keywords/\u03bc-operator","display_name":"\u03bc operator","score":0.45341217517852783},{"id":"https://openalex.org/keywords/partial-function","display_name":"Partial function","score":0.44350603222846985},{"id":"https://openalex.org/keywords/simply-typed-lambda-calculus","display_name":"Simply typed lambda calculus","score":0.43966370820999146},{"id":"https://openalex.org/keywords/church-encoding","display_name":"Church encoding","score":0.41712841391563416},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.401147723197937},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3906572163105011},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37989160418510437},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35700997710227966},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3144465684890747},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.20143818855285645},{"id":"https://openalex.org/keywords/recursive-functions","display_name":"Recursive functions","score":0.16569751501083374},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1318768560886383}],"concepts":[{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.8698643445968628},{"id":"https://openalex.org/C9986523","wikidata":"https://www.wikidata.org/wiki/Q1570472","display_name":"Primitive recursive function","level":2,"score":0.6489157676696777},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.6414041519165039},{"id":"https://openalex.org/C142156749","wikidata":"https://www.wikidata.org/wiki/Q2607208","display_name":"Typed lambda calculus","level":3,"score":0.6310631036758423},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.62371826171875},{"id":"https://openalex.org/C135790938","wikidata":"https://www.wikidata.org/wiki/Q242028","display_name":"Lambda calculus","level":2,"score":0.5882205367088318},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.5244805216789246},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.5192254185676575},{"id":"https://openalex.org/C77906462","wikidata":"https://www.wikidata.org/wiki/Q1140902","display_name":"Confluence","level":2,"score":0.47101888060569763},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4707176089286804},{"id":"https://openalex.org/C2778361913","wikidata":"https://www.wikidata.org/wiki/Q7248437","display_name":"Program transformation","level":2,"score":0.46329984068870544},{"id":"https://openalex.org/C85955891","wikidata":"https://www.wikidata.org/wiki/Q307772","display_name":"\u03bc operator","level":3,"score":0.45341217517852783},{"id":"https://openalex.org/C182359184","wikidata":"https://www.wikidata.org/wiki/Q1756942","display_name":"Partial function","level":2,"score":0.44350603222846985},{"id":"https://openalex.org/C61237538","wikidata":"https://www.wikidata.org/wiki/Q855192","display_name":"Simply typed lambda calculus","level":4,"score":0.43966370820999146},{"id":"https://openalex.org/C77736955","wikidata":"https://www.wikidata.org/wiki/Q1089708","display_name":"Church encoding","level":5,"score":0.41712841391563416},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.401147723197937},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3906572163105011},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37989160418510437},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35700997710227966},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3144465684890747},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.20143818855285645},{"id":"https://openalex.org/C2982939207","wikidata":"https://www.wikidata.org/wiki/Q1175101","display_name":"Recursive functions","level":2,"score":0.16569751501083374},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1318768560886383},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3162067","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3162067","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation","raw_type":"proceedings-article"},{"id":"pmh:oai:opus.lib.uts.edu.au:10453/134194","is_oa":false,"landing_page_url":"http://hdl.handle.net/10453/134194","pdf_url":null,"source":{"id":"https://openalex.org/S4306401357","display_name":"UTS ePRESS (University of Technology Sydney)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114017466","host_organization_name":"University of Technology Sydney","host_organization_lineage":["https://openalex.org/I114017466"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Proceeding"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.6000000238418579}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W28925417","https://openalex.org/W1482545727","https://openalex.org/W1529760921","https://openalex.org/W1532096540","https://openalex.org/W1556604985","https://openalex.org/W1570229558","https://openalex.org/W1964062928","https://openalex.org/W2043416466","https://openalex.org/W2046825040","https://openalex.org/W2111863285","https://openalex.org/W2158778600","https://openalex.org/W2166643856","https://openalex.org/W2528339563","https://openalex.org/W2558783835","https://openalex.org/W2565297312","https://openalex.org/W2565660667","https://openalex.org/W2803077385"],"related_works":["https://openalex.org/W955824272","https://openalex.org/W2461298742","https://openalex.org/W2065676782","https://openalex.org/W3146919735","https://openalex.org/W4206699482","https://openalex.org/W2191957727","https://openalex.org/W4242488152","https://openalex.org/W2071312301","https://openalex.org/W2002433529","https://openalex.org/W2268847858"],"abstract_inverted_index":{"Recursive":[0],"programs":[1],"can":[2,51,81],"now":[3],"be":[4,82],"expressed":[5,76],"as":[6,49,77,84],"normal":[7,56],"forms":[8],"within":[9],"some":[10],"rewriting":[11,79],"systems,":[12],"including":[13],"traditional":[14],"combinatory":[15,29],"logic,":[16],"a":[17],"new":[18],"variant":[19],"of":[20,28,34,44,60,67],"lambda-calculus":[21],"called":[22],"closure":[23],"calculus,":[24,88],"and":[25],"recent":[26],"variants":[27],"logic":[30],"that":[31,74],"support":[32],"queries":[33,66],"internal":[35],"program":[36,68,72],"structure.":[37],"In":[38,62],"all":[39],"these":[40],"settings,":[41],"partial":[42],"evaluation":[43],"primitive":[45],"recursive":[46],"functions,":[47],"such":[48],"addition,":[50],"reduce":[52],"open":[53],"terms":[54],"to":[55],"form":[57],"without":[58,89],"fear":[59],"non-termination.":[61],"those":[63],"calculi":[64],"where":[65],"structure":[69],"are":[70,75],"supported,":[71],"optimisations":[73],"non-standard":[78],"rules":[80],"represented":[83],"functions":[85],"in":[86],"the":[87],"any":[90],"need":[91],"for":[92],"quotation":[93],"or":[94],"other":[95],"meta-theory.":[96]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}