Re: [Haskell-cafe] Problem with Haddock

2005-03-08 Thread ross
On Tue, Mar 08, 2005 at 11:22:10PM +0100, Daniel Fischer wrote: > Am Dienstag, 8. März 2005 17:12 schrieben Sie: > > On Tue, Mar 08, 2005 at 04:25:49PM +0100, Daniel Fischer wrote: > > > Furthermore, in the documentation of ghc-6.4.2005..., > > > only four modules from base/GHC are included, in the

Re: [Haskell-cafe] Problem with Haddock

2005-03-08 Thread Daniel Fischer
Am Dienstag, 8. März 2005 17:12 schrieben Sie: > On Tue, Mar 08, 2005 at 04:25:49PM +0100, Daniel Fischer wrote: > > Furthermore, in the documentation of ghc-6.4.2005..., > > only four modules from base/GHC are included, in the documentation for > > ghc-6.2.2 there were 29. In particular, the absen

Re: [Haskell-cafe] Joy Combinators (Occurs check: infinite type)

2005-03-08 Thread Greg Buchholz
Keean Schupke wrote: > I dont see why this is illegal... what do we want? take the top two > items from the stack? With the code below (direct translation from tuples to HLists) I still get an occurs check error when trying to define fact5... Compiling Main ( joy3.hs, interprete

Re: [Haskell-cafe] Joy Combinators (Occurs check: infinite type)

2005-03-08 Thread Daniel Fischer
Am Dienstag, 8. März 2005 17:31 schrieben Sie: > Daniel Fischer wrote: > >The problem is that for the recursion combinators we need polymorphic > >recursion functions. > >For fact3 we need > >rec2 :: forall l. (HCons a (HCons a l) -> HCons a l), > > I dont see why this is illegal... what do we want

RE: [Haskell-cafe] Problem with Haddock

2005-03-08 Thread Simon Marlow
On 08 March 2005 15:26, Daniel Fischer wrote: > I have the problem that I can't haddock literate modules > (latex-style), >> haddock -h -o docs Test.lhs > Test.lhs:1:1: Parse error > > the file begins with "\begin{code}". > > Does anybody know what's up and what to do about it? Haddock doesn't

Re: [Haskell-cafe] Joy Combinators (Occurs check: infinite type)

2005-03-08 Thread Keean Schupke
Daniel Fischer wrote: The problem is that for the recursion combinators we need polymorphic recursion functions. For fact3 we need rec2 :: forall l. (HCons a (HCons a l) -> HCons a l), I dont see why this is illegal... what do we want? take the top two items from the stack? Take the to N ele

Re: [Haskell-cafe] Problem with Haddock

2005-03-08 Thread Ross Paterson
On Tue, Mar 08, 2005 at 04:25:49PM +0100, Daniel Fischer wrote: > Furthermore, in the documentation of ghc-6.4.2005..., > only four modules from base/GHC are included, in the documentation for > ghc-6.2.2 there were 29. In particular, the absence of GHC.List, GHC.Show and > GHC.Read is extremely

[Haskell-cafe] Problem with Haddock

2005-03-08 Thread Daniel Fischer
Hi, I have the problem that I can't haddock literate modules (latex-style), > haddock -h -o docs Test.lhs Test.lhs:1:1: Parse error the file begins with "\begin{code}". Does anybody know what's up and what to do about it? Furthermore, in the documentation of ghc-6.4.2005..., only four modules f

Re: [Haskell-cafe] Joy Combinators (Occurs check: infinite type)

2005-03-08 Thread Daniel Fischer
Keean Schupke wrote: > Daniel Fischer wrote: > >And, BTW, that's why Keean et al's HList library doesn't help here either, > > the type of an HList determines the number of elements and the type of > > each, so there we face the same problems as with nested tuples. What we > > need is type Stack =