{"id":"https://openalex.org/W164496440","doi":"https://doi.org/10.3217/jucs-007-01-0071","title":"Fred: An Approach to Generating Real, Correct, Reusable Programs from Proofs","display_name":"Fred: An Approach to Generating Real, Correct, Reusable Programs from Proofs","publication_year":2020,"publication_date":"2020-04-07","ids":{"openalex":"https://openalex.org/W164496440","doi":"https://doi.org/10.3217/jucs-007-01-0071","mag":"164496440"},"language":"en","primary_location":{"id":"pmh:oai:kclpure.kcl.ac.uk:openaire/36bfc908-10e8-4ff4-8ce4-3fd5fd5bf6fa","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/36bfc908-10e8-4ff4-8ce4-3fd5fd5bf6fa","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Crossley, J N & Poernomo, I 2001, 'Fred : An Approach to Generating Real, Correct, Reusable Programs from Proofs', Journal of Universal Computer Science, vol. 7, no. 1, pp. 71 - 88. https://doi.org/10.3217/jucs-007-01-0071","raw_type":"info:eu-repo/semantics/publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://kclpure.kcl.ac.uk/portal/en/publications/36bfc908-10e8-4ff4-8ce4-3fd5fd5bf6fa","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5105839462","display_name":"Iman Poernomo","orcid":null},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Iman Poernomo","raw_affiliation_strings":["School of Computer Science and Software Engineering, Monash University, Australia"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Software Engineering, Monash University, Australia","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029223204","display_name":"John N. Crossley","orcid":"https://orcid.org/0000-0002-2185-0835"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"John Crossley","raw_affiliation_strings":["School of Computer Science and Software Engineering, Monash University, Australia"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Software Engineering, Monash University, Australia","institution_ids":["https://openalex.org/I56590836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5105839462"],"corresponding_institution_ids":["https://openalex.org/I56590836"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00043765,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9904000163078308,"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.9904000163078308,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.979200005531311,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10260","display_name":"Software Engineering Research","score":0.9782000184059143,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/mathematical-proof","display_name":"Mathematical proof","score":0.8305906057357788},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5706124305725098},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5589091777801514},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.399834543466568},{"id":"https://openalex.org/keywords/software-engineering","display_name":"Software engineering","score":0.39230433106422424},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20951277017593384},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07252585887908936},{"id":"https://openalex.org/keywords/medicine","display_name":"Medicine","score":0.0692160427570343}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.8305906057357788},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5706124305725098},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5589091777801514},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.399834543466568},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.39230433106422424},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20951277017593384},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07252585887908936},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0692160427570343},{"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":"pmh:oai:kclpure.kcl.ac.uk:openaire/36bfc908-10e8-4ff4-8ce4-3fd5fd5bf6fa","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/36bfc908-10e8-4ff4-8ce4-3fd5fd5bf6fa","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Crossley, J N & Poernomo, I 2001, 'Fred : An Approach to Generating Real, Correct, Reusable Programs from Proofs', Journal of Universal Computer Science, vol. 7, no. 1, pp. 71 - 88. https://doi.org/10.3217/jucs-007-01-0071","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.3217/jucs-007-01-0071","is_oa":true,"landing_page_url":"https://doi.org/10.3217/jucs-007-01-0071","pdf_url":null,"source":{"id":"https://openalex.org/S4306400660","display_name":"TUGraz OPEN Library (Graz University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4092182","host_organization_name":"Graz University of Technology","host_organization_lineage":["https://openalex.org/I4092182"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:kclpure.kcl.ac.uk:openaire/36bfc908-10e8-4ff4-8ce4-3fd5fd5bf6fa","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/36bfc908-10e8-4ff4-8ce4-3fd5fd5bf6fa","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Crossley, J N & Poernomo, I 2001, 'Fred : An Approach to Generating Real, Correct, Reusable Programs from Proofs', Journal of Universal Computer Science, vol. 7, no. 1, pp. 71 - 88. https://doi.org/10.3217/jucs-007-01-0071","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2166247150","https://openalex.org/W4243252198","https://openalex.org/W2118300983","https://openalex.org/W2112962394","https://openalex.org/W3137189469","https://openalex.org/W4235530921","https://openalex.org/W2382501300","https://openalex.org/W3162240892","https://openalex.org/W4245713008","https://openalex.org/W2013111119"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,146],"describe":[4],"our":[5,36,144],"system":[6,37,145],"for":[7,30,88],"automatically":[8],"extracting":[9],"\"correct\"":[10],"programs":[11],"from":[12],"proofs":[13,118],"using":[14],"a":[15,39,121,148,177,181,189],"development":[16],"of":[17,41,69,85,98,107,143,151,159,173],"the":[18,67,82,95,105,111,125,133,152,166,185],"Curry-Howard":[19],"process.<br/><br/>Although":[20],"program":[21,187],"extraction":[22],"has":[23,38,176],"been":[24],"developed":[25],"by":[26],"many":[27],"authors":[28],"(see,":[29],"example,":[31],"[HN88],":[32],"[Con97]":[33],"and":[34,52,61,119,132],"[HKPM97]),":[35],"number":[40],"novel":[42],"features":[43,64],"designed":[44],"to":[45,50,57,73,77,91,109,115],"make":[46,110],"it":[47,169],"very":[48],"easy":[49],"use":[51,68,84,97,106],"as":[53,55,183,191],"close":[54],"possible":[56],"ordinary":[58],"mathematical":[59,117],"terminology":[60],"practice.":[62],"These":[63],"include":[65],"1.":[66],"Henkin's":[70],"technique":[71],"[Hen50]":[72],"reduce":[74],"higher-order":[75],"logic":[76],"many-sorted":[78],"(first-order)":[79],"logic;":[80],"2.":[81],"free":[83],"new":[86],"rules":[87],"induction":[89],"subject":[90],"certain":[92],"conditions;":[93],"3.":[94],"extensive":[96],"previously":[99],"programmed":[100],"(total,":[101],"recursive)":[102],"functions;":[103],"4.":[104],"templates":[108],"reasoning":[112,138],"much":[113],"closer":[114],"normal":[116],"5.":[120],"conceptual":[122],"distinction":[123],"between":[124],"computational":[126],"type":[127,135],"theory":[128,136],"(for":[129,137],"representing":[130],"programs)":[131],"logical":[134],"about":[139],"programs).<br/><br/>As":[140],"an":[141],"example":[142],"give":[147],"constructive":[149],"proof":[150],"well":[153],"known":[154],"theorem":[155],"that":[156,168],"every":[157],"graph":[158,182],"even":[160],"parity,":[161],"which":[162],"is":[163],"non-trivial":[164],"in":[165],"sense":[167],"does":[170],"not":[171],"consist":[172],"isolated":[174],"vertices,":[175],"cycle.":[178],"Given":[179],"such":[180],"input,":[184],"extracted":[186],"produces":[188],"cycle":[190],"promised.":[192]},"counts_by_year":[],"updated_date":"2026-03-25T23:56:10.502304","created_date":"2025-10-10T00:00:00"}