{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreidqxkgzxezmrjntpx6grgdeayzas7czptlvugty242qpvp3dmzdha",
    "uri": "at://did:plc:pi6woz4d47bkuws673w2il2r/app.bsky.feed.post/3mhgbttfuxi22"
  },
  "path": "/t/sneak-peek-bolt-math/13766?page=2#post_23",
  "publishedAt": "2026-03-19T12:38:13.000Z",
  "site": "https://discourse.haskell.org",
  "tags": [
    "en.wikipedia.org",
    "Pairing"
  ],
  "textContent": "I would not call a pairing an action in disguise. Actions happen between two objects –one acting on the another. Pairings work with three objects and they usually model some sort of duality. CS related examples show up in cryptography.\n\nen.wikipedia.org\n\n### Pairing\n\nIn mathematics, a pairing is an R-bilinear map from the Cartesian product of two R-modules, where the underlying ring R is commutative. Let R be a commutative ring with unit, and let M, N and L be R-modules. A pairing is any R-bilinear map e : M × N → L {\\displaystyle e:M\\times N\\to L} . That is, it satisfies for any r ∈ R {\\displaystyle r\\in R} ...",
  "title": "Sneak Peek: Bolt Math"
}