{"id":"https://openalex.org/W2012615291","doi":"https://doi.org/10.1145/1599410.1599427","title":"Algorithmic specifications in linear logic with subexponentials","display_name":"Algorithmic specifications in linear logic with subexponentials","publication_year":2009,"publication_date":"2009-09-07","ids":{"openalex":"https://openalex.org/W2012615291","doi":"https://doi.org/10.1145/1599410.1599427","mag":"2012615291"},"language":"en","primary_location":{"id":"doi:10.1145/1599410.1599427","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1599410.1599427","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080152569","display_name":"Vivek Nigam","orcid":"https://orcid.org/0000-0003-4089-1218"},"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"]},{"id":"https://openalex.org/I142476485","display_name":"\u00c9cole Polytechnique","ror":"https://ror.org/05hy3tk52","country_code":"FR","type":"education","lineage":["https://openalex.org/I142476485","https://openalex.org/I4210145102"]},{"id":"https://openalex.org/I4210139461","display_name":"Laboratoire d'Informatique de l'\u00c9cole Polytechnique","ror":"https://ror.org/04afed728","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I142476485","https://openalex.org/I4210139461","https://openalex.org/I4210145102","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Vivek Nigam","raw_affiliation_strings":["INRIA Saclay - Ile-de France and LIX/Ecole Polytechnique, Palaiseau, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA Saclay - Ile-de France and LIX/Ecole Polytechnique, Palaiseau, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I142476485","https://openalex.org/I4210139461"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018394339","display_name":"Dale Miller","orcid":"https://orcid.org/0000-0003-0274-4954"},"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"]},{"id":"https://openalex.org/I142476485","display_name":"\u00c9cole Polytechnique","ror":"https://ror.org/05hy3tk52","country_code":"FR","type":"education","lineage":["https://openalex.org/I142476485","https://openalex.org/I4210145102"]},{"id":"https://openalex.org/I4210139461","display_name":"Laboratoire d'Informatique de l'\u00c9cole Polytechnique","ror":"https://ror.org/04afed728","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I142476485","https://openalex.org/I4210139461","https://openalex.org/I4210145102","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Dale Miller","raw_affiliation_strings":["INRIA Saclay - Ile-de France and LIX/Ecole Polytechnique, Palaiseau, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA Saclay - Ile-de France and LIX/Ecole Polytechnique, Palaiseau, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I142476485","https://openalex.org/I4210139461"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6894,"has_fulltext":false,"cited_by_count":63,"citation_normalized_percentile":{"value":0.90908448,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"129","last_page":"140"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":1.0,"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":1.0,"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.9994999766349792,"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.9994999766349792,"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/linear-temporal-logic","display_name":"Linear temporal logic","score":0.6276229619979858},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6260870695114136},{"id":"https://openalex.org/keywords/linear-logic","display_name":"Linear logic","score":0.5932742357254028},{"id":"https://openalex.org/keywords/substructural-logic","display_name":"Substructural logic","score":0.5136329531669617},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4782741963863373},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.4732542634010315},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4640480875968933},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4540291130542755},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.42806506156921387},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42544135451316833},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.3915422558784485},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.38478052616119385},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.38030484318733215},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.22805088758468628}],"concepts":[{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.6276229619979858},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6260870695114136},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.5932742357254028},{"id":"https://openalex.org/C144760519","wikidata":"https://www.wikidata.org/wiki/Q839490","display_name":"Substructural logic","level":4,"score":0.5136329531669617},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4782741963863373},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.4732542634010315},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4640480875968933},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4540291130542755},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.42806506156921387},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42544135451316833},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.3915422558784485},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.38478052616119385},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.38030484318733215},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.22805088758468628},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1599410.1599427","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1599410.1599427","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.160.6847","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.160.6847","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lix.polytechnique.fr/Labo/Dale.Miller/papers/ppdp09.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.421.6263","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.421.6263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lix.polytechnique.fr/~dale/papers/subexp-draft.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W10801908","https://openalex.org/W1495793844","https://openalex.org/W1502855507","https://openalex.org/W1533033982","https://openalex.org/W1567910832","https://openalex.org/W1585877836","https://openalex.org/W1592758934","https://openalex.org/W1643700551","https://openalex.org/W1852594029","https://openalex.org/W1889888010","https://openalex.org/W1963779317","https://openalex.org/W1969548989","https://openalex.org/W1988449272","https://openalex.org/W2040807747","https://openalex.org/W2070324762","https://openalex.org/W2103953153","https://openalex.org/W2161307885","https://openalex.org/W2164104198","https://openalex.org/W2798401172","https://openalex.org/W2913823028","https://openalex.org/W4235158909","https://openalex.org/W4285719527","https://openalex.org/W6600187837","https://openalex.org/W6631936855","https://openalex.org/W6636304400","https://openalex.org/W6636938275"],"related_works":["https://openalex.org/W2030878450","https://openalex.org/W1513400763","https://openalex.org/W2396926180","https://openalex.org/W3189772643","https://openalex.org/W1608477343","https://openalex.org/W1146816525","https://openalex.org/W1538155760","https://openalex.org/W2898966813","https://openalex.org/W2351986896","https://openalex.org/W2078730256"],"abstract_inverted_index":{"The":[0],"linear":[1,12,57],"logic":[2,13,58],"exponentials":[3],"!,?":[4],"are":[5],"not":[6,23],"canonical:":[7],"one":[8],"can":[9,83,116],"add":[10],"to":[11,48,51,87],"other":[14],"such":[15],"operators,":[16],"say":[17],"!l,?1,":[18],"which":[19],"may":[20,22],"or":[21],"allow":[24],"contraction":[25],"and":[26,28,45,97,100],"weakening,":[27],"where":[29],"l":[30],"is":[31],"from":[32,102],"some":[33,107],"pre-ordered":[34],"set":[35],"of":[36,53,70,135,144],"labels.":[37],"We":[38,104],"shall":[39],"call":[40],"these":[41],"additional":[42],"operators":[43],"subexponentials":[44,64],"use":[46],"them":[47],"assign":[49],"locations":[50,62],"multisets":[52],"formulas":[54],"within":[55],"a":[56,88,112,126],"programming":[59],"setting.":[60],"Treating":[61],"as":[63],"greatly":[65],"increases":[66],"the":[67,133,141],"algorithmic":[68,90,142],"expressiveness":[69,143],"logic.":[71,145],"To":[72],"illustrate":[73],"this":[74],"new":[75,127,136],"expressiveness,":[76],"we":[77,124],"show":[78],"that":[79,93,130],"focused":[80,113],"proof":[81,114],"search":[82],"be":[84,117],"precisely":[85],"linked":[86],"simple":[89],"specification":[91],"language":[92],"contains":[94],"while-loops,":[95],"conditionals,":[96],"insertion":[98],"into":[99],"deletion":[101],"multisets.":[103],"also":[105],"give":[106],"general":[108],"conditions":[109],"for":[110,132],"when":[111],"step":[115],"executed":[118],"in":[119],"constant":[120],"time.":[121],"In":[122],"addition,":[123],"propose":[125],"logical":[128],"connective":[129],"allows":[131],"creation":[134],"subexponentials,":[137],"thereby":[138],"further":[139],"augmenting":[140]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}