The innovation here is lists as emergent from one basic concept. So, just to be clear, one can separate the code one uses for manipulating persistent structures for a particular intent from the design behind those persistent structures. In that sense, the Pointrel Data Repository System is language neutral. In fact, I have working Smalltalk, Python, and Delphi code for creating and manipulating such repositories, and obviously Delphi does compile time type checking. There are no other types of nodes.
Every node can have up to three links, as well as a binary string.
Nodes can if desired not use all four of these slots, as in an abstract node might have nil values for all three links and an empty string, or a string node might have nil values for all three links but define a string.