crdt-3.0: lib/CRDT/Cm.hs
{-# LANGUAGE DefaultSignatures #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE TypeFamilies #-}
module CRDT.Cm
( CausalOrd (..)
, CmRDT (..)
, concurrent
) where
import CRDT.LamportClock (Process)
-- | Partial order for causal semantics.
-- Values of some type may be ordered and causally-ordered different ways.
class CausalOrd a where
-- | @x `affects` y@ means that
-- @x@ must go before @y@ and @y@ can not go before @x@.
affects :: a -> a -> Bool
comparable :: CausalOrd a => a -> a -> Bool
comparable a b = a `affects` b || b `affects` a
-- | Not comparable, i. e. ¬(a ≤ b) ∧ ¬(b ≤ a).
concurrent :: CausalOrd a => a -> a -> Bool
concurrent a b = not $ comparable a b
{- |
Operation-based, or commutative (Cm) replicated data type.
== Implementation
In Haskell, a CmRDT implementation consists of 3 types —
a __payload__, an __operation__ (@op@) and an __intent__.
[Payload]
Internal state of a replica.
[Intent]
User's request to update.
[Operation (Op)]
Operation to be applied to other replicas.
For many types /operation/ and /intent/ may be the same.
But for 'CRDT.Cm.LWW.LWW', for instance, this rule doesn't hold:
user can request only value, and type attaches a timestamp to it.
== Additional constraint — commutativity law
Concurrent updates are observed equally.
@
∀ op1 op2 .
'concurrent' op1 op2 ==> 'apply' op1 . 'apply' op2 == 'apply' op2 . 'apply' op1
@
Idempotency doesn't need to hold.
-}
class (CausalOrd op, Eq (Payload op)) => CmRDT op where
type Intent op
type Intent op = op -- common case
type Payload op
-- | Generate an update to the local and remote replicas.
--
-- Returns 'Nothing' if the intended operation is not applicable.
makeOp :: Intent op -> Payload op -> Maybe (Process op)
default makeOp
:: Intent op ~ op => Intent op -> Payload op -> Maybe (Process op)
makeOp i _ = Just $ pure i
-- | Apply an update to the payload.
-- An invalid update must be ignored.
apply :: op -> Payload op -> Payload op