-
The changes proposed in #304 and the incorrect code path for `logaddexp` uncovered in #306 suggest adding more structure to the `funsor.ops` module.
Possible changes:
- [ ] To address the bug foun…
-
Pretty-print GATs as LaTeX in both of the following styles:
1. Cartmell-style linear notation
2. natural-deduction-style tree notation
The examples above depict the theory of monoids and …
-
- [ ] Pyro Gel (fire resistance)
- [ ] Thermal Gel (heat/lava resistance)
- [ ] reduce walk damage if implemented: #282
- [ ] Metamaterials
- [ ] nanotech
- [ ] electrified
- [ ] poisoned
- […
-
So we have an `Abelian` type and a `Commutative` typeclass, right? And categorically there's a forgetful functor from abelian groups to commutative monoids --- and that functor has a left adjoint, whi…
hrb90 updated
6 years ago
-
I create tools to manipulate finite automaton : minimize, determinize, etc...
I create tools to manipulate beta-adic monoids (with eventually a subshift of finite type).
And you can compute finite a…
-
Panettone is currently not powerful enough to infer and generate the type information for array items, and probably more advanced OpenAPI use cases (read: very nested structures).
Therefore when an…
-
It looks like Agda supports qualified infix identifiers now, which is great.
However, I've noticed some funny behavior with them.
For example, in the following code:
``` agda
data Bool : Set where
…
-
1st: Id like to contribute, so if you need any help (coding, documentation, tutorials, etc) don't hesitate.
2nd: I would like to use/help create a functional programming library that has these charac…
-
## About the author
I am a university student, studying a double degree in Mathematics and Computer Science. I am a programmer, working in C#; however, in recent months, have dived deep into the Ha…
-
This exercise is proposed in the context of the Haskell track, but I'm posting it here because I like the idea of sharing exercise ideas across, and monoid abstractions exist in other languages, too. …