Purely functional data structure: Difference between revisions

Revision as of 17:11, 23 September 2017

Revision as of 15:06, 30 September 2017

Line 1:

{{goceinuse}}

{{multiple issues|

{{copy edit|date=January 2017}}

Line 4 ⟶ 5:

{{refimprove|date=January 2017}}}}

In [[computer science]], a '''purely functional data structure''' is a [[data structure]] that can be implemented in a [[purely functional language]]. The main difference between an arbitrary data structure and a purely functional one is that athe purely functional data structurelatter is (strongly) [[immutable object|immutable]]. This restriction ensures the data structure possesses the advantages of immutable objects: (full) [[persistent data structure|persistency]],<nowiki/> quick copy of objects, and [[thread safety]]. Efficient purely functional data structures may require the use of [[lazy evaluation]] and [[memoization]].

==Definition==