{"id":"https://openalex.org/W1968608688","doi":"https://doi.org/10.2168/lmcs-8(1:18)2012","title":"A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions","display_name":"A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions","publication_year":2012,"publication_date":"2012-03-02","ids":{"openalex":"https://openalex.org/W1968608688","doi":"https://doi.org/10.2168/lmcs-8(1:18)2012","mag":"1968608688"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-8(1:18)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(1:18)2012","pdf_url":"https://lmcs.episciences.org/1044/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/1044/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032765727","display_name":"Andrea Asperti","orcid":"https://orcid.org/0000-0002-9677-6350"},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Andrea Asperti","raw_affiliation_strings":["University of Bologna"],"affiliations":[{"raw_affiliation_string":"University of Bologna","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068699841","display_name":"Wilmer Ricciotti","orcid":"https://orcid.org/0000-0002-2361-8538"},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Wilmer Ricciotti","raw_affiliation_strings":["University of Bologna"],"affiliations":[{"raw_affiliation_string":"University of Bologna","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081097346","display_name":"Claudio Sacerdoti Coen","orcid":"https://orcid.org/0000-0002-4360-6016"},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Claudio Sacerdoti Coen","raw_affiliation_strings":["University of Bologna"],"affiliations":[{"raw_affiliation_string":"University of Bologna","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086627291","display_name":"E. \u0303Tassi","orcid":"https://orcid.org/0000-0002-3335-6500"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Enrico Tassi","raw_affiliation_strings":["INRIA-Microsoft Research"],"affiliations":[{"raw_affiliation_string":"INRIA-Microsoft Research","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5032765727"],"corresponding_institution_ids":["https://openalex.org/I9360294"],"apc_list":null,"apc_paid":null,"fwci":6.6319,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.96474535,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"Volume 8, Issue 1","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.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/T11567","display_name":"semigroups and automata theory","score":0.9952999949455261,"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.9944000244140625,"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/unification","display_name":"Unification","score":0.7816039323806763},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7295272946357727},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.66917884349823},{"id":"https://openalex.org/keywords/syntax","display_name":"Syntax","score":0.6509279012680054},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6331143379211426},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.6171602606773376},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.5691741108894348},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.5370311737060547},{"id":"https://openalex.org/keywords/type-inference","display_name":"Type inference","score":0.5340240001678467},{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.5266447067260742},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4269794821739197},{"id":"https://openalex.org/keywords/rule-of-inference","display_name":"Rule of inference","score":0.4126115143299103},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.38505375385284424},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2051289975643158},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20404964685440063},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.13496625423431396}],"concepts":[{"id":"https://openalex.org/C96146094","wikidata":"https://www.wikidata.org/wiki/Q609057","display_name":"Unification","level":2,"score":0.7816039323806763},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7295272946357727},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.66917884349823},{"id":"https://openalex.org/C60048249","wikidata":"https://www.wikidata.org/wiki/Q37437","display_name":"Syntax","level":2,"score":0.6509279012680054},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6331143379211426},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.6171602606773376},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.5691741108894348},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.5370311737060547},{"id":"https://openalex.org/C198370458","wikidata":"https://www.wikidata.org/wiki/Q586459","display_name":"Type inference","level":3,"score":0.5340240001678467},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.5266447067260742},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4269794821739197},{"id":"https://openalex.org/C3746660","wikidata":"https://www.wikidata.org/wiki/Q1068763","display_name":"Rule of inference","level":2,"score":0.4126115143299103},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.38505375385284424},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2051289975643158},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20404964685440063},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.13496625423431396},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.2168/lmcs-8(1:18)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(1:18)2012","pdf_url":"https://lmcs.episciences.org/1044/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1202.4905","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1202.4905","pdf_url":"https://arxiv.org/pdf/1202.4905","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.229.646","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.229.646","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.msr-inria.inria.fr/%7Egares/lmcs_types_2010.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.232.1833","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.1833","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unibo.it/%7Easperti/PAPERS/lmcs_types_2010.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.752.351","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.752.351","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1202.4905.pdf","raw_type":"text"},{"id":"pmh:oai:cris.unibo.it:11585/121017","is_oa":false,"landing_page_url":"http://hdl.handle.net/11585/121017","pdf_url":null,"source":{"id":"https://openalex.org/S4306402579","display_name":"Archivio istituzionale della ricerca (Alma Mater Studiorum Universit\u00e0 di Bologna)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210117483","host_organization_name":"Istituto di Ematologia di Bologna","host_organization_lineage":["https://openalex.org/I4210117483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doaj.org/article:cf2883c3767644f9926f0bc5d3ac75aa","is_oa":true,"landing_page_url":"https://doaj.org/article/cf2883c3767644f9926f0bc5d3ac75aa","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 8, Issue 1 (2012)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-8(1:18)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(1:18)2012","pdf_url":"https://lmcs.episciences.org/1044/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.7900000214576721,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1968608688.pdf","grobid_xml":"https://content.openalex.org/works/W1968608688.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W155183251","https://openalex.org/W1486558830","https://openalex.org/W1496429054","https://openalex.org/W1533703835","https://openalex.org/W1558115254","https://openalex.org/W1558175043","https://openalex.org/W1575675278","https://openalex.org/W1587446521","https://openalex.org/W1692052839","https://openalex.org/W1982618236","https://openalex.org/W1986402635","https://openalex.org/W2002193175","https://openalex.org/W2031793325","https://openalex.org/W2034676877","https://openalex.org/W2036676170","https://openalex.org/W2038098277","https://openalex.org/W2044758536","https://openalex.org/W2053913724","https://openalex.org/W2056977394","https://openalex.org/W2092956565","https://openalex.org/W2102919742","https://openalex.org/W2106143913","https://openalex.org/W2122761321","https://openalex.org/W2136219937","https://openalex.org/W2144645833","https://openalex.org/W2155289292","https://openalex.org/W2296725671","https://openalex.org/W4243054153","https://openalex.org/W4388310127"],"related_works":["https://openalex.org/W4246350535","https://openalex.org/W4238632608","https://openalex.org/W3083050876","https://openalex.org/W1875958796","https://openalex.org/W1780472831","https://openalex.org/W1976200187","https://openalex.org/W1561644379","https://openalex.org/W2969536091","https://openalex.org/W783488073","https://openalex.org/W2971533183"],"abstract_inverted_index":{"The":[0,20,52,81,118],"paper":[1],"describes":[2],"the":[3,7,15,31,40,84,93,98,101,114,134,145,148,161,171,179,194,214,237,249,252,282],"refinement":[4,21],"algorithm":[5,22,111,120],"for":[6,133,187,217],"Calculus":[8],"of":[9,26,68,77,100,147,163,196,207,254,256,267,270,276,284],"(Co)Inductive":[10],"Constructions":[11],"(CIC)":[12],"implemented":[13],"in":[14,24,56,92,126,155,248],"interactive":[16],"theorem":[17],"prover":[18],"Matita.":[19],"is":[23,121,219],"charge":[25],"giving":[27],"a":[28,73,108,124,130,156,164,273],"meaning":[29],"to":[30,61,86,212,233,260],"terms,":[32],"types":[33],"and":[34,72,129,166,204,222,279,286],"proof":[35],"terms":[36,53,85,91],"directly":[37],"written":[38,55],"by":[39,44,97,159,174,236],"user":[41,63,78],"or":[42,49],"generated":[43],"using":[45],"tactics,":[46],"decision":[47],"procedures":[48],"general":[50],"automation.":[51],"are":[54,116,190,230],"an":[57,264],"\"external":[58],"syntax\"":[59],"meant":[60],"be":[62,234],"friendly":[64],"that":[65,189,229,258],"allows":[66],"omission":[67],"information,":[69],"untyped":[70],"binders":[71,115],"certain":[74],"liberal":[75],"use":[76],"defined":[79],"sub-typing.":[80],"refiner":[82],"modifies":[83],"obtain":[87],"related":[88],"well":[89],"typed":[90],"internal":[94],"syntax":[95,128,251],"understood":[96],"kernel":[99],"ITP.":[102],"In":[103],"particular,":[104],"it":[105,136,169],"acts":[106],"as":[107,138,142],"type":[109,131,162,172,223],"inference":[110,206,224],"when":[112],"all":[113],"untyped.":[117],"proposed":[119],"bi-directional:":[122],"given":[123],"term":[125],"external":[127,250],"expected":[132,173],"term,":[135],"propagates":[137],"much":[139],"typing":[140],"information":[141],"possible":[143],"towards":[144],"leaves":[146],"term.":[149],"Traditional":[150],"mono-directional":[151],"algorithms,":[152],"instead,":[153],"proceed":[154],"bottom-up":[157],"way":[158],"inferring":[160],"sub-term":[165],"comparing":[167],"(unifying)":[168],"with":[170],"its":[175],"context":[176],"only":[177],"at":[178,262],"end.":[180],"We":[181],"propose":[182],"some":[183],"novel":[184],"bi-directional":[185],"rules":[186],"CIC":[188],"particularly":[191],"effective.":[192],"Among":[193],"benefits":[195],"bi-directionality":[197],"we":[198,246],"have":[199],"better":[200,205],"error":[201],"message":[202],"reporting":[203],"dependent":[208],"types.":[209],"Moreover,":[210],"thanks":[211],"bi-directionality,":[213],"coercion":[215],"system":[216],"sub-typing":[218],"more":[220,231],"effective":[221],"generates":[225],"simpler":[226],"unification":[227,242],"problems":[228],"likely":[232],"solved":[235],"inherently":[238],"incomplete":[239],"higher":[240],"order":[241],"algorithms":[243],"implemented.":[244],"Finally":[245],"introduce":[247],"notion":[253],"vector":[255],"placeholders":[257,271],"enables":[259],"omit":[261],"once":[263],"arbitrary":[265],"number":[266],"arguments.":[268],"Vectors":[269],"allow":[272],"trivial":[274],"implementation":[275,283],"implicit":[277],"arguments":[278],"greatly":[280],"simplify":[281],"primitive":[285],"simple":[287],"tactics.":[288]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}