Great new work from : inkandswitch.com/cambria.html
Local-first software is a great aspiration, but iterating on decentralized data structures is indeed a nightmare I've been living with as I build . Excited for these ideas on more predictable data evolution.
Conversation
I wonder how to test / formally model the consistency property you'd want the lenses to describe.
Replying to
I've maybe made the problem needlessly hard on myself by using content-addressable identifiers for CRDT log structures (including their parent pointers). Did that so I could serialize to IPFS or similar, but it means I have to rebase the whole tree whenever the structure changes.
4
12
Replying to
yeah, great question! few thoughts on this:
- I think lenses provide most value when there's a simple consistency relation, but preserving it is hard. eg, "Scalar is always first element of array" seems straightforward, but is subtle to maintain... so lenses help you out
1
- We found that live programming is super helpful for writing data transformations.(example screencast: loom.com/share/f974ba7b)
Perhaps a live prog environment with multiple concrete examples ("TDD style") would be a nice way to confidently write transformations
1
1
4
Show replies