{"id":"https://openalex.org/W1982529770","doi":"https://doi.org/10.1145/1328438.1328457","title":"Lightweight semiformal time complexity analysis for purely functional data structures","display_name":"Lightweight semiformal time complexity analysis for purely functional data structures","publication_year":2008,"publication_date":"2008-01-07","ids":{"openalex":"https://openalex.org/W1982529770","doi":"https://doi.org/10.1145/1328438.1328457","mag":"1982529770"},"language":"en","primary_location":{"id":"doi:10.1145/1328438.1328457","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1328438.1328457","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","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/A5016464590","display_name":"Nils Anders Danielsson","orcid":null},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Nils Anders Danielsson","raw_affiliation_strings":["Chalmers University of Technology, G\u00f6teborg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chalmers University of Technology, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5016464590"],"corresponding_institution_ids":["https://openalex.org/I66862912"],"apc_list":null,"apc_paid":null,"fwci":3.5252,"has_fulltext":false,"cited_by_count":99,"citation_normalized_percentile":{"value":0.93717076,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"133","last_page":"144"},"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.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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","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/T11269","display_name":"Algorithms and Data Compression","score":0.9988999962806702,"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.9987000226974487,"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/computer-science","display_name":"Computer science","score":0.8262083530426025},{"id":"https://openalex.org/keywords/monad","display_name":"Monad (category theory)","score":0.7134637832641602},{"id":"https://openalex.org/keywords/laziness","display_name":"Laziness","score":0.6455516219139099},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5616341829299927},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5558814406394958},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5413153171539307},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.5239232182502747},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4590983986854553},{"id":"https://openalex.org/keywords/haskell","display_name":"Haskell","score":0.43263402581214905},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4146497845649719},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.41317906975746155},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3227214813232422},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1401500403881073},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1088220477104187}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8262083530426025},{"id":"https://openalex.org/C33959348","wikidata":"https://www.wikidata.org/wiki/Q1630568","display_name":"Monad (category theory)","level":3,"score":0.7134637832641602},{"id":"https://openalex.org/C2776447739","wikidata":"https://www.wikidata.org/wiki/Q484","display_name":"Laziness","level":2,"score":0.6455516219139099},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5616341829299927},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5558814406394958},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5413153171539307},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.5239232182502747},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4590983986854553},{"id":"https://openalex.org/C2780624054","wikidata":"https://www.wikidata.org/wiki/Q34010","display_name":"Haskell","level":3,"score":0.43263402581214905},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4146497845649719},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.41317906975746155},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3227214813232422},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1401500403881073},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1088220477104187},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C156772000","wikidata":"https://www.wikidata.org/wiki/Q864475","display_name":"Functor","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C118552586","wikidata":"https://www.wikidata.org/wiki/Q7867","display_name":"Psychiatry","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1328438.1328457","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1328438.1328457","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},{"id":"pmh:oai:publications.lib.chalmers.se:61165","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/61165-lightweight-semiformal-time-complexity-analysis-for-purely-functional-data-structures","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Article.Conference.PeerReviewed"},{"id":"pmh:oai:research.chalmers.se:61165","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/61165","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1522049235","https://openalex.org/W1526824128","https://openalex.org/W1544023751","https://openalex.org/W1556536463","https://openalex.org/W1560887622","https://openalex.org/W1575675278","https://openalex.org/W1977154819","https://openalex.org/W1986380853","https://openalex.org/W2004843654","https://openalex.org/W2035636826","https://openalex.org/W2046280690","https://openalex.org/W2052184002","https://openalex.org/W2066550846","https://openalex.org/W2086054252","https://openalex.org/W2098037505","https://openalex.org/W2105045857","https://openalex.org/W2128992690","https://openalex.org/W2135155734","https://openalex.org/W2145287505","https://openalex.org/W2170360634","https://openalex.org/W2171496589","https://openalex.org/W2802480725","https://openalex.org/W4213279211","https://openalex.org/W4301005547"],"related_works":["https://openalex.org/W4230063905","https://openalex.org/W1911419940","https://openalex.org/W2466718051","https://openalex.org/W2373472360","https://openalex.org/W2115866888","https://openalex.org/W2489038392","https://openalex.org/W2995031344","https://openalex.org/W2112632506","https://openalex.org/W154014553","https://openalex.org/W3206498514"],"abstract_inverted_index":{"Okasaki":[0],"and":[1,46,74,128],"others":[2],"have":[3],"demonstrated":[4],"how":[5],"purely":[6,70],"functional":[7,71],"data":[8,72,119],"structures":[9,73],"that":[10],"are":[11],"efficient":[12],"even":[13],"in":[14],"the":[15,64,85,93,123],"presence":[16],"of":[17,32,66,69,126],"persistence":[18],"can":[19,59],"be":[20,60],"constructed.":[21],"To":[22],"achieve":[23],"good":[24],"time":[25,94,107],"bounds":[26],"essential":[27],"use":[28,84],"is":[29,38,50,82,103],"often":[30],"made":[31],"laziness.":[33],"The":[34,79,110],"associated":[35],"complexity":[36,108],"analysis":[37,65],"frequently":[39],"subtle,":[40],"requiring":[41],"careful":[42],"attention":[43],"to":[44,62,83,88,96,105,115],"detail,":[45],"hence":[47],"formalising":[48],"it":[49],"valuable.":[51],"This":[52],"paper":[53],"describes":[54],"a":[55,67],"simple":[56],"library":[57,111],"which":[58],"used":[61,104,114],"make":[63],"class":[68],"algorithms":[75],"almost":[76],"fully":[77],"formal.":[78],"basic":[80],"idea":[81],"type":[86],"system":[87],"annotate":[89],"every":[90],"function":[91],"with":[92],"required":[95],"compute":[97],"its":[98],"result.":[99],"An":[100],"annotated":[101],"monad":[102],"combine":[106],"annotations.":[109],"has":[112],"been":[113],"analyse":[116],"some":[117],"existing":[118],"structures,":[120],"for":[121],"instance":[122],"deque":[124],"operations":[125],"Hinze":[127],"Paterson's":[129],"finger":[130],"trees.":[131]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":14},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}