{"id":"https://openalex.org/W2099851490","doi":"https://doi.org/10.1016/s1571-0661(05)01135-7","title":"Writing Constructive Proofs Yielding Efficient Extracted Programs","display_name":"Writing Constructive Proofs Yielding Efficient Extracted Programs","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2099851490","doi":"https://doi.org/10.1016/s1571-0661(05)01135-7","mag":"2099851490"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(05)01135-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)01135-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(05)01135-7","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076721288","display_name":"Aleksey Nogin","orcid":"https://orcid.org/0000-0002-0795-3694"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Aleksey Nogin","raw_affiliation_strings":["Computer Science Department, Cornell University Ithaca, NY 14853, USA","Computer Science Department, Cornell University, Ithaca, NY 14853, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Cornell University Ithaca, NY 14853, USA","institution_ids":["https://openalex.org/I205783295"]},{"raw_affiliation_string":"Computer Science Department, Cornell University, Ithaca, NY 14853, USA#TAB#","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5076721288"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":1.0613,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.83616351,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"37","issue":null,"first_page":"1","last_page":"17"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9991999864578247,"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.9829999804496765,"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/mathematical-proof","display_name":"Mathematical proof","score":0.8855951428413391},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7198933362960815},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.7163999676704407},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.484809547662735},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4601588249206543},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3792663514614105},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.349232941865921},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3047149181365967}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.8855951428413391},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7198933362960815},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.7163999676704407},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.484809547662735},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4601588249206543},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3792663514614105},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.349232941865921},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3047149181365967},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s1571-0661(05)01135-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)01135-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.16.4803","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.4803","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://nogin.org/papers/effproof.ps","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(05)01135-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)01135-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.5899999737739563}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1511133369","https://openalex.org/W1598988887","https://openalex.org/W1817451992","https://openalex.org/W2019651724","https://openalex.org/W2021790140","https://openalex.org/W2105346957","https://openalex.org/W2135625856","https://openalex.org/W2592184324","https://openalex.org/W6655525663"],"related_works":["https://openalex.org/W2808944898","https://openalex.org/W3196207352","https://openalex.org/W2951724202","https://openalex.org/W3084261076","https://openalex.org/W1996614773","https://openalex.org/W4387820098","https://openalex.org/W2959217929","https://openalex.org/W4242866892","https://openalex.org/W84644661","https://openalex.org/W42551271"],"abstract_inverted_index":{"The":[0,20],"NuPRL":[1,34,116,152],"system":[2],"[3]":[3],"was":[4],"designed":[5],"for":[6,14,64],"interactive":[7],"writing":[8],"of":[9,81,108,131,174],"machine\u2013checked":[10],"constructive":[11,85],"proofs":[12,47],"and":[13,61],"extracting":[15],"algorithms":[16,22,58],"from":[17,114],"the":[18,106,109,115,132,150,157],"proofs.":[19],"extracted":[21,127,148],"are":[23],"guaranteed":[24],"to":[25,32,101,122,137,145,170],"be":[26,68],"correct1":[27],"which":[28,120],"makes":[29],"it":[30,43],"possible":[31],"use":[33,130],"as":[35,88,90],"a":[36,92,123,139],"programming":[37,83],"language":[38],"with":[39,165],"built-in":[40],"verification[1,5,7,8,9,10].":[41],"However":[42],"turned":[44],"out":[45],"that":[46,66,95,156],"written":[48],"without":[49],"algorithmic":[50],"efficiency":[51],"in":[52,70,84,160,163],"mind":[53],"often":[54],"produce":[55],"very":[56],"inefficient":[57],"\u2014":[59],"exponential":[60],"double-exponential":[62],"ones":[63],"problems":[65],"can":[67],"solved":[69],"polynomial":[71],"time.":[72],"In":[73],"this":[74,161],"paper":[75,162],"we":[76],"present":[77],"some":[78],"general":[79],"principles":[80,99,134,158],"efficient":[82,172],"type":[86],"theory":[87],"well":[89],"describe":[91],"case":[93],"study":[94],"shows":[96],"how":[97],"these":[98],"apply":[100],"particular":[102],"problems.":[103],"We":[104,154],"consider":[105],"proof":[107,143],"Myhill\u2013Nerode":[110],"automata":[111,117],"minimization":[112],"theorem":[113],"library":[118],"[4]":[119],"leaded":[121],"double\u2013exponential":[124],"(in":[125],"time)":[126],"program.":[128],"Systematic":[129],"presented":[133,159],"allowed":[135],"us":[136],"build":[138],"new":[140],"complexity":[141],"cautious":[142],"leading":[144],"polynomial-time":[146],"algorithm":[147],"by":[149],"same":[151],"extractor.":[153],"believe":[155],"combination":[164],"other":[166],"methods":[167],"may":[168],"lead":[169],"an":[171],"technique":[173],"programming-by-proofs.":[175]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2016,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}