-
Many monads defined in monad-bayes are known transformers. For example:
```haskell
-- | Collection of random variables sampler during the program's execution.
data Trace a = Trace
{ -- | Seque…
-
Currently, you use
``` haskell
data AsUnitLoop a b c where
UL :: !a -> AsUnitLoop a () ()
newtype MSeq s a = MSeq { getMS :: s (AsUnitLoop a) () () }
```
The trouble is that this sprays `UL` con…
-
Given a graph with different node types (say "a", "b", "c", etc.) and different edge types ("r", "s", "t"), is it acceptable to modify connect such that the edge type determines the types of source an…
-
Agda has pattern synonyms; why not copattern synonyms?
Some (admittedly not very motivating) possible examples:
```agda
copattern π₁ t = proj₁ t
copattern π₂ t = proj₁ (proj₂ t)
copattern π₃ t …
rntz updated
11 months ago
-
**Declaration site**
```
foo(x: Q, y: R, implicit z: S, implicit w: T)
```
**Usage site**
```
foo(x, y)
```
```
foo(x, y, z := z)
```
```
foo(x := 1, y, z:=z)
```
**Pros**
…
-
I'm trying to compile a thorough collection of everything currently documented and everything we still want to document. I'd also like to talk about a few other things other people brought up. This is…
-
The `Eq[Set[A]]` instance given [here](https://github.com/typelevel/cats/blob/706effc1504b129a085bb2db2884455422a88d74/kernel/src/main/scala/cats/kernel/instances/set.scala#L22-L23) is not lawful. It …
-
Hey, I'm just now getting to know this library. I have been waiting/looking for a nice implementation for named parameters for Haskell for a long time, so I am glad you've created this, and I'm glad t…
Wizek updated
4 years ago
-
The problem is that at various parts of the code the distribution is "normalized", and this is a destructive operation. In principle one should work with "infinite precision" in the moments 0..k-2 (in…
-
![captura de pantalla 2015-08-12 a les 08 59 22](https://cloud.githubusercontent.com/assets/13760961/9221018/1ea115ee-40e7-11e5-9d10-d2e137193d5e.png)
Here you can see a screenshot of the output of RS…