- Haskell-Cafe - Haskell.org

Problems with Stack on Gentoo Linux
by Nicola Gigante 20 Oct '15

20 Oct '15

Hi all I’m sorry if this is not the right list to ask, I was unsure. I’m having problems compiling a project with stack on a Gentoo machine. I only have shell access to the machine, so I don’t have too much info about it, but the admin assured me that everything is up to date. I’ve upgraded to the latest stack, but the problem was also present with 0.1.4. While doing stack build on my project with resolver lts 3.10 I get the following strange error: ---------------------------------------------------------------------------------------------- -- While building package transformers-base-0.4.4 using: /home/gigabytes/.stack/setup-exe-cache/setup-Simple-Cabal-1.22.4.0-x86_64-linux-ghc-7.10.2 --builddir=.stack-work/dist/x86_64-linux/Cabal-1.22.4.0/ build --ghc-options " -ddump-hi -ddump-to-file" Process exited with code: ExitFailure 1 Logs have been written to: /home/gigabytes/gigabytes.it/.stack-work/logs/transformers-base-0.4.4.log Configuring transformers-base-0.4.4... Building transformers-base-0.4.4... Preprocessing library transformers-base-0.4.4... [1 of 1] Compiling Control.Monad.Base ( src/Control/Monad/Base.hs, .stack-work/dist/x86_64-linux/Cabal-1.22.4.0/build/Control/Monad/Base.o ) src/Control/Monad/Base.hs:22:1: Warning: The import of `Data.Monoid' is redundant except perhaps to import instances from `Data.Monoid' To import instances alone, use: import Data.Monoid() src/Control/Monad/Base.hs:24:1: Warning: The import of `Control.Applicative' is redundant except perhaps to import instances from `Control.Applicative' To import instances alone, use: import Control.Applicative() .stack-work/dist/x86_64-linux/Cabal-1.22.4.0/build/src/Control/Monad/Base.dump-hi: commitBuffer: invalid argument (invalid character) ---------------------------------------------------------------------------------------------- Note that the warnings are not stopping the compile process themselves, but they somehow trigger the last error which kills the compiler. Stack is using the system-installed GHC here, which is version 7.10.2 (of course, otherwise stack wouldn’t have selected it). Maybe the system-wide compiler wasn’t installed properly (I doubt it, since the admin told me he uses a Gentoo package manager which is written in haskell and everything works well). So I’ve tried installing a stack-local GHC version, but I get a sanity check error: ---------------------------------------------------------------------------------------------- The GHC located at /home/gigabytes/.stack/programs/x86_64-linux/ghc-7.10.2/bin/ghc failed to compile a sanity check. Please see: https://github.com/commercialhaskell/stack/blob/release/doc/install_and_upg… for more information. Exception was: Running /home/gigabytes/.stack/programs/x86_64-linux/ghc-7.10.2/bin/ghc /tmp/stack-sanity-check22752/Main.hs -no-user-package-db exited with ExitFailure 1 [1 of 1] Compiling Main ( /tmp/stack-sanity-check22752/Main.hs, /tmp/stack-sanity-check22752/Main.o ) Linking /tmp/stack-sanity-check22752/Main ... /usr/lib/gcc/x86_64-pc-linux-gnu/4.9.3/../../../../x86_64-pc-linux-gnu/bin/ld: /tmp/stack-sanity-check22752/Main.o: relocation R_X86_64_32S against `stg_bh_upd_frame_info' can not be used when making a shared object; recompile with -fPIC /tmp/stack-sanity-check22752/Main.o: error adding symbols: Bad value collect2: error: ld returned 1 exit status ---------------------------------------------------------------------------------------------- So to recap: - The system-wide ghc crashes compiling transformers-base-0.4.4 - The stack-local ghc does not pass a sanity check On an OS X machine, the project compiles and work very well with the same stack and ghc versions and the same LTS, so I suppose this has to do with Gentoo. Any ideas? Thank you, Nicola

3 3

A GC'd heap using weak pointers
by Thomas Koster 20 Oct '15

20 Oct '15

Good afternoon list, I am implementing a simple, interpreted language that needs a garbage- collected heap for storage. Like most discussions on memory management, I use the term "heap" by analogy - the actual data structure is not necessarily a true heap. My Heap type is basically a map of "addresses" (Int) to values. Values may themselves contain addresses, perhaps recursively to each other (like letrec). The extra field in Heap stores the next unused address, used to allocate fresh slots, as you can see in "heapAlloc". > type Address = Int > data Value = ...things with Addresses... > data Heap = Heap !Address (Map Address Value) > > heapAlloc :: Heap -> (Address, Heap) > heapAlloc (Heap nextFreeAddr binds) = > (nextFreeAddr, Heap (succ nextFreeAddr) binds) There is also a stack of roots and an expression under evaluation. > type Stack = [...things with Addresses...] > data Expr = ...things with Addresses... The function I need to write is: > heapGC :: [Address] -> Heap -> Heap > heapGC roots heap = ...collect unreachable values from heap... Rather than re-invent this particularly complex wheel, I am wondering if I could use GHC weak pointers and have the GHC runtime collect values in my heap for me. Something like this: > type Address = Int > data Reference = Reference Address > data Value = ...things with References... > data Heap = Heap !Address (Map Address (Weak Value)) > > heapAlloc :: Heap -> (Reference, Heap) > heapAlloc (Heap nextFreeAddr binds) = > (Reference nextFreeAddr, Heap (succ nextFreeAddr) binds) > > heapStore :: Reference -> Value -> Heap -> IO Heap > heapStore ref@(Reference addr) val (Heap nextFreeAddr binds) = do > weakVal <- mkWeak ref val Nothing > return $ Heap nextFreeAddr (Map.insert addr weakVal binds) Note the new type, Reference. This replaces Address everywhere except in the heap's internal structure, which continues to use Address. Reference values are opaque, unique and obtained from the heap using heapAlloc. The idea is that only two things should cause Values to stay alive: 1. reachable holders of Reference (by GHC's definition of "reachable"), 2. ordinary Haskell closures arising from stepping the interpreter. "Being in the Heap" should not be enough to keep a Value alive. Then, my heapGC function should only have to prune dead addresses from the map. I am having trouble getting a proof-of-concept working (I am unable to observe any finalizers running, ever), but before I get into that, is this idea sound? Has somebody else implemented this in a library already? Thanks, Thomas Koster

2 3

Global fixity (our status quo) vs. local fixity
by Jeffrey Brown 20 Oct '15

20 Oct '15

In Haskell, fixity is global. There are ten levels. You can't stick something between two levels, and you can't subvert the order of the levels. If you want something that binds before >>= but after the logical operators && and ||, you're out of luck -- unless you're willing to define synonyms for && and || that bind faster. (Tidal, a music DSL written in Haskell (it's on Hackage), exemplifies that problem with its |+| operator.) Conceptually, by contrast, fixity is local. The arithmetic operators (* + - / and **), for instance, have a certain fixity defined relative to each other, and that order does not, I believe, in the mind of most users extend beyond arithmetic. Does anybody else think it would be nice if a library's author had only to decide its operators' precedence relative to each other, and could let users decide for themselves how fast its operators should bind relative to operators from another library? -- Jeffrey Benjamin Brown

3 4

hoogte db for the ghc api?
by Erik Rantapaa 19 Oct '15

19 Oct '15

Hi all, Is there a hoogle database for modules which come with GHC? - i.e. the modules on this page: http://downloads.haskell.org/~ghc/7.10.2/docs/html/libraries/ghc-7.10.2/ind… The text files would be preferable to a .hoo file, but I'll take either. Thanks! ER

3 2

Future of FPComplete Haskell Center (IDE)
by Thomas Bereknyei 19 Oct '15

19 Oct '15

FPComplete is deprecating Haskell Center and removing support for their hosted IDE at the end of the year. I enjoy using the IDE in many situations and would like to have a similar capability available to the community. I know several people have expressed interest in helping maintain a version that can go on. Michael Snoyman has stated that there are some issues with the existing codebase and that there are many things that can/should be improved. There are some limitations due to NDA, but I believe FPComplete would be willing to hand over much of the codebase. I intend this thread to bring together those people interested in helping with this effort in any way. Personally, I would be willing to provide limited hosting and some development support. My goals would be to upgrade support to 8.x GHC, latest Stackage - LTS and create a path for people to self-host the IDE. -Tom Bereknyei

3 2

[NL-FP 2016] Announcement: Dutch Functional Programming Day 2016
by Atze Dijkstra 19 Oct '15

19 Oct '15

[My apologies for multiple received copies of the same message] Dear all, The next Dutch Functional Programming day (NL-FP 2016) will be held on Friday, January 8, 2016 at the Utrecht University, The Netherlands. You are invited to participate and to give a presentation. At the end of the day we will have a joint dinner. On the web page http://foswiki.cs.uu.nl/foswiki/NlFpDay2016/WebHome <http://foswiki.cs.uu.nl/foswiki/NlFpDay2016/WebHome> for the day you’ll find preliminary information which will be further filled in due time. Registration is by letting me know via email (with a subject header that begins with [NL-FP 2016]) whether you want to (1) participate, (2) join dinner, (3) give a presentation (please include title + abstract), also see the webpage for additional details. If you intend to participate, please let me know as soon as possible because we like to know how many people we can expect. Hope to meet you all in Utrecht at the next FP Day! Best regards, - Atze - Atze Dijkstra, Department of Information and Computing Sciences. /|\ Utrecht University, PO Box 80089, 3508 TB Utrecht, Netherlands. / | \ Tel.: +31-30-2534118/1454 | WWW : http://www.cs.uu.nl/~atze . /--| \ Fax : +31-30-2513971 .... | Email: atze(a)uu.nl ............... / |___\

1 0

Building 32-bit binaries on a 64-bit system?
by Mike Meyer 19 Oct '15

19 Oct '15

I've got someone who wants to run one of my haskell apps on a 32-bit Windows 10 box. I've pretty much moved to 64-bit everywhere, so don't have such a system to build on. Is it possible to get stack/cabal/ghc to build a 32-bit Windows binary on a 64-bit Windows box? Google found a bunch of things about building 64 bit applications, and the ghc manual doesn't seem to have such an option. So do I need to get a 32-bit system for this?

5 6

STM and garbage collector
by Tomas Carnecky 18 Oct '15

18 Oct '15

If a thread is blocking indefinitely in an STM transaction (reading from a queue to which nobody else has a reference and thus can not write into), is the runtime smart enough to GC the thread? Or do I have to kill the thread manually?

3 3

make an PrimMonad-wrapped FFI call
by Alexey Egorov 18 Oct '15

18 Oct '15

Hello haskellers, I'm writing FFI bindings to C library which uses some allocations across functions call, for example: int *alloc_buf(void); void free_buf(int *); So I need to use newForeignPtr to make sure buffer will be free'd when all pointers to it get collected. But what if I want to do this in PrimMonad (say, ST) and not IO (returned by newForeignPtr)? Thanks.

1 0

How to specialize a type
by martin 17 Oct '15

17 Oct '15

Hello all, Suppose I have a type "Process" which stands either for a Train or a moving Belt. In both cases there is a place of departure and a place of arrival. However the other parameters which describe a Process differ. A Train has departure and arrival times, but a Belt has a speed. I tried the following: type PlaceDep = Int type PlaceArr = Int data Process = Train PlaceDep PlaceArr TP | MovingBelt PlaceDep PlaceArr BP deriving (Eq, Show) data TP = TP Int deriving (Eq, Show) data BP = BP Int deriving (Eq, Show) prc1 = Train 10 11 (TP 1) prc2 = MovingBelt 12 13 (BP 2) What I don't like about this is that the fact that all Processes have PlaceDep and PlaceArr appears somewhat "coincidental". This in contrast, captures the common parts more clearly: type PlaceDep = Int type PlaceArr = Int data ProcessParams = DepartureTime Int | Speed Int deriving (Eq, Show) data Process = Process PlaceDep PlaceArr ProcessParams deriving (Eq, Show) prc1 = Process 10 11 (DepartureTime 1) prc2 = Process 12 13 (Speed 2) Is this the classic way of specializing a type or are there better options See also: http://stackoverflow.com/questions/33156656/subclassing-a-type-in-haskell/3…

2 3