This lecture introduces the formal definitions of partial, full, and confluent persistence in data structures, crucial for understanding immutable data and functional programming paradigms. Key concepts include managing multiple versions of a data structure and enabling modification or merging of past states.
MIT 6.851 Advanced Data Structures, Spring 2012
"Persistence" - remembering all past versions of a data structure ("partial persistence"), being able to modify them - forking off new ones ("full persistence"), and merging different versions into one ("confluent persistence").