{"id":"https://openalex.org/W2599434363","doi":"https://doi.org/10.1017/s0960129518000427","title":"Implementing type theory in higher order constraint logic programming","display_name":"Implementing type theory in higher order constraint logic programming","publication_year":2019,"publication_date":"2019-03-01","ids":{"openalex":"https://openalex.org/W2599434363","doi":"https://doi.org/10.1017/s0960129518000427","mag":"2599434363"},"language":"en","primary_location":{"id":"doi:10.1017/s0960129518000427","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129518000427","pdf_url":null,"source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Structures in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.inria.fr/hal-01410567","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020479799","display_name":"Ferruccio Guidi","orcid":"https://orcid.org/0000-0003-3174-3248"},"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":"FERRUCCIO GUIDI","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Bologna, Italy Email:","DISI - Department of Computer Science and Engineering [Bologna] (Universit\u00e0 di Bologna Dipartimento di Informatica - Scienza e Ingegneria Mura Anteo Zamboni, 7 40126 Bologna Italiy - Italy)"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Bologna, Italy Email:","institution_ids":["https://openalex.org/I9360294"]},{"raw_affiliation_string":"DISI - Department of Computer Science and Engineering [Bologna] (Universit\u00e0 di Bologna Dipartimento di Informatica - Scienza e Ingegneria Mura Anteo Zamboni, 7 40126 Bologna Italiy - Italy)","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":["Department of Computer Science and Engineering, University of Bologna, Italy Email:","DISI - Department of Computer Science and Engineering [Bologna] (Universit\u00e0 di Bologna Dipartimento di Informatica - Scienza e Ingegneria Mura Anteo Zamboni, 7 40126 Bologna Italiy - Italy)"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Bologna, Italy Email:","institution_ids":["https://openalex.org/I9360294"]},{"raw_affiliation_string":"DISI - Department of Computer Science and Engineering [Bologna] (Universit\u00e0 di Bologna Dipartimento di Informatica - Scienza e Ingegneria Mura Anteo Zamboni, 7 40126 Bologna Italiy - Italy)","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 informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"ENRICO TASSI","raw_affiliation_strings":["Universit\u00e9 C\u00f4te d\u2019Azur, Inria Sophia-Antipolis, France Email:","STAMP - S\u00fbret\u00e9 du logiciel et Preuves Math\u00e9matiques Formalis\u00e9es (2004 route des Lucioles BP 93 06902 Sophia Antipolis - France)","MARELLE - Mathematical,  Reasoning and Software (France)"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 C\u00f4te d\u2019Azur, Inria Sophia-Antipolis, France Email:","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"STAMP - S\u00fbret\u00e9 du logiciel et Preuves Math\u00e9matiques Formalis\u00e9es (2004 route des Lucioles BP 93 06902 Sophia Antipolis - France)","institution_ids":[]},{"raw_affiliation_string":"MARELLE - Mathematical,  Reasoning and Software (France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5020479799"],"corresponding_institution_ids":["https://openalex.org/I9360294"],"apc_list":null,"apc_paid":null,"fwci":0.42,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.69096744,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"29","issue":"8","first_page":"1125","last_page":"1150"},"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.996399998664856,"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.9943000078201294,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.8199564218521118},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.7586520910263062},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7498983144760132},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.5217626690864563},{"id":"https://openalex.org/keywords/unification","display_name":"Unification","score":0.5106099247932434},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.4692908227443695},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.4517466723918915},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4373531639575958},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3855673670768738},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17879211902618408}],"concepts":[{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.8199564218521118},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.7586520910263062},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7498983144760132},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.5217626690864563},{"id":"https://openalex.org/C96146094","wikidata":"https://www.wikidata.org/wiki/Q609057","display_name":"Unification","level":2,"score":0.5106099247932434},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.4692908227443695},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.4517466723918915},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4373531639575958},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3855673670768738},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17879211902618408},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s0960129518000427","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129518000427","pdf_url":null,"source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Structures in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01410567v2","is_oa":true,"landing_page_url":"https://hal.inria.fr/hal-01410567","pdf_url":null,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://hal.inria.fr/hal-01410567","raw_type":"\\ninfo:eu-repo/semantics/preprint\\n"},{"id":"pmh:oai:cris.unibo.it:11585/698621","is_oa":false,"landing_page_url":"http://hdl.handle.net/11585/698621","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"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01410567v2","is_oa":true,"landing_page_url":"https://hal.inria.fr/hal-01410567","pdf_url":null,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://hal.inria.fr/hal-01410567","raw_type":"\\ninfo:eu-repo/semantics/preprint\\n"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.44999998807907104,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W10165608","https://openalex.org/W46734479","https://openalex.org/W1464569014","https://openalex.org/W1487940501","https://openalex.org/W1492803714","https://openalex.org/W1498867194","https://openalex.org/W1536765192","https://openalex.org/W1542112699","https://openalex.org/W1568176286","https://openalex.org/W1569206238","https://openalex.org/W1690636394","https://openalex.org/W1737956052","https://openalex.org/W1768814311","https://openalex.org/W1961757151","https://openalex.org/W1968608688","https://openalex.org/W1982209843","https://openalex.org/W2001537085","https://openalex.org/W2024902159","https://openalex.org/W2026542744","https://openalex.org/W2050702141","https://openalex.org/W2056977394","https://openalex.org/W2075352622","https://openalex.org/W2093111544","https://openalex.org/W2112308928","https://openalex.org/W2113936998","https://openalex.org/W2124729849","https://openalex.org/W2144645833","https://openalex.org/W2151581682","https://openalex.org/W2158657245","https://openalex.org/W2163602279","https://openalex.org/W2165434002","https://openalex.org/W2166662837","https://openalex.org/W2484664235","https://openalex.org/W2517066305","https://openalex.org/W2529084057","https://openalex.org/W2570710533","https://openalex.org/W2735044928","https://openalex.org/W2753707546","https://openalex.org/W2911601159","https://openalex.org/W2912466821","https://openalex.org/W3104854762","https://openalex.org/W4206717895","https://openalex.org/W4242767025","https://openalex.org/W6629542608","https://openalex.org/W6641301833","https://openalex.org/W6842324522","https://openalex.org/W6844436911"],"related_works":["https://openalex.org/W2392892093","https://openalex.org/W2173925774","https://openalex.org/W1999702466","https://openalex.org/W1516362967","https://openalex.org/W1596719193","https://openalex.org/W2365168741","https://openalex.org/W2525470665","https://openalex.org/W2510050445","https://openalex.org/W1591583250","https://openalex.org/W1591778271"],"abstract_inverted_index":{"In":[0,49,133,148],"this":[1,50,149,177],"paper,":[2,51],"we":[3,52,74,89,135,228],"are":[4,159],"interested":[5],"in":[6,92,220],"high-level":[7],"programming":[8,131,163],"languages":[9],"to":[10,105,114,120,126,137,142,183,187,235],"implement":[11,215],"the":[12,25,35,56,64,71,81,106,115,118,127,130,144,162,168,189,207,216,221,237],"core":[13],"components":[14],"of":[15,83,129,154],"an":[16,93,181,240],"interactive":[17],"theorem":[18],"prover":[19],"for":[20,29,69,80,100,242],"a":[21,77,98,101,122],"dependently":[22],"typed":[23],"language:":[24],"kernel":[26,238],"\u2013":[27,33,37],"responsible":[28],"type-checking":[30],"closed":[31],"terms":[32,44,196],"and":[34,61,156,201,227],"elaborator":[36,116,241],"that":[38,42,54,167,185],"manipulates":[39],"open":[40],"terms,":[41],"is":[43,66],"containing":[45],"unresolved":[46],"unification":[47,140],"variables.":[48],"confirm":[53],"\u03bbProlog,":[55],"language":[57,146,218],"developed":[58],"by":[59,96,161],"Miller":[60],"Nadathur":[62],"since":[63],"80s,":[65],"extremely":[67],"suitable":[68],"implementing":[70],"kernel.":[72],"Indeed,":[73],"easily":[75],"obtain":[76,121],"type":[78,103],"checker":[79,99],"Calculus":[82],"Inductive":[84],"Constructions":[85],"(CIC).":[86],"Even":[87],"more,":[88],"do":[90],"so":[91],"incremental":[94],"way":[95],"escalating":[97],"pure":[102],"system":[104,226],"full":[107],"CIC.":[108,243],"We":[109,165,179,214],"then":[110],"turn":[111],"our":[112],"attention":[113],"with":[117,176],"objective":[119],"simple":[123],"implementation":[124],"thanks":[125],"features":[128],"language.":[132,164],"particular,":[134],"want":[136],"use":[138],"\u03bbProlog\u2019s":[139],"variables":[141],"model":[143],"object":[145],"ones.":[147],"way,":[150],"scope":[151],"checking,":[152],"carrying":[153],"assignments":[155],"occur":[157],"checking":[158],"handled":[160],"observe":[166],"eager":[169],"generative":[170,190],"semantics":[171],"inherited":[172],"from":[173],"Prolog":[174,224],"clashes":[175],"plan.":[178],"propose":[180],"extension":[182,219],"\u03bbProlog":[184],"allows":[186],"control":[188],"semantics,":[191],"suspend":[192],"goals":[193],"over":[194],"flexible":[195],"turning":[197],"them":[198],"into":[199,239],"constraints,":[200],"finally":[202],"manipulate":[203],"these":[204],"constraints":[205],"at":[206],"meta-meta":[208],"level":[209],"via":[210],"constraint":[211],"handling":[212],"rules.":[213],"proposed":[217],"Embedded":[222],"Lambda":[223],"Interpreter":[225],"discuss":[229],"how":[230],"it":[231],"can":[232],"be":[233],"used":[234],"extend":[236]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}