|
|
|
|
|
by jj12345
2802 days ago
|
|
I'm just now starting to crack open some Lisp tutorials, coming from the OOP side of the fence, so please excuse the ignorance. For my learning purposes, would you be open to explaining how symbolic expressions would circumvent the need for a file system? |
|
Now consider that anything that consumes a seekable byte-buffer as its backing store could just-as-well be modified to consume a block device as its backing store.
Voila: your OS now has “durable memory” in place of a filesystem.
(And, in fact, in modern systems you can skip the whole block-device layer and just sit your tuple store directly on top of NVMe.)