Purely Functional Data Structures
From MaRDI portal
Publication:4702190
DOI10.1017/CBO9780511530104zbMath0941.68032OpenAlexW2105045857MaRDI QIDQ4702190
Publication date: 24 November 1999
Full work available at URL: https://doi.org/10.1017/cbo9780511530104
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Data structures (68P05)
Related Items
Loopless Gray code enumeration and the Tower of Bucharest ⋮ ATLAS: automated amortised complexity analysis of self-adjusting data structures ⋮ Regular numeral systems for data structures ⋮ Verified Root-Balanced Trees ⋮ A principled approach to programming with nested types in Haskell ⋮ Linear, bounded, functional pretty-printing ⋮ Super-naturals ⋮ Of Concurrent Data Structures and Iterations ⋮ Type-based cost analysis for lazy functional languages ⋮ Amortized Complexity Verified ⋮ Pattern Matches in HOL: ⋮ Denotational semantics as a foundation for cost recurrence extraction for functional languages ⋮ Calculating datastructures ⋮ Space-efficient functional offline-partially-persistent trees with applications to planar point location ⋮ Heterogeneous binary random-access lists ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Confluently Persistent Tries for Efficient Version Control ⋮ Modules in Robinson Spaces ⋮ Deep induction: induction rules for (truly) nested types ⋮ On Polymorphic Recursion, Type Systems, and Abstract Interpretation ⋮ Calculating a linear-time solution to the densest-segment problem ⋮ Programming with ornaments ⋮ The essence of ornaments ⋮ Unnamed Item ⋮ A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams ⋮ The saga of minimum spanning trees ⋮ On constructing 2-3 trees ⋮ APLicative Programming with Naperian Functors ⋮ Two-tier relaxed heaps ⋮ Nested session types ⋮ Bipartite binomial heaps ⋮ Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits ⋮ Amortized complexity verified ⋮ Balancing weight-balanced trees ⋮ Two skew-binary numeral systems and one application ⋮ Derivable Type Classes ⋮ An Overview of Edison ⋮ Confluently persistent tries for efficient version control ⋮ Fast computations on ordered nominal sets ⋮ Mutable objects in R ⋮ Making higher-order superposition work ⋮ Making higher-order superposition work ⋮ The most-likely skyline problem for stochastic points ⋮ PiStache: Implementing π-Calculus in Scala ⋮ Efficient Type-Checking for Amortised Heap-Space Analysis ⋮ Automatic Functional Correctness Proofs for Functional Search Trees ⋮ Purely Functional 1-2 Brother Trees ⋮ A Survey of Data Structures in the Bitprobe Model ⋮ Towards an Implementation of a Computer Algebra System in a Functional Language ⋮ Ready,Set, Verify! Applyinghs-to-coqto real-world Haskell code ⋮ Two decades of automatic amortized resource analysis ⋮ Type-based analysis of logarithmic amortised complexity ⋮ An incremental algorithm for DLO quantifier elimination via constraint propagation
