Re: [Haskell-cafe] German names for kinds and sorts

2011-11-14 Thread Ertugrul Soeylemez
Daniel Schoepe dan...@schoepe.org wrote: Most time, it is not really difficult to find an appropriate term for concepts of Haskell, like types (Typen) or type classes (Typklassen). But I really don't know how to call kinds and sorts in German. Any ideas? I'd go with Arten and Sorten

Re: [Haskell-cafe] Identifying thunks from GHC heap profiles

2011-11-14 Thread Felipe Almeida Lessa
I'm not sure if it would help, but did you try compiling without optimizations using -O0 ? Cheers, =) -- Felipe. ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Do type classes have a partial order?

2011-11-14 Thread Patrick Browne
Is there a partial order on Haskell type classes?If so, does it induce any quasi-order relation on types named in the instances?In the example below types C and D have the same operation fThanks,Patdata C = C deriving Showdata D = D deriving Showclass A t where f::t-t f t = t instance A C

Re: [Haskell-cafe] German names for kinds and sorts

2011-11-14 Thread John Lato
From: Jerzy Karczmarczuk jerzy.karczmarc...@unicaen.fr So, even more seriously, I propose to use more often Latin and Greek. Jerzy's arguments make a lot of sense to me, but why not use an index-based notation? T0 = Type T1 = Kind T2 = Sort etc. this seems easier to me than an arbitrary

Re: [Haskell-cafe] Do type classes have a partial order?

2011-11-14 Thread Ling Yang
It seems like you would, going by semantics of System F, where types with type variables name a certain subset of types, = constraints further restrict the types of the same shape (are they an independent kind of restriction?), so typeclass declarations with/without = specify a partial order over

[Haskell-cafe] ANN: Netwire 2.0.0

2011-11-14 Thread Ertugrul Soeylemez
Hello everybody, it's finally done. I have just released Netwire 2.0.0, which is a complete rewrite from scratch. It has been generalized to arbitrary automata with inhibition, so FRP is now just a special use case. First of all the top module is now: import Control.Wire Wire is now an

Re: [Haskell-cafe] ANN: Netwire 2.0.0

2011-11-14 Thread Ozgur Akgun
Hi Ertugrul, Compilation problems here: cabal install netwire [ 7 of 22] Compiling Control.Wire.Prefab.Simple ( Control/Wire/Prefab/Simple.hs, dist/build/Control/Wire/Prefab/Simple.o ) Control/Wire/Prefab/Simple.hs:15:7: Ambiguous occurrence `force' It could refer to either

Re: [Haskell-cafe] ANN: Netwire 2.0.0

2011-11-14 Thread Ertugrul Soeylemez
Ozgur Akgun ozgurak...@gmail.com wrote: Compilation problems here: [...] This build was trying to use deepseq-1.2.0.1. It builds fine with deepseq-1.1.0.2 though. It should be fixed now. Thanks for your report! Greets, Ertugrul -- nightmare = unsafePerformIO (getWrongWife = sex)

Re: [Haskell-cafe] ANN: Netwire 2.0.0

2011-11-14 Thread Ozgur Akgun
On 14 November 2011 16:33, Ertugrul Soeylemez e...@ertes.de wrote: It should be fixed now. Thanks for your report! Fixed indeed. Thanks. Ozgur ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org

[Haskell-cafe] Is SmallCheck maintained?

2011-11-14 Thread Roman Cheplyaka
Hi Cafe, Does anyone currently work on Test.SmallCheck? I see the following problems: 1. SC doesn't have a repository, issue tracker etc. 2. It is not integrated with popular test frameworks 3. API should be better documented I'm willing to work on the above problems, but wanted to check first

Re: [Haskell-cafe] Can't establish subprocess communication

2011-11-14 Thread Poprádi Árpád
Hi mgampkay! Thank You, these were the problems with my programs. Greetings, Árpád On Sun, 2011-11-13 at 22:57 +0800, mgampkay wrote: (hin, hout, _, p) - runInteractiveProcess copierer [] Nothing ./twowaysubprocesscomm twowaysubprocesscomm: fd:7: hGetLine: end of file

[Haskell-cafe] [Announcement] New release of SBV (0.9.22)

2011-11-14 Thread Levent Erkok
New release of SBV (0.9.22) is out: http://hackage.haskell.org/package/sbv Major changes in this release are: - Support for explicit quantification (including alternating existentials and universals) - Ability to use Microsoft's Z3 SMT solver (in addition to Yices). Full release notes: