computer science, a purely functional data structure is a data structure that can be directly implemented in a purely functional language. The main difference...
11 KB (1,392 words) - 19:47, 2 April 2024
Persistent data Retroactive data structures Purely functional data structure Driscoll JR, Sarnak N, Sleator DD, Tarjan RE (1986). "Making data structures persistent"...
42 KB (6,116 words) - 06:14, 20 March 2025
In computer science, purely functional programming usually designates a programming paradigm—a style of building the structure and elements of computer...
8 KB (907 words) - 00:32, 6 June 2025
Purely functional may refer to: Pure function, a function that does not have side effects Purely functional data structure, a persistent data structure...
456 bytes (83 words) - 12:30, 30 September 2016
Okasaki, Chris (1998). "10.2. Structural Abstraction". Purely Functional Data Structures (1st ed.). pp. 158–162. ISBN 9780521631242. Takaoka, Tadao...
16 KB (2,929 words) - 16:31, 27 May 2025
Piece table E-graph List of algorithms Purely functional data structure Blockchain, a hash-based chained data structure that can persist state history over...
9 KB (914 words) - 05:55, 20 March 2025
lists, which admit purely functional implementation, but have logarithmic access and update times. Purely functional data structures have persistence,...
87 KB (8,696 words) - 16:44, 4 June 2025
In computer science, an array is a data structure consisting of a collection of elements (values or variables), of same memory size, each identified by...
24 KB (3,412 words) - 11:02, 12 June 2025
this.items.shift(); } } Queues can also be implemented as a purely functional data structure. There are two implementations. The first one only achieves...
14 KB (2,130 words) - 11:46, 30 April 2025
science at the United States Military Academy. He authored Purely Functional Data Structures (1998), based on a doctoral dissertation of the same name...
2 KB (153 words) - 14:18, 31 July 2023
Finger tree (category Functional data structures)
a finger tree is a purely functional data structure that can be used to efficiently implement other functional data structures. A finger tree gives...
14 KB (2,044 words) - 17:18, 9 June 2025
aggregate data structure so that it is convenient for writing programs that traverse the structure arbitrarily and update its contents, especially in purely functional...
13 KB (1,885 words) - 14:50, 12 June 2025
Pure function (category Functional programming)
Mathematical-logic system based on functions Purely functional data structure – Data structure implementable in purely functional languages Reentrancy (computing) –...
11 KB (1,233 words) - 06:55, 21 May 2025
Double-ended queue (category Abstract data types)
smaller arrays. Double-ended queues can also be implemented as a purely functional data structure.: 115 Two versions of the implementation exist. The first...
20 KB (2,281 words) - 04:04, 7 July 2024
for the next day's work. Shadow paging is also similar to purely functional data structures, in that in-place updates are avoided. "File System Design...
2 KB (326 words) - 17:16, 4 November 2024
Okasaki, Chris (1998). "10.2. Structural Abstraction". Purely Functional Data Structures (1st ed.). pp. 158–162. ISBN 9780521631242. Takaoka, Tadao...
6 KB (1,345 words) - 23:22, 2 January 2025
Append-only (category Computer data storage)
storage Comparison of file hosting services Data structure Purely functional data structure Log-structured merge-tree Certificate Transparency Write once...
7 KB (759 words) - 14:28, 7 February 2025
under Hashlife than they would under other implementations. Purely functional data structure, of which the hashed quadtree is one Hash consing, which was...
11 KB (1,558 words) - 04:04, 7 May 2024
in Purely Functional Languages" (PDF). Archived (PDF) from the original on 2022-04-28. Carlsson, Magnus; Hallgren, Thomas (1998). "Fudgets – Purely Functional...
12 KB (1,285 words) - 21:31, 5 October 2024
trie) is a persistent data structure that can be used to implement sets and maps, intended to replace hash tables in purely functional programming. In its...
1 KB (103 words) - 22:49, 23 December 2024
Brodal queue (category Heaps (data structures))
describe a persistent (purely functional) version of Brodal queues. Here are time complexities of various heap data structures. The abbreviation am. indicates...
2 KB (914 words) - 17:49, 7 November 2024
List of programming languages by type (redirect from List of purely functional programming languages)
Red Rust Scala (into JVM bytecode) Scheme (e.g. Gambit) SequenceL – purely functional, parallelizing and race-free Simula (object-oriented superset of ALGOL...
90 KB (6,698 words) - 14:47, 15 June 2025
algorithms and data structures. For algorithms and data structures not necessarily mentioned here, see list of algorithms and list of data structures. This list...
35 KB (3,135 words) - 18:46, 6 May 2025
Edward Kmett, which includes the skew-binary random access list algorithm. Purely functional data structures for on-line LCA slides for the same package....
24 KB (2,991 words) - 12:38, 19 April 2025
Priority queue (category Abstract data types)
Okasaki, Chris (1998). "10.2. Structural Abstraction". Purely Functional Data Structures (1st ed.). pp. 158–162. ISBN 9780521631242. Takaoka, Tadao...
33 KB (5,009 words) - 20:17, 10 June 2025
Fibonacci heap (category Heaps (data structures))
Okasaki, Chris (1998). "10.2. Structural Abstraction". Purely Functional Data Structures (1st ed.). pp. 158–162. ISBN 9780521631242. Takaoka, Tadao...
19 KB (3,785 words) - 01:56, 2 March 2025
Binary heap (category Heaps (data structures))
Okasaki, Chris (1998). "10.2. Structural Abstraction". Purely Functional Data Structures (1st ed.). pp. 158–162. ISBN 9780521631242. Takaoka, Tadao...
30 KB (5,127 words) - 11:33, 29 May 2025
In functional programming, monads are a way to structure computations as a sequence of steps, where each step not only produces a value but also some...
75 KB (9,312 words) - 23:45, 4 June 2025
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...
29 KB (3,153 words) - 01:42, 10 June 2025
Pairing heap (category Heaps (data structures))
Okasaki, Chris (1998). "10.2. Structural Abstraction". Purely Functional Data Structures (1st ed.). pp. 158–162. ISBN 9780521631242. Takaoka, Tadao...
13 KB (2,270 words) - 10:22, 20 April 2025