Functor #
Equations
- IterativeDomain.map f = Sum.map f id
- IterativeDomain.map f = Sum.map f (Sum.map id (UniformFun.map (Set.image (Branch.map (IterativeDomain.map f)))))
Instances For
Equations
- DomainUnion.map f = Sigma.map id fun (x : ℕ) => IterativeDomain.map f
Instances For
Map leaves of the tree using a given function.
Equations
Instances For
Applicative functor #
Equations
Instances For
Equations
- Domain.pure v = ↑(DomainUnion.mk (IterativeDomain.pure v))
Instances For
Equations
- Domain.pureₗ = { toFun := Domain.pure, lipschitz := ⋯ }
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- DomainUnion.ap ⟨fst, p⟩ ⟨fst_1, q⟩ = DomainUnion.mk (p.ap q)
Instances For
Equations
- Domain.ap = UniformSpace.Completion.extension₂ fun (x : DomainUnion «Σ» Γ α (β →ₗ[K] γ)) (y : DomainUnion «Σ» Γ α β) => ↑(x.ap y)
Instances For
General form of sequential composition.
Equations
Instances For
Monad #
Equations
- Branch.bind f (Sum.inl (c, π)) = Branch.recv c fun (v : α) (ok : Bool) => { val := (π v ok).val.bind f }
- Branch.bind f (Sum.inr (Sum.inl (c, v, p))) = Branch.send c v { val := p.val.bind f }
- Branch.bind f (Sum.inr (Sum.inr (Sum.inl (c, p)))) = Branch.close c { val := p.val.bind f }
- Branch.bind f (Sum.inr (Sum.inr (Sum.inr (Sum.inl (c, p))))) = Branch.sync c { val := p.val.bind f }
- Branch.bind f (Sum.inr (Sum.inr (Sum.inr (Sum.inr (σ, p))))) = Branch.next σ { val := p.val.bind f }
Instances For
Equations
- IterativeDomain.bind (Sum.inl v) f = f v
- IterativeDomain.bind (Sum.inl v) f = f v
- IterativeDomain.bind (Sum.inr PUnit.unit) f = Domain.abort
- IterativeDomain.bind (Sum.inr (Sum.inl PUnit.unit)) f = Domain.abort
- IterativeDomain.bind (Sum.inr (Sum.inr g)) f = Domain.branch fun (σ : «Σ») => Branch.bind f '' g σ
Instances For
Equations
- DomainUnion.bind ⟨fst, q⟩ = q.bind
Instances For
Replace leaves of the tree with subtrees depending on the value of the leaves.
Equations
- p.bind f = UniformSpace.Completion.extension (fun (x : DomainUnion «Σ» Γ α β) => x.bind f) p
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- DomainUnion.seq ⟨fst, q⟩ ⟨fst_1, q_1⟩ = DomainUnion.mk (q.seq q_1)
Instances For
Restricted form of sequential composition where all leaves are replaced with the same subtree.
Equations
- Domain.seq = UniformSpace.Completion.extension₂ fun (x y : DomainUnion «Σ» Γ α PUnit.{?u.1 + 1}) => ↑(x.seq y)
Instances For
Restricted form of sequential composition where all leaves are replaced with the same subtree.
Equations
Instances For
Channel closure #
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- IterativeDomain.syncClose zero c = id
- IterativeDomain.syncClose zero c = Sum.map id (Sum.map id (Pi.map fun (σ : «Σ») => Set.image (Branch.syncClose zero c σ)))
Instances For
Equations
- DomainUnion.syncClose zero c = Sigma.map id fun (x : ℕ) => IterativeDomain.syncClose zero c
Instances For
Close a synchronous channel c in the tree, pruning subtrees accordingly.
Equations
- Domain.syncClose zero c = UniformSpace.Completion.map (DomainUnion.syncClose zero c)
Instances For
Close a synchronous channel c in the tree, pruning subtrees accordingly.
Equations
Instances For
Equations
- One or more equations did not get rendered due to their size.
- IterativeDomain.choice (Sum.inl val) q = IterativeDomain.lift ⋯ q
- IterativeDomain.choice (Sum.inl val) q = IterativeDomain.lift ⋯ q
- p.choice (Sum.inl val) = IterativeDomain.lift ⋯ p
- p.choice (Sum.inl val) = IterativeDomain.lift ⋯ p
- IterativeDomain.choice (Sum.inr PUnit.unit) q = IterativeDomain.abort
- IterativeDomain.choice (Sum.inr (Sum.inl PUnit.unit)) q = IterativeDomain.abort
- p.choice (Sum.inr PUnit.unit) = IterativeDomain.abort
- p.choice (Sum.inr (Sum.inl PUnit.unit)) = IterativeDomain.abort
Instances For
Equations
- DomainUnion.choice ⟨fst, q⟩ ⟨fst_1, q_1⟩ = DomainUnion.mk (q.choice q_1)
Instances For
Non-deterministic choice, aka tree union.
Equations
- Domain.choice = UniformSpace.Completion.extension₂ fun (x y : DomainUnion «Σ» Γ α PUnit.{?u.1 + 1}) => ↑(x.choice y)
Instances For
Equations
- Domain.failure = Domain.branch fun (σ : «Σ») => {Branch.next σ { val := Domain.abort }}
Instances For
Event hiding #
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
- IterativeDomain.hide zero c = id
Instances For
Equations
- DomainUnion.hide zero c = Sigma.map id fun (x : ℕ) => IterativeDomain.hide zero c
Instances For
Equations
- Domain.hide zero c = UniformSpace.Completion.map (DomainUnion.hide zero c)
Instances For
Remove branches that mention the synchronous channel c, but replace the pruning of all
branches at a particular point by abortion.
Equations
Instances For
Parallel composition #
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
- IterativeDomain.parallel (Sum.inl v) p' = IterativeDomain.lift ⋯ (IterativeDomain.map (fun (x : γ) => (v, x)) p')
- IterativeDomain.parallel (Sum.inl v) p' = IterativeDomain.lift ⋯ (IterativeDomain.map (fun (x : γ) => (v, x)) p')
- p.parallel (Sum.inl v) = IterativeDomain.lift ⋯ (IterativeDomain.map (fun (x : β) => (x, v)) p)
- p.parallel (Sum.inl v) = IterativeDomain.lift ⋯ (IterativeDomain.map (fun (x : β) => (x, v)) p)
- IterativeDomain.parallel (Sum.inr PUnit.unit) p' = IterativeDomain.abort
- IterativeDomain.parallel (Sum.inr (Sum.inl PUnit.unit)) p' = IterativeDomain.abort
- p.parallel (Sum.inr PUnit.unit) = IterativeDomain.abort
- p.parallel (Sum.inr (Sum.inl PUnit.unit)) = IterativeDomain.abort
Instances For
Equations
- DomainUnion.parallel ⟨fst, q⟩ ⟨fst_1, q_1⟩ = DomainUnion.mk (q.parallel q_1)
Instances For
Parallel composition. Generates all the possible interleavings as well as synchronizations.
Equations
- Domain.parallel = UniformSpace.Completion.extension₂ fun (x : DomainUnion «Σ» Γ α β) (y : DomainUnion «Σ» Γ α γ) => ↑(x.parallel y)
Instances For
Map leaves of the tree using a given function.
Equations
- Domain.«term_<$>_» = Lean.ParserDescr.trailingNode `Domain.«term_<$>_» 100 101 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " <$> ") (Lean.ParserDescr.cat `term 100))
Instances For
Close a synchronous channel c in the tree, pruning subtrees accordingly.
Equations
- Domain.«term_⊖_» = Lean.ParserDescr.trailingNode `Domain.«term_⊖_» 65 65 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ⊖ ") (Lean.ParserDescr.cat `term 66))
Instances For
General form of sequential composition.
Equations
- Domain.«term_<*>_» = Lean.ParserDescr.trailingNode `Domain.«term_<*>_» 60 61 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " <*> ") (Lean.ParserDescr.cat `term 60))
Instances For
Replace leaves of the tree with subtrees depending on the value of the leaves.
Equations
- Domain.«term_>>=_» = Lean.ParserDescr.trailingNode `Domain.«term_>>=_» 55 55 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " >>= ") (Lean.ParserDescr.cat `term 56))
Instances For
Restricted form of sequential composition where all leaves are replaced with the same subtree.
Equations
- Domain.«term_⬰_» = Lean.ParserDescr.trailingNode `Domain.«term_⬰_» 60 60 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ⬰ ") (Lean.ParserDescr.cat `term 61))
Instances For
Non-deterministic choice, aka tree union.
Equations
- Domain.«term_⊻_» = Lean.ParserDescr.trailingNode `Domain.«term_⊻_» 65 65 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ⊻ ") (Lean.ParserDescr.cat `term 66))
Instances For
Remove branches that mention the synchronous channel c, but replace the pruning of all
branches at a particular point by abortion.
Equations
- Domain.«term_∖_» = Lean.ParserDescr.trailingNode `Domain.«term_∖_» 50 50 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ∖ ") (Lean.ParserDescr.cat `term 51))
Instances For
Parallel composition. Generates all the possible interleavings as well as synchronizations.
Equations
- Domain.«term_∥_» = Lean.ParserDescr.trailingNode `Domain.«term_∥_» 60 60 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ∥ ") (Lean.ParserDescr.cat `term 61))