3 ms·
The function "unsafePerformIO" is not a hack, it is the tool that allows you to write safe functions with the correct, pure type signature even though the compi
by klodolph 16y ago
The function "unsafePerformIO" is not a hack, it is the tool that allows you to write safe functions with the correct, pure type signature even though the compiler cannot prove that the function is safe.
For example, suppose you write "memoize" without using "unsafePerformIO". Here's the resulting type signature:
badMemoize :: Ord a => (a -> b) -> IO (a -> IO b)
The resulting output has type "a -> IO b", but it doesn't actually do IO and it has no side effects! It's a normal, pure, referentially transparent function, and it shouldn't be in the IO Monad. The correct signature is "a -> b", just like the input. The "unsafePerformIO" function is a non-hack used by careful programmers to expose pure interfaces to code that uses impure constructs.
See the FFI tutorials for more examples of using unsafePerformIO.
(Of course, unsafe does mean unsafe... you can easily cause segfaults with that thing, you have to use it correctly.)
- masklinn 16y ago> The function "unsafePerformIO" is not a hack, it is the tool that allows you to write safe functions with the correct, pure type signature even though the compiler cannot prove that the function is safe. It is a hack, since it subverts the type system. It allows you to write safe functions with a pure (and potentially lying) type signature, but it also has no problem letting you create completely unsafe and broken functions. > The resulting output has type "a -> IO b", but it doesn't actually do IO and it has no side effects! Of course it does in its implementation, you do have to fill the memoization cache on a miss don't you? > The "unsafePerformIO" function is a non-hack used by careful programmers to expose pure interfaces to code that uses impure constructs. I don't agree with the first part of your declaration. At all. > Of course, unsafe does mean unsafe... you can easily cause segfaults with that thing, you have to use it correctly. And that's why it's a hack, just as using bit shifting instead of multiplication or division is a hack as it relies on the implementation details of the language and the hardware infrastructure. Yeah careful programmers can use it to wring out the latest drop of performance out of their software (assuming there is no optimizing compiler on the platform), but it's still a hack.
- applicative 16y agoI don't get this, what is hackish or immoral about this: http://hackage.haskell.org/packages/archive/bytestring/0.9.0.4/doc/html/src/Data-ByteString-Internal.html http://hackage.haskell.org/packages/archive/bytestring/0.9.0... which makes as many uses of unsafePerformIO as it exports functions, and the beautiful pure interface that is thereby created: http://hackage.haskell.org/packages/archive/bytestring/0.9.0.4/doc/html/Data-ByteString.html http://hackage.haskell.org/packages/archive/bytestring/0.9.0... It seems to me that there is an element of hypocrisy in some of the complaints above; it is as if they were saying: > In Haskell, it's a nightmare to define a pure function with IO. You have to use that dreadful hack `unsafePerformIO`! In practical languages, by contrast, we are spared this boilerplate, since basically every line is already unsafePerformIO.
- masklinn 16y ago> It seems to me that there is an element of hypocrisy in some of the complaints above; it is as if they were saying Apart from the "nightmare" part, this statement you made up happens to be factually true. What is your issue with it? It's exactly what happens: in most other langages, every line is indeed unsafePerformIO. Isn't that fact one of the reasons Haskellers give for using haskell in the first place?
- jrockway 16y agoWe use Haskell so that 99% of the time, the compiler can prove our program safe. Then, the other 1% of the time, we use our human intuition to decide to "gamble" and disagree with the compiler. In most languages, 100% of your code is that same gamble.
- klodolph 16y agoI think you don't understand the Haskell runtime. let x = [1..] in do print (x !! 1000000) print (x !! 1000000) Element #1000000 (counting from zero) of the list "x" is printed out twice. The first time, "x" is a thunk. That thunk is evaluated, and the runtime stores the resulting value back into "x". The second time, "x" is a constructor, so it does not need to be evaluated. You'll see the memory usage spike after the first "print" to account for the million cons cells allocated. This is no different than the interface provided by the memoization function. What distinguishes pure from impure is not memory access -- memory MUST always be modified in order to perform calculation. I recommend reading the Haskell report section on semantics.
- joeyh 16y agoSo is there a memoization library in hackage that uses unsafePerformIO?
- applicative 16y agoCheck out the source for, e.g. http://hackage.haskell.org/package/stringtable-atom http://hackage.haskell.org/package/stringtable-atom There are a number of generalized memoization libraries. This one http://hackage.haskell.org/package/data-memocombinators http://hackage.haskell.org/package/data-memocombinators doesn't use `unsafePeformIO`, but instead imports the Array package. If you check out http://hackage.haskell.org/packages/archive/array/0.2.0.0/doc/html/src/Data-Array-Base.html http://hackage.haskell.org/packages/archive/array/0.2.0.0/do... you will find 696 uses of "unsafe" in one module... http://hackage.haskell.org/package/MemoTrie http://hackage.haskell.org/package/MemoTrie by contrast takes a different approach.
- joeyh 16y agoAFAICS, there is no unsafePerformIO in any of the above except for stringtable-atom. AIUI, it's possible to implement generalized memoization in haskell w/o unsafePerformIO, and both memocombinators and MemTrie do so. I take your point that if necessary, they could have been written to use unsafePerformIO, and as long as the library authors know what they're doing, and are careful, that would be OK. So, you don't actually need to read CS papers to do memoization in haskell. You just need to know that the libraries that do it have "memo", not "memoize" in their names. This stuff, could, perhaps be easier to find.
- applicative 16y agoYou are repeating what I said. I was defending the use of `unsafePerformIO` as a non-'hack', and perhaps I misunderstood you to be thinking otherwise. The memocombinators library uses Array, which uses `unsafePerformIO` and friends almost 700 times in one module. MemTrie takes a different approach, one not using unsafePerformIO; maybe I wasn't clear that was my meaning. In any case, there is little need for a library, at least for the simplest idea of memoization (the ugly Reddit discussion suggests there are many things to be meant.) It is just a case of writing down what is meant, as happens a few times in slightly different ways on the reddit page, off the top of peoples' heads. So for example this one: memo :: Eq k => (k -> v) -> k -> v memo f = unsafePerformIO $ do ref <- newIORef [] :: IO (IORef [(k,v)]) -- make a page for a table return $ \k -> unsafePerformIO $ do -- when f is applied to k memotable <- readIORef ref -- get out the table case lookup k memotable of -- see if k has been done Just x -> return x -- if it has, we're done! Nothing -> do -- if it hasn't let a = f k -- calculate f k atomicModifyIORef ref $ \t -> ((k,a):t,()) -- add it to the table before return a -- returning f k This is someone's brief treatment, which meets most of the definitions people were using. The clojure procedure is more powerful; as far as I can see, getting something similar in Haskell requires a bit more subtlety.