nihils

6 ms·

1.
by nihils 9y ago
I don't think there is significant overlap between Python's ideal use cases and Haskells. For one, Haskell's advanced static type system lends itself nicely to formal verification and the handling of domain specific language
2.
by nihils 9y ago
For example, this problem of modifying the diagonal of a matrix can be solved quite easily: type Zipper a = ([a],[a]) cursorOnDiagonal :: [[Int]] -> [Zipper Int] cursorOnDiagonal matrix = map (\(n,x) -> splitAt n x) (zip [0
3.
by nihils 9y ago
If you want immutable data structures that simulate the behavior of mutable data structures look into Zippers. In this case, a list zipper.
4.
by nihils 11y ago
It's Python mail server, that tries to be like Django for Mail. https://github.com/zedshaw/lamson/blob/master/README.md
5.
by nihils 11y ago
I wonder if this can be linked in to Lamson
6.
by nihils 11y ago
This is a fair point, in the that conventional definition of post-structuralism as representation being bound to an interpretative context can be difficult see in daily life. However, such a view's application in Foucault's work
7.
by nihils 11y ago
The author's conception of philosophy seems to be heavily biased towards Western analytic philosophy whose pretension towards logically underpinning sciences and reliance on formal methods means that is more of a theoretical computer s
8.
by nihils 11y ago
This is actually perfect for a library on algebraic structures I've been trying to make in Haskell. For example, how does one distinguish between elements in the Dihedral group of order 10 vs. Dihedral group on order 16 when obstensibl
9.
by nihils 11y ago
Abstract Algebra by Benedict Gross from the Harvard Extension School.