Lightweight Semiformal Time Complexity Analysis for Purely Functional Data Structures
Paper i proceeding, 2008

Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds essential use is often made of laziness. The associated complexity analysis is frequently subtle, requiring careful attention to detail, and hence formalising it is valuable. This paper describes a simple library which can be used to make the analysis of a class of purely functional data structures and algorithms almost fully formal. The basic idea is to use the type system to annotate every function with the time required to compute its result. An annotated monad is used to combine time complexity annotations. The library has been used to analyse some existing data structures, for instance the deque operations of Hinze and Paterson's finger trees.

Författare

Nils Anders Danielsson

Chalmers, Data- och informationsteknik, Datavetenskap

35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL'08; San Francisco, CA; United States; 7 January 2008 through 12 January 2008

0730-8566 (ISSN)

133-144

Ämneskategorier

Datavetenskap (datalogi)

DOI

10.1145/1328438.1328457

ISBN

978-159593689-9

Mer information

Skapat

2017-10-06