From b4a2485afbf74e99e2147086fbca0568b7e2b7b8 Mon Sep 17 00:00:00 2001 From: Marcos Magueta Date: Sun, 12 Jul 2026 17:55:27 -0300 Subject: relation references as a term kind, written #Name --- docs/states.org | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) (limited to 'docs/states.org') diff --git a/docs/states.org b/docs/states.org index 7849918..aa5c507 100644 --- a/docs/states.org +++ b/docs/states.org @@ -38,16 +38,16 @@ tip, which is the elaboration rule of decision 7 for bare queries. =Insert= is a relation between states: #+BEGIN_SRC sol -[Insert relation: "Person" tuple: {name: "Ana" age: 12} before: S1 after: S2] +[Insert relation: #Person tuple: {name: "Ana" age: 12} before: S1 after: S2] #+END_SRC It holds when the successor of =S1= by admitting that tuple is =S2=. The tuple must match the relation's schema exactly and satisfy its domains, or there is no such transition: integrity is part of the relation, not a hook bolted on. Solving computes successor states -and binds them; nothing moves. The relation name is a string for -now, a provisional notation until relation references in term -position get their own decision. +and binds them; nothing moves. The relation is named by a reference, +=#Person=, per decision 15: a dangling reference is simply no +transition. Sequencing is the chain: =before: S1 after: S2= in one application, =before: S2= in the next. Conjunction stays commutative; the order -- cgit v1.2.3