{"id":"https://openalex.org/W1989945455","doi":"https://doi.org/10.1145/800168.811550","title":"Primitive recursive program transformation","display_name":"Primitive recursive program transformation","publication_year":1976,"publication_date":"1976-01-01","ids":{"openalex":"https://openalex.org/W1989945455","doi":"https://doi.org/10.1145/800168.811550","mag":"1989945455"},"language":"en","primary_location":{"id":"doi:10.1145/800168.811550","doi":"https://doi.org/10.1145/800168.811550","is_oa":true,"landing_page_url":"https://doi.org/10.1145/800168.811550","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800168.811550","source":{"id":"https://openalex.org/S7407088133","display_name":"ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages - POPL '76","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/800168.811550","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111090061","display_name":"R. S. Boyer","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. S. Boyer","raw_affiliation_strings":[""],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082152322","display_name":"J. S. Moore","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. S. Moore","raw_affiliation_strings":[""],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081664009","display_name":"Robert E. Shostak","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. E. Shostak","raw_affiliation_strings":[""],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"171","last_page":"174"},"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/1712","display_name":"Software"},"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/1712","display_name":"Software"},"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":9.999999747378752e-05,"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":9.999999747378752e-05,"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/primitive-recursion","display_name":"primitive recursion","score":0.8740000128746033},{"id":"https://openalex.org/keywords/program-transformation","display_name":"program transformation","score":0.9819999933242798},{"id":"https://openalex.org/keywords/program-correctness","display_name":"program correctness","score":0.6050000190734863},{"id":"https://openalex.org/keywords/verification-conditions","display_name":"verification conditions","score":0.6050000190734863},{"id":"https://openalex.org/keywords/theorem-proving","display_name":"theorem proving","score":0.7409999966621399},{"id":"https://openalex.org/keywords/boyer-moore-theorem-prover","display_name":"Boyer-Moore theorem prover","score":0.9010000228881836},{"id":"https://openalex.org/keywords/program-equivalence","display_name":"program equivalence","score":0.43299999833106995}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.88972008228302},{"id":"https://openalex.org/C72041958","wikidata":"https://www.wikidata.org/wiki/Q185092","display_name":"Flowchart","level":2,"score":0.8369069695472717},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7173987030982971},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.6423512101173401},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6179805994033813},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.515105664730072},{"id":"https://openalex.org/C2778361913","wikidata":"https://www.wikidata.org/wiki/Q7248437","display_name":"Program transformation","level":2,"score":0.4885457456111908},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.45966705679893494},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41484469175338745},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3653804063796997},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/800168.811550","doi":"https://doi.org/10.1145/800168.811550","is_oa":true,"landing_page_url":"https://doi.org/10.1145/800168.811550","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800168.811550","source":{"id":"https://openalex.org/S7407088133","display_name":"ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages - POPL '76","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/800168.811550","doi":"https://doi.org/10.1145/800168.811550","is_oa":true,"landing_page_url":"https://doi.org/10.1145/800168.811550","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800168.811550","source":{"id":"https://openalex.org/S7407088133","display_name":"ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages - POPL '76","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1989945455.pdf","grobid_xml":"https://content.openalex.org/works/W1989945455.grobid-xml"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W147299627","https://openalex.org/W1528467909","https://openalex.org/W2045255985","https://openalex.org/W2164173700"],"related_works":["https://openalex.org/W90456874","https://openalex.org/W2523718035","https://openalex.org/W2043932961","https://openalex.org/W7099343036","https://openalex.org/W1498482969","https://openalex.org/W2610642933","https://openalex.org/W111882356","https://openalex.org/W7098205903","https://openalex.org/W2060717017","https://openalex.org/W7099056181"],"abstract_inverted_index":{"We":[0],"describe":[1],"how":[2],"to":[3,25],"transform":[4],"certain":[5],"flowchart":[6,34],"programs":[7,21],"into":[8],"equivalent":[9],"explicit":[10],"primitive":[11],"recursive":[12],"programs.":[13,35],"The":[14],"input/output":[15],"correctness":[16,40],"conditions":[17,30,41],"for":[18,31],"the":[19,28,32,38,48],"transformed":[20,39],"are":[22],"more":[23],"amenable":[24],"proof":[26],"than":[27],"verification":[29],"corresponding":[33],"In":[36],"particular,":[37],"can":[42],"often":[43],"be":[44],"verified":[45],"automatically":[46],"by":[47,52],"theorem":[49],"prover":[50],"developed":[51],"Boyer":[53],"and":[54],"Moore":[55],"[1].":[56]},"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-28T10:33:24.094632","created_date":"2016-06-24T00:00:00"}