write function w with pre/post transformations γ and δ

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.

• pre-lookup (α) and post-lookup (β) transformationsmethod0.706
  Parameterising r with α_i for key transformation before lookup and β_i for recursive retry on ε.
• [ ] associative write operatormethod0.671
  Primitive operator that updates memory m with a new value v for keys k_i.
• To transform a function (in time or in space), apply the transform point-wise to the output, and apply the inverse transform point-wise to the input.claim0.669
  General principle for transforming functions that enables spatial transformation of GUIs without reimplementation; connects to Pan's hyperfilters.
• The specification for (⊸) is a category homomorphism (µ id = id, µ(g ∘ f) = µg ∘ µf), leading to a correct-by-construction implementation.claim0.668
  Demonstration on linear transformations.
• It is easy to express a wavefront computation in Linda: we use eval to create one process for each element, and rd to read the preceding counter-diagonal.claim0.658
  Illustrates how live data structures are simply expressed.
• Style variants (paragraph and character) in word processor; both depend on format conceptfinding0.657
  Empirical analysis of abstract concept instantiation in word processor design
• Theta-Gamma Couplingfinding0.656
  Hippocampal oscillatory phenomenon reproduced by active inference; phase-amplitude coupling.
• dynamic binding for class-based inheritance using σ and τconcept0.654
  Combining α1 with τ (type) and β1 with σ (supertype) to model class-based OO with inheritance in the associative model.