Stack Exchange
open access
CC BY-SA
What are the outstanding questions in purely functional data structures?
This question is inspired by another question about what's new in PFDS since the publication of Okasaki's book in 1998. I'll start with two questions I have: Is there a purely functional set data structure that approaches the speed of hash tables? Tries aren't there yet. Are there purely functional finger trees with O(1) append? The best so far is O(lg lg n), devised by Kaplan and Tarjan. What other purely functional data structure problems are open?
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- What's new in purely functional data structures since Okasaki?#787493
- A Case For Higher-Order Metaphysics#108390
- Mapping Meiotic Recombination DNA Double-Strand Breaks (DSBs) Hotspots -Methodological Advances and Challenges.#371558
- Supplementary file 2_Refining methodological approaches for analysing higher-throughput locomotor behaviour, using generalized additive mixed models.xlsx#471767
- The epiDiagram and Some Other Conceptual Resources for Interdisciplinary Diagram Research#447060
Record · ID 787568
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive