-
Following a paper of Chari and Kleber: *Symmetric functions and representations of quantum affine algebras*, arxiv:0011161v1. We implement the symplectic and orthogonal (filtered) bases of Sym.
Dep…
-
We provide a basic implementation of representations of semigroups with a distinguished basis.
CC: @sagetrac-sage-combinat @nthiery @avirmaux
Component: **group theory**
Keywords: **representati…
-
> [monoid-pearl.pdf](http://www.cis.upenn.edu/~byorgey/pub/monoid-pearl.pdf)
- [x] 印刷する
- [x] 読む
- [ ] 理解する
- [ ] 記録を上げる
- [ ] リファレンスを調べる
- [ ] `diagrams`を実際に使う
疑問点があればコメントに残す方向で。
-
Similar to Monoids.
-
In semigroup documentation:
-- | Use @'Option' ('First' a)@ to get the behavior of 'Data.Monoid.First' from @Data.Monoid@.
In my code:
stats1 :: TempTime -> Option (First LocalTime)
stats1 tt@(Arg …
-
``` js
var dl = require('./src/index')
var agg = dl.groupby().stream(true).key("_id").summarize({'vg_dataref': ['min', 'max'] });
var add1 = [
{ x: 1, y: 28, _id: 1 },
{ x: 2, y: 55, _id: 2 },
…
-
Where should mconcat() come from? Didn't see it in anywhere if the imported scripts.
raine updated
9 years ago
-
I commonly find myself wishing that there was a function which acted like `R.mixin` but with an entire list of objects. Here's the type signature, implementation.
``` javascript
// R.blend :: [{}] ->…
-
This is your implementation for the `WC` monad
```
val wcMonoid: Monoid[WC] = new Monoid[WC] {
// The empty result, where we haven't seen any characters yet.
val zero = Stub("")
def op…
-
One thing we did in algebird was make an algebird-test package. Here we defined thinks like `def monoidLaws[T: Arbitrary: Monoid]: Prop` so users could easily test their monoids just by making an Arbi…