- semantic immutability
- nested structures
- mutual pointers
- top-level objects
- CRUD -- create, read, update, delete
If you do not understand some of these terms, you probably did not understand much of what Dr. Tychonievich had to say. The gist of what this is all about is the ability to select the data in a way to allow the links to that data to be preserved even if the data is moved from one program to another. The issues raised also have to do with the way changes are made in a family history program. The issue also extends to merging duplicate individuals. The presentation talked about the internal programming concerns for utilizing these functions in a family tree.
This presentation is a good example of why the Innovator Summit exists. There are people who are working on the aspects of family history that enables us to have online family trees and also provide the technical aspects of the programs that are necessary for the programs to function.
Here is more specific description of the class.
Developers raised on imperative object-oriented programming are often surprised to learn that large systems can be written without the use of assignment statements or SQL UPDATEs: all variables and database entries can be immutable, write-once data. Immutable data simplifies concurrency, distributed system design, replication, caching, program verification, and many data-processing algorithms. This talk will discuss how to modify the communication mechanism between tools or between different users' copies of the same tool to incorporate immutability, focusing on three benefits: an efficient, intrinsic handling of versioning and conflict resolution; a trivial way to let users chose not to share some details without impacting anything else; and a natural merging of the "my data" and "shared data" models of family history software. Time permitting, we'll also discuss its potential use in future partial-implementation- and extension-friendly data standards.