> statement that the CLR ties you to C# is not justified
it is. F# developers are stuck with the language progress and can't (or don't want to) add big and important features like Type Classes or Higher-kinded Types, until C# adds them first
307 karma · joined January 5, 2019
it is. F# developers are stuck with the language progress and can't (or don't want to) add big and important features like Type Classes or Higher-kinded Types, until C# adds them first
or you can use https://www.linuxboot.org/ as a coreboot payload
Ron Pressler - Finite of Sense and Infinite of Thought: A History of Computation, Logic and Algebra
https://github.com/propensive/fury
https://youtu.be/Xti2I2Csww8?t=1620
it seems like people working on package management/distribution related things LOVE the idea of IPFS
> go-ipfs-chunker provides the Splitter interface. IPFS splitters read data from a reader an create "chunks". These chunks are used to build the ipfs DAGs (Merkle Tree) and are the base unit to obtain the sums that ipfs uses to address content.
> The package provides a SizeSplitter which creates chunks of equal size and it is used by default in most cases, and a rabin fingerprint chunker. This chunker will attempt to split data in a way that the resulting blocks are the same when the data has repetitive patterns, thus optimizing the resulting DAGs.
I think they should use the rolling hash based chunking by default
> Early on in the language history we used IPFS to distribute the Dhall Prelude, but due to reliability issues we’ve switched to using GitHub for hosting Dhall code.
http://www.haskellforall.com/2019/01/dhall-year-in-review-20...
https://github.com/dhall-lang/dhall-lang/issues/162
I wish IPFS the best, because at least in theory this seems like a perfect use case
https://www.cs.cmu.edu/~rwh/pfpl/index.html
direct link to a preview of the 2nd edition:
https://www.cs.cmu.edu/~rwh/pfpl/2nded.pdf
direct link to an unabridged version of the 1st edition:
the pipes in your typical functional language (`|>`) is not a form of function composition, like
```
f >> g === x -> g(f(x))
```
but function application, like
```
f x |> g === g(f(x))
x |> f |> g // also works, has the same meaning
f |> g // just doesn't work, sorry :(
```