{"id":"https://openalex.org/W2517066305","doi":"https://doi.org/10.1145/2966268.2966272","title":"Implementing HOL in an Higher Order Logic Programming Language","display_name":"Implementing HOL in an Higher Order Logic Programming Language","publication_year":2016,"publication_date":"2016-06-23","ids":{"openalex":"https://openalex.org/W2517066305","doi":"https://doi.org/10.1145/2966268.2966272","mag":"2517066305"},"language":"en","primary_location":{"id":"doi:10.1145/2966268.2966272","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2966268.2966272","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Eleventh Workshop on Logical Frameworks and Meta-Languages: Theory and Practice","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-01394686v1/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082704901","display_name":"Cvetan Dunchev","orcid":null},"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":"Cvetan Dunchev","raw_affiliation_strings":["University of Bologna"],"raw_orcid":null,"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"],"raw_orcid":null,"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/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Enrico Tassi","raw_affiliation_strings":["INRIA Sophia-Antipolis","MARELLE - Mathematical,  Reasoning and Software (France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA Sophia-Antipolis","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"MARELLE - Mathematical,  Reasoning and Software (France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7666,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.89448171,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"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.9998000264167786,"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.9998000264167786,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9997000098228455,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9952999949455261,"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/programming-language","display_name":"Programming language","score":0.8463263511657715},{"id":"https://openalex.org/keywords/hol","display_name":"HOL","score":0.8316644430160522},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.8070820569992065},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7523336410522461},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.6641760468482971},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.6595370769500732},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.5574227571487427},{"id":"https://openalex.org/keywords/horn-clause","display_name":"Horn clause","score":0.5086292028427124},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.49651390314102173},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.4822441041469574},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.448886513710022},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.42928919196128845},{"id":"https://openalex.org/keywords/functional-logic-programming","display_name":"Functional logic programming","score":0.42334023118019104},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4134269654750824},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38187646865844727},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.35602763295173645},{"id":"https://openalex.org/keywords/inductive-programming","display_name":"Inductive programming","score":0.2611202001571655},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12985482811927795},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.11706462502479553},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.08652716875076294}],"concepts":[{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.8463263511657715},{"id":"https://openalex.org/C17435882","wikidata":"https://www.wikidata.org/wiki/Q17030435","display_name":"HOL","level":2,"score":0.8316644430160522},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.8070820569992065},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7523336410522461},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.6641760468482971},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.6595370769500732},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5574227571487427},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.5086292028427124},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.49651390314102173},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4822441041469574},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.448886513710022},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.42928919196128845},{"id":"https://openalex.org/C96315309","wikidata":"https://www.wikidata.org/wiki/Q5508829","display_name":"Functional logic programming","level":4,"score":0.42334023118019104},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4134269654750824},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38187646865844727},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.35602763295173645},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.2611202001571655},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12985482811927795},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.11706462502479553},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.08652716875076294},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2966268.2966272","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2966268.2966272","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Eleventh Workshop on Logical Frameworks and Meta-Languages: Theory and Practice","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01394686v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01394686","pdf_url":"https://inria.hal.science/hal-01394686v1/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Frameworks and Meta Languages: Theory and Practice, Jun 2016, Porto, Portugal. pp.10, ⟨10.1145/2966268.2966272⟩","raw_type":"Conference papers"},{"id":"pmh:oai:cris.unibo.it:11585/585517","is_oa":false,"landing_page_url":"http://hdl.handle.net/11585/585517","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":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01394686v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01394686","pdf_url":"https://inria.hal.science/hal-01394686v1/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Frameworks and Meta Languages: Theory and Practice, Jun 2016, Porto, Portugal. pp.10, ⟨10.1145/2966268.2966272⟩","raw_type":"Conference papers"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2517066305.pdf","grobid_xml":"https://content.openalex.org/works/W2517066305.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W10165608","https://openalex.org/W107224311","https://openalex.org/W168000538","https://openalex.org/W206031030","https://openalex.org/W296180527","https://openalex.org/W1529227536","https://openalex.org/W1539505887","https://openalex.org/W1579694940","https://openalex.org/W1600435877","https://openalex.org/W1987927267","https://openalex.org/W2050702141","https://openalex.org/W2076819871","https://openalex.org/W2079333278","https://openalex.org/W2112308928","https://openalex.org/W2113936998","https://openalex.org/W2129442368","https://openalex.org/W2144645833","https://openalex.org/W2195779287","https://openalex.org/W2257203568","https://openalex.org/W2294656706","https://openalex.org/W2294931363","https://openalex.org/W2483710780","https://openalex.org/W2729688257","https://openalex.org/W2735044928","https://openalex.org/W3037353331","https://openalex.org/W4256124958","https://openalex.org/W6608512398","https://openalex.org/W6632177395","https://openalex.org/W6646354942","https://openalex.org/W6779506327"],"related_works":["https://openalex.org/W2490199991","https://openalex.org/W2161389420","https://openalex.org/W4386350920","https://openalex.org/W2523117645","https://openalex.org/W1909465604","https://openalex.org/W2787637024","https://openalex.org/W1799115352","https://openalex.org/W4367190606","https://openalex.org/W1679103348","https://openalex.org/W57122139"],"abstract_inverted_index":{"We":[0,63],"present":[1],"a":[2,6,17,68],"proof-of-concept":[3],"prototype":[4,30],"of":[5,9,27,45,60],"(constructive":[7],"variant":[8],"an)":[10],"HOL":[11],"interactive":[12],"theorem":[13,61],"prover":[14],"written":[15],"in":[16],"Higher":[18],"Order":[19],"Logic":[20],"Programming":[21],"(HOLP)":[22],"language,":[23],"namely":[24],"an":[25],"extension":[26],"\u03bbProlog.":[28],"The":[29],"is":[31,42,87],"meant":[32],"to":[33,56,90,97],"support":[34,91],"the":[35,43,49,78,82],"claim,":[36],"that":[37,40,47,71,92],"we":[38,72],"reinforce,":[39],"HOLP":[41],"class":[44],"languages":[46],"provides":[48],"right":[50],"abstraction":[51],"level":[52],"and":[53,65,94],"programming":[54,69],"primitives":[55],"obtain":[57],"concise":[58],"implementations":[59],"provers.":[62],"identify":[64],"advocate":[66],"for":[67],"technique,":[70,93],"call":[73],"semi-shallow":[74],"embedding,":[75],"while":[76],"at":[77],"same":[79],"time":[80],"identifying":[81],"reasons":[83],"why":[84],"pure":[85],"\u03bbProlog":[86],"not":[88],"sufficient":[89],"it":[95],"needs":[96],"be":[98],"extended.":[99]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}