{"id":"https://openalex.org/W3181860444","doi":"https://doi.org/10.1109/lics52264.2021.9470567","title":"A Compositional Cost Model for the \u03bb-calculus","display_name":"A Compositional Cost Model for the \u03bb-calculus","publication_year":2021,"publication_date":"2021-06-29","ids":{"openalex":"https://openalex.org/W3181860444","doi":"https://doi.org/10.1109/lics52264.2021.9470567","mag":"3181860444"},"language":"en","primary_location":{"id":"doi:10.1109/lics52264.2021.9470567","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics52264.2021.9470567","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://purehost.bath.ac.uk/ws/files/220303346/152.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051457838","display_name":"James D. Laird","orcid":"https://orcid.org/0000-0002-3636-8937"},"institutions":[{"id":"https://openalex.org/I51601045","display_name":"University of Bath","ror":"https://ror.org/002h8g185","country_code":"GB","type":"education","lineage":["https://openalex.org/I51601045"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"James Laird","raw_affiliation_strings":["University of Bath,Department of Computer Science","Department of Computer Science, University of Bath"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bath,Department of Computer Science","institution_ids":["https://openalex.org/I51601045"]},{"raw_affiliation_string":"Department of Computer Science, University of Bath","institution_ids":["https://openalex.org/I51601045"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5051457838"],"corresponding_institution_ids":["https://openalex.org/I51601045"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09246322,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":null,"first_page":"1","last_page":"13"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9980000257492065,"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.9976000189781189,"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/principle-of-compositionality","display_name":"Principle of compositionality","score":0.6307719945907593},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6233757138252258},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.5258377194404602},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5243083238601685},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5004253387451172},{"id":"https://openalex.org/keywords/linear-logic","display_name":"Linear logic","score":0.43897542357444763},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43342119455337524},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41600289940834045},{"id":"https://openalex.org/keywords/lambda-calculus","display_name":"Lambda calculus","score":0.41195109486579895},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3626742362976074},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.3330700695514679},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33145737648010254},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32120564579963684},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.27814632654190063}],"concepts":[{"id":"https://openalex.org/C121375916","wikidata":"https://www.wikidata.org/wiki/Q936559","display_name":"Principle of compositionality","level":2,"score":0.6307719945907593},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6233757138252258},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.5258377194404602},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5243083238601685},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5004253387451172},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.43897542357444763},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43342119455337524},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41600289940834045},{"id":"https://openalex.org/C135790938","wikidata":"https://www.wikidata.org/wiki/Q242028","display_name":"Lambda calculus","level":2,"score":0.41195109486579895},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3626742362976074},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.3330700695514679},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33145737648010254},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32120564579963684},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27814632654190063},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/lics52264.2021.9470567","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics52264.2021.9470567","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},{"id":"pmh:oai:purehost.bath.ac.uk:openaire/3742c8e0-96d7-4e5f-85dd-c07fe7ca3fe6","is_oa":true,"landing_page_url":"https://researchportal.bath.ac.uk/en/publications/3742c8e0-96d7-4e5f-85dd-c07fe7ca3fe6","pdf_url":"https://purehost.bath.ac.uk/ws/files/220303346/152.pdf","source":{"id":"https://openalex.org/S4377196294","display_name":"Pure (University of Bath)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I51601045","host_organization_name":"University of Bath","host_organization_lineage":["https://openalex.org/I51601045"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Laird, J 2021, A Compositional Cost Model for the \u03bb-calculus. in 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021. vol. 2021-June, 9470567, Proceedings - Symposium on Logic in Computer Science, vol. 2021-June, IEEE, pp. 1-13, 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, 29/06/21. https://doi.org/10.1109/LICS52264.2021.9470567","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:purehost.bath.ac.uk:publications/3742c8e0-96d7-4e5f-85dd-c07fe7ca3fe6","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85113898140&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4377196294","display_name":"Pure (University of Bath)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I51601045","host_organization_name":"University of Bath","host_organization_lineage":["https://openalex.org/I51601045"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:purehost.bath.ac.uk:openaire/3742c8e0-96d7-4e5f-85dd-c07fe7ca3fe6","is_oa":true,"landing_page_url":"https://researchportal.bath.ac.uk/en/publications/3742c8e0-96d7-4e5f-85dd-c07fe7ca3fe6","pdf_url":"https://purehost.bath.ac.uk/ws/files/220303346/152.pdf","source":{"id":"https://openalex.org/S4377196294","display_name":"Pure (University of Bath)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I51601045","host_organization_name":"University of Bath","host_organization_lineage":["https://openalex.org/I51601045"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Laird, J 2021, A Compositional Cost Model for the \u03bb-calculus. in 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021. vol. 2021-June, 9470567, Proceedings - Symposium on Logic in Computer Science, vol. 2021-June, IEEE, pp. 1-13, 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, 29/06/21. https://doi.org/10.1109/LICS52264.2021.9470567","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3181860444.pdf","grobid_xml":"https://content.openalex.org/works/W3181860444.grobid-xml"},"referenced_works_count":50,"referenced_works":["https://openalex.org/W134510267","https://openalex.org/W427601738","https://openalex.org/W754892430","https://openalex.org/W1530749014","https://openalex.org/W1547926009","https://openalex.org/W1553206107","https://openalex.org/W1557619244","https://openalex.org/W1771631851","https://openalex.org/W1964861775","https://openalex.org/W1969682671","https://openalex.org/W1980647766","https://openalex.org/W2007147248","https://openalex.org/W2010239186","https://openalex.org/W2011565534","https://openalex.org/W2012072162","https://openalex.org/W2015890451","https://openalex.org/W2016326594","https://openalex.org/W2024189573","https://openalex.org/W2027027952","https://openalex.org/W2054684736","https://openalex.org/W2063068243","https://openalex.org/W2073904768","https://openalex.org/W2079873887","https://openalex.org/W2083060740","https://openalex.org/W2088735483","https://openalex.org/W2089241138","https://openalex.org/W2129164069","https://openalex.org/W2132265554","https://openalex.org/W2141636159","https://openalex.org/W2149531431","https://openalex.org/W2154273644","https://openalex.org/W2155200218","https://openalex.org/W2159526276","https://openalex.org/W2184268586","https://openalex.org/W2276552877","https://openalex.org/W2294824106","https://openalex.org/W2295866357","https://openalex.org/W2568721247","https://openalex.org/W2966669184","https://openalex.org/W3005247259","https://openalex.org/W3082766016","https://openalex.org/W3098034088","https://openalex.org/W3114253521","https://openalex.org/W4245071229","https://openalex.org/W4252567017","https://openalex.org/W6633053525","https://openalex.org/W6694868967","https://openalex.org/W6696890820","https://openalex.org/W6784964801","https://openalex.org/W7001892900"],"related_works":["https://openalex.org/W1598337380","https://openalex.org/W1952931766","https://openalex.org/W2093561140","https://openalex.org/W2949680097","https://openalex.org/W2114078774","https://openalex.org/W1479772898","https://openalex.org/W4297812127","https://openalex.org/W2291724690","https://openalex.org/W4225776353","https://openalex.org/W3151484654"],"abstract_inverted_index":{"We":[0],"describe":[1,113],"a":[2,12,23,30,65,90,114,127,132,166,175,196],"(time)":[3],"cost":[4,20,55,76,87,108,200],"model":[5,109],"for":[6,57,117,181],"the":[7,19,27,36,43,69,75,86,97,141,148,189],"(call-by-value)":[8],"\u03bb-calculus":[9],"based":[10,104],"on":[11,100,131,147],"natural":[13,98],"presentation":[14],"of":[15,21,29,38,71,77,88,140,155,165,178,198],"its":[16,39],"game":[17],"semantics:":[18],"computing":[22,78,89],"finite":[24],"approximant":[25],"to":[26,68,126,161,185],"denotation":[28],"term":[31,59,167],"(its":[32],"evaluation":[33,119],"tree)":[34],"is":[35,82,103,105,110,151,172],"size":[37],"smallest":[40],"derivation":[41],"in":[42],"semantics.":[44],"This":[45,136,171],"measure":[46],"has":[47],"an":[48,138],"optimality":[49],"property":[50],"enabling":[51],"compositional":[52],"reasoning":[53],"about":[54],"bounds:":[56],"any":[58,163],"A,":[60],"context":[61],"C[_]":[62],"and":[63,66,73,93],"approximants":[64,121],"c":[67,79,94],"trees":[70],"A":[72,92],"C[A],":[74],"from":[80,91,95],"C[A]":[81],"no":[83],"more":[84],"than":[85],"C[a].Although":[96],"semantics":[99],"which":[101,122,150,186],"it":[102,124],"nondeterministic,":[106],"our":[107],"reasonable:":[111],"we":[112,187],"deterministic":[115],"algorithm":[116],"recognizing":[118],"tree":[120],"satisfies":[123],"(up":[125],"constant":[128],"factor":[129],"overhead)":[130],"Random":[133],"Access":[134],"Machine.":[135],"requires":[137],"implementation":[139,177],"\u03bb":[142,190],"<inf":[143,191],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[144,192],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">v</inf>":[145,193],"-calculus":[146,194],"RAM":[149],"completely":[152],"lazy:":[153],"compositionality":[154],"costs":[156],"entails":[157],"that":[158],"work":[159],"done":[160],"evaluate":[162],"part":[164],"cannot":[168],"be":[169],"duplicated.":[170],"achieved":[173],"by":[174],"novel":[176],"graph":[179],"reduction":[180],"nameless":[182],"explicit":[183],"substitutions,":[184],"compile":[188],"via":[195],"series":[197],"linear":[199],"reductions.":[201]},"counts_by_year":[],"updated_date":"2026-06-09T15:46:55.921056","created_date":"2025-10-10T00:00:00"}