{"id":"https://openalex.org/W1966928697","doi":"https://doi.org/10.2168/lmcs-8(4:11)2012","title":"Linear Dependent Types and Relative Completeness","display_name":"Linear Dependent Types and Relative Completeness","publication_year":2012,"publication_date":"2012-10-23","ids":{"openalex":"https://openalex.org/W1966928697","doi":"https://doi.org/10.2168/lmcs-8(4:11)2012","mag":"1966928697"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-8(4:11)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(4:11)2012","pdf_url":"https://lmcs.episciences.org/974/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/974/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084450516","display_name":"Ugo Dal Lago","orcid":"https://orcid.org/0000-0001-9200-070X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ugo Dal Lago","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-9200-070X","affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Marco Gaboardi","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":"Marco Gaboardi","raw_affiliation_strings":["Dipartimento di Scienze dell'Informazione -Universit di Bologna, Computer and Information Science Department -University of Pennsylvania, EPI FOCUS -INRIA Sophia Antipolis"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Scienze dell'Informazione -Universit di Bologna, Computer and Information Science Department -University of Pennsylvania, EPI FOCUS -INRIA Sophia Antipolis","institution_ids":["https://openalex.org/I9360294"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5084450516"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.1904,"has_fulltext":true,"cited_by_count":32,"citation_normalized_percentile":{"value":0.96115073,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":"Volume 8, Issue 4","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.9833999872207642,"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.9833999872207642,"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.008700000122189522,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.0008999999845400453,"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/completeness","display_name":"Completeness (order theory)","score":0.8368356227874756},{"id":"https://openalex.org/keywords/linear-logic","display_name":"Linear logic","score":0.714722752571106},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.7089567184448242},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5240257382392883},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43712109327316284},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3829965591430664},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3147389888763428},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2983657717704773}],"concepts":[{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.8368356227874756},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.714722752571106},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7089567184448242},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5240257382392883},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43712109327316284},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3829965591430664},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3147389888763428},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2983657717704773},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.2168/lmcs-8(4:11)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(4:11)2012","pdf_url":"https://lmcs.episciences.org/974/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:1104.0193","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1104.0193","pdf_url":"https://arxiv.org/pdf/1104.0193","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:cris.unibo.it:11585/154276","is_oa":false,"landing_page_url":"http://hdl.handle.net/11585/154276","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:0cc60838507b48f8b14cac62546e8a1c","is_oa":true,"landing_page_url":"https://doaj.org/article/0cc60838507b48f8b14cac62546e8a1c","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 4 (2012)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-8(4:11)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(4:11)2012","pdf_url":"https://lmcs.episciences.org/974/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":[],"awards":[{"id":"https://openalex.org/G8449988547","display_name":null,"funder_award_id":"272487","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320313934","display_name":"Institut national de recherche en informatique et en automatique (INRIA)","ror":"https://ror.org/02kvxyf05"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1966928697.pdf","grobid_xml":"https://content.openalex.org/works/W1966928697.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W68428471","https://openalex.org/W191576729","https://openalex.org/W1488740219","https://openalex.org/W1496947201","https://openalex.org/W1545415328","https://openalex.org/W1583295953","https://openalex.org/W1602651206","https://openalex.org/W1980177715","https://openalex.org/W1989132974","https://openalex.org/W2005192022","https://openalex.org/W2040871029","https://openalex.org/W2066952252","https://openalex.org/W2075350371","https://openalex.org/W2081109124","https://openalex.org/W2112969535","https://openalex.org/W2115141955","https://openalex.org/W2130848143","https://openalex.org/W2134918221","https://openalex.org/W2137062096","https://openalex.org/W2138308600","https://openalex.org/W2165446401","https://openalex.org/W2169724594","https://openalex.org/W2170698790","https://openalex.org/W2296245053","https://openalex.org/W2911865844"],"related_works":["https://openalex.org/W1976679120","https://openalex.org/W2377519369","https://openalex.org/W4237277701","https://openalex.org/W3202311233","https://openalex.org/W4281614748","https://openalex.org/W32024214","https://openalex.org/W2765883196","https://openalex.org/W2034826746","https://openalex.org/W2396919090","https://openalex.org/W2395339009"],"abstract_inverted_index":{"A":[0],"system":[1],"of":[2,41,55,62,84],"linear":[3,75],"dependent":[4,72],"types":[5,73],"for":[6,96],"the":[7,38,46,50,60,81],"lambda":[8],"calculus":[9],"with":[10,65],"full":[11],"higher-order":[12],"recursion,":[13],"called":[14],"dlPCF,":[15],"is":[16,31,69,78],"introduced":[17],"and":[18,21,74,77],"proved":[19],"sound":[20],"relatively":[22],"complete.":[23],"Completeness":[24],"holds":[25],"in":[26],"a":[27],"strong":[28],"sense:":[29],"dlPCF":[30,68],"not":[32],"only":[33],"able":[34],"to":[35,49,93],"precisely":[36],"capture":[37],"functional":[39],"behaviour":[40],"PCF":[42],"programs":[43],"(i.e.":[44],"how":[45],"output":[47],"relates":[48],"input)":[51],"but":[52],"also":[53],"some":[54],"their":[56],"intensional":[57],"properties,":[58],"namely":[59],"complexity":[61],"evaluating":[63],"them":[64],"Krivine's":[66],"Machine.":[67],"designed":[70],"around":[71],"logic":[76],"parametrized":[79],"on":[80],"underlying":[82],"language":[83],"index":[85],"terms,":[86],"which":[87],"can":[88],"be":[89],"tuned":[90],"so":[91],"as":[92],"sacrifice":[94],"completeness":[95],"tractability.":[97]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}