As others have already pointed out, Haskell requires automatic, dynamic memory management: automatic memory management is necessary because manual memory management is unsafe; dynamic memory management is necessary because for some programs, the lifetime of an object can only be determined at runtime. For example, consider the following program: main = loop (Just [1..1000]) where … Read more
:set -XRankNTypes. The -X part is a compiler switch, by the way, extension is called just RankNTypes.
I would say that an interface is kind of like a type class SomeInterface t where all of the values have the type t -> whatever (where whatever does not contain t). This is because with the kind of inheritance relationship in Java and similar languages, the method called depends on the type of object … Read more
Mostly because it can be more efficient — values don’t need to be computed if they’re not going to be used. For example, I may pass three values into a function, but depending on the sequence of conditional expressions, only a subset may actually be used. In a language like C, all three values would … Read more
More or less any use of member (ie. nested) types can give rise to a need for dependent method types. In particular, I maintain that without dependent method types the classic cake pattern is closer to being an anti-pattern. So what’s the problem? Nested types in Scala are dependent on their enclosing instance. Consequently, in … Read more
In shang’s answer you can see how to represent a graph using laziness. The problem with these representations is that they are very difficult to change. The knot-tying trick is useful only if you’re going to build a graph once, and afterward it never changes. In practice, should I actually want to do something with … Read more
How folds differ seems to be a frequent source of confusion, so here’s a more general overview: Consider folding a list of n values [x1, x2, x3, x4 … xn ] with some function f and seed z. foldl is: Left associative: f ( … (f (f (f (f z x1) x2) x3) x4) …) … Read more
Haskell is a “pure” functional language, where as F# has aspects of both imperative/OO and functional languages. Haskell also has lazy evaluation, which is fairly rare amongst functional languages. What do these things mean? A pure functional language, means there are no side effects (or changes in shared state, when a function is called) which … Read more
Shipping an executable with Language.Haskell.Interpreter seems to go perfect with the way you have shown. You have to set your PATH to the script you want to execute. And as of side note, as mentioned by @bennofs in comments, Statically linking the GHC API doesn’t work with the new dynamic linker introduced in GHC 7.8, … Read more
Let’s see what’s going on, try $ du -hs A 13M A $ file A A: ELF 64-bit LSB executable, x86-64, version 1 (SYSV), dynamically linked (uses shared libs), for GNU/Linux 2.6.27, not stripped $ ldd A linux-vdso.so.1 => (0x00007fff1b9ff000) libXrandr.so.2 => /usr/lib/libXrandr.so.2 (0x00007fb21f418000) libX11.so.6 => /usr/lib/libX11.so.6 (0x00007fb21f0d9000) libGLU.so.1 => /usr/lib/libGLU.so.1 (0x00007fb21ee6d000) libGL.so.1 => /usr/lib/libGL.so.1 … Read more