- Haskell-Cafe - Haskell.org

HDBC converting a date sql value to UTCTime
by George Moschovitis 21 Jun '08

21 Jun '08

Hello, I am HDBC with the Postgres driver. I am trying to read a simple date column from the DB: stmt <- DB.prepare conn "SELECT date FROM my_table ORDER BY date DESC LIMIT 1" DB.execute stmt [] DB.commit conn rows <- fetchAllRows' stmt let ((d:_):_) = rows the d variable is of type: SqlEpochTime 1213736400 I am wondering how to convert this value to an UTCTime value. Any help appreciated (I am a newbie). -g. -- http://gmosx.me.gr http://joy.gr http://cull.gr http://nitroproject.org http://phidz.com http://joyerz.com

2 2

What's wrong with the classes/insances?
by Pieter Laeremans 20 Jun '08

20 Jun '08

HI, What 's wrong with this: type Id = String class Catalog a where listItems :: a -> IO [String] getItem :: a -> Id -> IO (Maybe String) class Item a where getCatalog :: Catalog catalog => a -> catalog data Catalog c => Content c = Content {auteur :: String, inhoud:: String, catalog::c} instance Catalog c => Item (Content c) where getCatalog (Content _ _ c) = c I get this as error from ghci: Couldn't match expected type `catalog' against inferred type `c' `catalog' is a rigid type variable bound by the type signature for `getCatalog' at ../Sites/liberaleswebsite/www.liberales.be/cgi-bin/Test.hs:16:26 `c' is a rigid type variable bound by the instance declaration at ../Sites/liberaleswebsite/www.liberales.be/cgi-bin/Test.hs:20:17 In the expression: c In the definition of `getCatalog': getCatalog (Content _ _ c) = c In the definition for method `getCatalog' Failed, modules loaded: none. thanks in advance, P -- Pieter Laeremans <pieter(a)laeremans.org> "The future is here. It's just not evenly distributed yet." W. Gibson

6 6

Wrapping FTGL in FFI calls
by Jefferson Heard 20 Jun '08

20 Jun '08

I've been looking for awhile now for a simple way to get truetype fonts into my visualizations so I can abandon the hideous GLUT fonts and make things that look like they were developed in the 1990s instead of back in the days of TRON. I found FTGL, but I'm mostly a Haskell developer these days, and resent having to go back to C just to write a simple application. So I was wondering if anyone had ever wrapped the FTGL library in Haskel FFI or whether those out there who are experts on the FFI think at first glance it should be readily wrappable by a rank amateur at FFI such as myself. http://ftgl.sourceforge.net/docs/html/ -- Jeff

4 7

Haddock compilation problem
by Ronald Guida 20 Jun '08

20 Jun '08

I just upgraded to ghc-6.8.3, using a linux binary, and I am having a problem compiling Haddock. Haddock 2.1.0 and Haddock 2.0.0.0 both fail to build under ghc-6.8.3, but they both build successfully with ghc-6.8.2. I don't know if this is a Haddock problem, or a GHC problem, or perhaps something else entirely? Here is the error I'm getting. It is the same error for either version of Haddock. [15 of 24] Compiling Haddock.GHC.Typecheck ( src/Haddock/GHC/Typecheck.hs, dist/build/haddock/haddock-tmp/Haddock/GHC/Typecheck.o ) src/Haddock/GHC/Typecheck.hs:82:4: Constructor `HsModule' should have 7 arguments, but has been given 8 In the pattern: HsModule _ _ _ _ _ mbOpts _ _ In a pattern binding: HsModule _ _ _ _ _ mbOpts _ _ = unLoc parsed In the definition of `mkGhcModule': mkGhcModule (mod, file, checkedMod) dynflags = GhcModule {ghcModule = mod, ghcFilename = file, ghcMbDocOpts = mbOpts, ghcHaddockModInfo = info, ghcMbDoc = mbDoc, ghcGroup = group, ghcMbExports = mbExports, ghcExportedNames = modInfoExports modInfo, ghcNamesInScope = fromJust $ modInfoTopLevelScope modInfo, ghcInstances = modInfoInstances modInfo} where HsModule _ _ _ _ _ mbOpts _ _ = unLoc parsed (group, _, mbExports, mbDoc, info) = renamed (parsed, renamed, _, modInfo) = checkedMod

3 4

Checking packages before upload to Hackage
by Henning Thielemann 20 Jun '08

20 Jun '08

Is there some command which tests a tar.gz created by 'Setup.lhs sdist' by unpacking the archive to say /tmp and compiling and documenting the sources? Hackage should recommend this tool before package upload.

3 2

Quantitative Trading Developer Position at Hutchin Hill Capital
by Neil Mehra 20 Jun '08

20 Jun '08

Job Description: Quantitative Trading Developer Description: * Newly formed multi-strategy hedge fund, Hutchin Hill Capital, located in midtown Manhattan, seeks a Quantitative Trading Developer; * Focus on building infrastructure, applications, and technical support for quantitative equity trading business; * Candidate should have demonstrated interest or passion for functional programming-with experience using Haskell, F#, Kdb+/q, OCaml, ML, and related technologies; * Position reports directly to portfolio manager, and will work closely with other technology and research professionals. Responsibilities Include: * Developing data management, quant research, and analytical tools for model-driven equity trading strategies; * Building production environment for real-time content capture, trade generation, and risk management; * Deploying equity trading technology, methods, and protocols, including electronic execution algorithms and market impact analysis; * Conducting quantitative portfolio research using cutting-edge tools and techniques. Required Experience/Education: * 2 - 5 years in IT development or quantitative analytics; * Advanced degree or equivalent experience in a technical field such as computer science, mathematics, physics, or engineering; Other Requirements: * Exceptional technical and analytical problem-solving; * Desire to master the latest technology, hardware, and quantitative methods; * Willingness to work in a fast-paced, high pressure environment; * Team-oriented and highly resourceful; * Entrepreneurial drive. Please contact quant2(a)hutchinhill.com<mailto:quant2@hutchinhill.com> with resume if interested. __________ This communication, including any attachment(s), may contain confidential and/or privileged information. If you are not the intended recipient or have received this communication in error, please destroy/delete this email and any attachments. We do not waive confidentiality or privilege by mistransmission. This communication does not constitute an offer of employment, or an offer, or the solicitation of an offer, to buy or sell any security or investment advisory services, and is not an official confirmation of any transaction.

1 0

This is a bug?
by Samuel Silva 20 Jun '08

20 Jun '08

Hello I'm using HaXml library to handle XML. How I solve this issue when call "readXml": >in <score-partwise>, In a sequence: > in <part>, In a sequence: > in <measure>, Too many elements inside <measure> at > file ../../../parsers/elite2.xml at line 75 col 15 > Found excess: > > >Done. I don't understood this error. I'm using HaXml-1.19.4 with GHC-6.8.2 -- Don't hug that, Hugs ME! Samuel Silva

2 1

Re: (Lazy) SmallCheck and peano numbers
by Levi Stephen 20 Jun '08

20 Jun '08

On Fri, Jun 20, 2008 at 3:30 AM, Benedikt Huber <benjovi(a)gmx.net> wrote: > Levi Stephen schrieb: >> >> Hi, >> >> I have the following definitions >> >> type Zero >> type Succ a >> >> so that I can muck around with a Vector type that includes its length >> encoded in its type. >> >> I was wondering whether it was possible to use SmallCheck (or >> QuickCheck) to generate random Peano numbers? Is there an issue here >> in that what I actually want to generate is a type rather than a >> value? >> >> I do have >> >> reifyInt :: Int -> (forall a. ReflectNum a => a -> b) -> b >> >> but, I'm not sure if this can help me when I need to generate other >> values based upon that type (e.g., two vectors with the same size >> type) > > Hi Levi, > > For QuickCheck, I know it is possible as long as you do not need to use type > level functions in your tests. For example, using Alfonso's type-level and > parametrized-data packages, one can write: > >> instance (Nat n, Arbitrary a) => Arbitrary (FSVec n a) where >> arbitrary = >> liftM (unsafeVector (undefined :: n)) $ >> mapM (const arbitrary) [1..toInt (undefined :: n)] > >> propLength :: forall n a. (Nat n) => FSVec n Integer -> Bool >> propLength (FSVec xs) = P.length xs == toInt (undefined :: n) > >> propLengthEqual :: forall n a. (Nat n) => >> FSVec n Integer -> FSVec n Integer -> Bool >> propLengthEqual v1 v2 = length v1 == length v2 > >> tests1 = forM_ [0..100] $ \n -> reifyIntegral n $ \(t :: ty) -> >> quickCheck (propLength :: FSVec ty Integer -> Bool) >> tests2 = forM_ [0..100] $ \n -> reifyIntegral n $ \(t :: ty) -> >> quickCheck (uncurry propLengthEqual :: >> (FSVec ty Integer,FSVec ty Integer) -> Bool) Thanks for the example code. Ideally it would be great to have n generated also. Any thoughts on whether something like propLengthEqual :: forall n a. (Nat n) => n -> FSVec n Integer -> FSVec n Integer -> Bool propLengthEqual _ v1 v 2 = length v1 == length v2 with an arbitrary instance for generate all Nat n's is possible? Is something like instance (forall n. Nat n) => Arbitrary n possible/legal haskell? and would it for the above test? > > best regards, > > benedikt > Thanks, Levi

2 1

Meaning of "ribbonsPerLine" at Text.PrettyPrint.HughesPJ ?
by Alfonso Acosta 20 Jun '08

20 Jun '08

Hi, Can anyone give a good explanation of what ribbonsPerLine means? Maybe it would be better to simply ask for the meaning of ribbon in this context. The documentation is totally meaningless to me: "reibbonsPerLine: Ratio of ribbon length to line length". I asked at #haskell and frankly, I was surprised by the answer: fons: can anyone tell me what the heck does ribbonsPerLine mean in Text.PrettyPrint.HughesPJ? fons: > renderStyle style{lineLength=10, ribbonsPerLine=1} $ sep [text "foo" ,text "bar"] lambdabot: "foo bar" fons: > renderStyle style{lineLength=10, ribbonsPerLine=2} $ sep [text "foo" ,text "bar"] lambdabot: "foo\nbar" fons: ok, somehow it affects the line width ... byorgey: fons: I can't explain it, all I know is that you must set it to 1 or else it does bizarre things fons: hahah, ok fons: byorgey: that's funny considering its default value is 1.5 byorgey: if you set it to 1 then lineLength means what you think it should byorgey: fons: EXACTLY Cheers, Fons

7 7

Re: (Lazy) SmallCheck and peano numbers
by Levi Stephen 20 Jun '08

20 Jun '08

> If so, you could write a SmallCheck Series instance as follows. > > instance Serial (Vec Zero a) where > series = cons0 nil > > instance (Serial a, Serial (Vec n a)) => Serial (Vec (Succ n) a) where > series = cons2 (|>) > If we have the property > > prop_vector :: Vec (Succ (Succ Zero)) Bool -> Bool > prop_vector (V xs) = xs == xs > > we can check it, and only 2 element vectors will be tested I have some code up now at http://hpaste.org/8420 It looks pretty much like what you've written above and is what I am doing for the moment, but for various size vectors from zero to four. > Now, it seems what you really want to do is define polymorphic > properties like > > prop_poly :: Vec n Bool -> Vec n Bool -> Bool > > and have SmallCheck check all equal-sized vectors. If so, good > question! :-) Yep, this would be exactly what I'm after. Thanks for a better write up and background on what I'm after than I gave :) I'm thinking the property might be written as prop_poly:: size -> Vec size Bool -> Vec size Bool -> Bool, so that the size is generated randomly and the types take care of ensuring the vectors generated are of the same size. Levi

1 0