-
Currently, you have
``` haskell
data CTQueue q c x y where
C0 :: CTQueue q c x x
CN :: c x y -> !(q (CTQueue q c) y z) -> CTQueue q c x z
```
According to [Okasaki](https://www.cs.cmu.edu/~rwh/t…
-
Hey Tarak,
I'm happy to see my project was inspirational, actually I had hoped it would be! R needs these sorts of things I think, and a bst would be a great addition.
For the backend of your struc…
-
Lets do a community call on strategies for replicating merkle dags
YouTube link: http://youtu.be/DPiOdh8CoS0
Gitter link (chat/ask questions): https://gitter.im/datproject/discussions
Etherpad: https…
-
-
Matt Parkinson and Jon Harrop are planning on adding a list of possible student projects to fsharp.org, as ideas for people teaching with F#, and this is a placeholder item to get together an initial …
ghost updated
9 years ago
-
[@gavinking] Ross argues that `switch` statements should have disjoint `case`s, so that reordering the `case`s does not effect the execution of the statement.
I propose the following solution:
1. The…
-
Why not match the solved anagram with the list of words in wordset?
-
Hello,
First of all, thank you for a great book, looking forward for the next chapters!
While reading, I've found some typos and places, I would personally like "improved". I'm using a kindle version…
-
Ross argues that `switch` statements should have disjoint `case`s, so that reordering the `case`s does not effect the execution of the statement.
I propose the following solution:
1. The `switch` exp…
-
Please go here:
http://101companies.org/wiki/Resource:Purely%20functional%20data%20structures
No triples are rendered.
Instead it looks like this:
instanceOf::Namespace:Resource
identifies::http:…