ihm

17 ms·

241.
by ihm 12y ago
It's true that Turing complete languages are (almost by definition) equivalent for writing programs of type "Nat -> Nat". However, things are not so simple at other types and it turns out there is actually something of a s
242.
The Startup Shirt(teespring.com)
2 points by ihm 12y ago|0 comments
243.
by ihm 12y ago
> Natural transformations between functors gives you parametricity and "theorems for free" Could you elaborate? This is something everyone always talks about but I've never really seen a proof/precise statement.
244.
by ihm 12y ago
Lawvere and Schanuel's excellent "Conceptual Mathematics" has plenty of exercises, and the book is insanely approachable while still teaching a good amount (it's chock full of examples). Mac Lane (Categories for the Work
245.
by ihm 12y ago
Here's a reasonably well-cited article rebutting these claims. http://www.jpurol.com/article/S1477-5131%2809%2900349-0/abst... And a free version which seems similar http://www.harryfisch.com/
246.
by ihm 12y ago
You should definitely check out Brent Yorgey's diagrams package (see examples here http://projects.haskell.org/diagrams/gallery.html ) which is a declarative drawing library. Graphics are described in an essentiall
247.
by ihm 12y ago
Could you explain what you mean by this? I'd say using monads is way more "in-your-face" in OCaml since you have to explicitly say which monad you're using (via opening a module or what have you) and there's no do-n
248.
by ihm 13y ago
See this page ( https://github.com/idris-lang/Idris-dev/wiki/Erasure-by-usag... ) for info on erasure. Unused proof values or indices in data types used for static checking are erased at compile time via usage
249.
by ihm 13y ago
1. There is probably no faithful grade-school language explanation. Monads are generally the composite of a left adjoint functor followed by its right adjoint. Adjoint functor pairs often consist of a free and a forgetful functor. A forgetf
250.
by ihm 13y ago
One thing that I love to do in Haskell, and which Haskell is especially suited to, is writing interpreters and parsers. The other week I wrote a brainfuck interpreter ( https://github.com/imeckler/skellfuck ) in a couple of hours. Parsec, a
251.
by ihm 14y ago
How can I declare dependencies on node packages?