{"id":"https://openalex.org/W2158221842","doi":"https://doi.org/10.1007/3-540-45142-0_2","title":"Protocols between Programs and Proofs","display_name":"Protocols between Programs and Proofs","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2158221842","doi":"https://doi.org/10.1007/3-540-45142-0_2","mag":"2158221842"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45142-0_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45142-0_2","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/report/Protocols_between_programs_and_proofs/20707903","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, Clayton, Victoria, Australia, 3168"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Software Engineering, Monash University, Clayton, Victoria, Australia, 3168","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 N. Crossley","raw_affiliation_strings":["School of Computer Science and Software Engineering, Monash University, Clayton, Victoria, Australia, 3168"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Software Engineering, Monash University, Clayton, Victoria, Australia, 3168","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":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.2924,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.60755412,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"18","last_page":"37"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9959999918937683,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8581308126449585},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7817409038543701},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6956737041473389},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.6267544031143188},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.5717187523841858},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5677248239517212},{"id":"https://openalex.org/keywords/usable","display_name":"USable","score":0.5160181522369385},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4805231988430023},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.45367902517318726},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.33358800411224365},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1985051929950714},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1310039758682251},{"id":"https://openalex.org/keywords/world-wide-web","display_name":"World Wide Web","score":0.09456130862236023}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8581308126449585},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7817409038543701},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6956737041473389},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.6267544031143188},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.5717187523841858},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5677248239517212},{"id":"https://openalex.org/C2780615836","wikidata":"https://www.wikidata.org/wiki/Q2471869","display_name":"USable","level":2,"score":0.5160181522369385},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4805231988430023},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.45367902517318726},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.33358800411224365},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1985051929950714},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1310039758682251},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.09456130862236023},{"id":"https://openalex.org/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/3-540-45142-0_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45142-0_2","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:doi:10.26180/20707903","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Report"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.535.2595","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.535.2595","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://calcium.dcs.kcl.ac.uk/251/1/protocols-between-programs-and-proofs.pdf","raw_type":"text"},{"id":"pmh:oai:figshare.com:article/20707903","is_oa":true,"landing_page_url":"https://figshare.com/articles/report/Protocols_between_programs_and_proofs/20707903","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/d344cdf6-fa1a-49b3-b4d8-055a87062343","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/d344cdf6-fa1a-49b3-b4d8-055a87062343","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Poernomo , I & Crossley , J N 2001 , Protocols Between Programs and Proofs . in K-K Lau (ed.) , Logic Based Program Synthesis and Transformation : 10th International Workshop, LOPSTR 2000 London, UK, July 24\u201328, 2000 Selected Papers . Lecture Notes in Computer Science , vol. 2042 , pp. 18 - 37 , Logic Based Program Synthesis and Transformation, 15th International Workshop, LOPSTR 2000 , London , United Kingdom , 1/01/2001 . https://doi.org/10.1007/3-540-45142-0_2","raw_type":"contributionToPeriodical"},{"id":"doi:10.26180/20707903.v1","is_oa":true,"landing_page_url":"https://doi.org/10.26180/20707903.v1","pdf_url":null,"source":{"id":"https://openalex.org/S7407052105","display_name":"Monash University","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"report"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/20707903","is_oa":true,"landing_page_url":"https://figshare.com/articles/report/Protocols_between_programs_and_proofs/20707903","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W4861723","https://openalex.org/W55282291","https://openalex.org/W569543113","https://openalex.org/W1501212217","https://openalex.org/W1538467230","https://openalex.org/W1560253649","https://openalex.org/W1566752377","https://openalex.org/W1573627012","https://openalex.org/W1590828018","https://openalex.org/W2085170490","https://openalex.org/W2100376276","https://openalex.org/W2112448067","https://openalex.org/W2156049385","https://openalex.org/W2160331299","https://openalex.org/W2792841777","https://openalex.org/W4285719527","https://openalex.org/W6629753114"],"related_works":["https://openalex.org/W2982321410","https://openalex.org/W95465806","https://openalex.org/W2392004567","https://openalex.org/W2808944898","https://openalex.org/W2046296964","https://openalex.org/W2940029036","https://openalex.org/W2959217929","https://openalex.org/W4242866892","https://openalex.org/W84644661","https://openalex.org/W42551271"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,9,41,108],"describe":[4,109],"a":[5,15,51,80,86,110,127,134,142],"new":[6],"protocol":[7,13,24,107],"that":[8,117],"call":[10],"the":[11,18,27,30,33,54,99,114,138,145],"Curry-Howard":[12,56],"between":[14],"theory":[16,31],"and":[17,32,71,84],"programs":[19,47],"extracted":[20,139],"from":[21,48],"it.":[22],"This":[23],"leads":[25],"to":[26],"expansion":[28],"of":[29,35,53,88,95,105,113,120,129,144],"production":[34],"more":[36],"powerful":[37],"programs.":[38],"The":[39],"methodology":[40,97],"use":[42],"for":[43,67],"automatically":[44],"extracting":[45],"\u201ccorrect\u201d":[46],"proofs":[49],"is":[50,76,98],"development":[52],"well-known":[55,115],"process.":[57],"Program":[58],"extraction":[59],"has":[60,85],"been":[61],"developed":[62],"by":[63],"many":[64],"authors":[65],"(see,":[66],"example,":[68],"[9],":[69],"[5]":[70],"[12]),":[72],"but":[73],"our":[74,96,106],"presentation":[75],"ultimately":[77],"aimed":[78],"at":[79],"practical,":[81],"usable":[82],"system":[83],"number":[87],"novel":[89],"features.":[90],"These":[91],"include":[92],"An":[93],"implementation":[94],"Fred":[100],"system.1":[101],"As":[102],"an":[103],"example":[104],"constructive":[111],"proof":[112],"theorem":[116],"every":[118],"graph":[119,135],"even":[121],"parity":[122],"can":[123],"be":[124],"decomposed":[125],"into":[126],"list":[128,143],"disjoint":[130,147],"cycles.":[131],"Given":[132],"such":[133],"as":[136,149],"input,":[137],"program":[140],"produces":[141],"(non-trivial)":[146],"cycles":[148],"promised.":[150]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}