Data structure implementable in purely functional languages
This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Purely functional data structure" – news · newspapers · books · scholar · JSTOR(January 2017) (Learn how and when to remove this message)
In computer science, a purely functional data structure is a data structure that can be directly implemented in a purely functional language. The main difference between an arbitrary data structure and a purely functional one is that the latter is (strongly) immutable. This restriction ensures the data structure possesses the advantages of immutable objects: (full) persistency, quick copy of objects, and thread safety. Efficient purely functional data structures may require the use of lazy evaluation and memoization.
and 21 Related for: Purely functional data structure information
computer science, a purelyfunctionaldatastructure is a datastructure that can be directly implemented in a purelyfunctional language. The main difference...
In computer science, purelyfunctional programming usually designates a programming paradigm—a style of building the structure and elements of computer...
Piece table E-graph List of algorithms Purelyfunctionaldatastructure Blockchain, a hash-based chained datastructure that can persist state history over...
notable datastructures, as measured by the complexity of their logical operations. For a more comprehensive listing of datastructures, see List of data structures...
Mathematical-logic system based on functions Purelyfunctionaldatastructure – Datastructure implementable in purelyfunctional languages Reentrancy (computing) –...
under Hashlife than they would under other implementations. Purelyfunctionaldatastructure, of which the hashed quadtree is one Hash consing, which was...
object-oriented models, whereas a structured programming model would tend to not include code, and are called plain old datastructures. Data types may be categorized...
in PurelyFunctional Languages" (PDF). Archived (PDF) from the original on 2022-04-28. Carlsson, Magnus; Hallgren, Thomas (1998). "Fudgets – Purely Functional...
The standard hydrogen-bond definition for secondary structure is that of DSSP, which is a purely electrostatic model. It assigns charges of ±q1 ≈ 0.42e...
algorithms and datastructures. For algorithms and datastructures not necessarily mentioned here, see list of algorithms and list of datastructures. This list...
data into one location, but do not necessarily require an (often complex) master relational schema to structure and define all data in the Hub. Data integration...
application's datastructures may be changed or added, new related application programs may be written to add to the application's functionality, etc. Sometimes...
Edward Kmett, which includes the skew-binary random access list algorithm. Purelyfunctionaldatastructures for on-line LCA slides for the same package....
Computer Programming by Don Knuth, PurelyFunctionalDataStructures by Chris Okasaki exploring how to build datastructures like queues and heaps without...