2009/1/23 Galchin, Vasili vigalc...@gmail.com
Hello,
Real World Haskell seems to say that the abstraction layer HDBC
doesn't support MySQL. If so, in what sense doesn't HDBC support
MySQL??
It doesn't have a MySQL backend. However, it does have an ODBC backend
which should work fine
On 2009 Jan 21, at 21:13, Thomas DuBuisson wrote:
ioctl(3, SNDCTL_TMR_TIMEBASE or TCGETS, 0x77470b70) = -1 ENOTTY
(Inappropriate ioctl for device)
This is just the test for buffering: terminal-like devices (TCGETS)
are line buffered, others are block buffered.
select(4, [3], [],
On Fri, 2009-01-23 at 16:19 +1100, Toby Hutton wrote:
On Fri, Jan 23, 2009 at 11:56 AM, Jonathan Cast
jonathancc...@fastmail.fm wrote:
Not really. My company *advertises* for Haskell developers, and then
when they come in to interview, informs them that the code base is
actually
On 2009 Jan 22, at 10:09, Andrew Wagner wrote:
See, that's the kind of name we need!
StructureWithAssociativeOperationAndIdentity -- make both the
mathematicians AND the non-mathematicians mad!
SimpleArithmetic (you have numbers and a single arithmetic
operation on them). You can play
Yesterday, I downloaded Darcs 2.2 and Liskell for Windows XP
Professional, Service Pack 2, but the following error message appeared
when I ran ./Setup.lhs configure in Cygwin:
Configuring liskell-0.1...
Setup.lhs: At least the following dependencies are missing:
ghc-paths -any
Does anybody know
On Fri, 23 Jan 2009 18:10:16 +0900, Benjamin L.Russell
dekudekup...@yahoo.com wrote:
Yesterday, I downloaded Darcs 2.2 and Liskell for Windows XP
Professional, Service Pack 2, but the following error message appeared
when I ran ./Setup.lhs configure in Cygwin:
Configuring liskell-0.1...
On Fri, 2009-01-23 at 08:06 +, Sebastian Sylvan wrote:
2009/1/23 Galchin, Vasili vigalc...@gmail.com
Hello,
Real World Haskell seems to say that the abstraction
layer HDBC doesn't support MySQL. If so, in what sense doesn't
HDBC support
Hi Benjamin,
Try:
cabal install ghc-paths
If you want to install packages manually you can also get it from
http://hackage.haskell.org
Thanks
Neil
On Fri, Jan 23, 2009 at 9:16 AM, Benjamin L. Russell
dekudekup...@yahoo.com wrote:
On Fri, 23 Jan 2009 18:10:16 +0900, Benjamin L.Russell
Sebastian == Sebastian Sylvan syl...@student.chalmers.se writes:
Sebastian It doesn't have a MySQL backend. However, it does have an
Sebastian ODBC backend which should work fine with MySQL.
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HDBC-mysql
Sincerely,
Gour
--
Gour |
2009/1/23 Ertugrul Soeylemez e...@ertes.de:
Luke Palmer lrpal...@gmail.com wrote:
On Thu, Jan 22, 2009 at 9:04 AM, Ertugrul Soeylemez e...@ertes.de wrote:
Sometimes this is inevitable, but I've never seen a case, where
IORefs couldn't be replaced by a more elegant State/StateT-based
ok .. thank you.
Vasili
On Fri, Jan 23, 2009 at 3:23 AM, Duncan Coutts
duncan.cou...@worc.ox.ac.ukwrote:
On Fri, 2009-01-23 at 08:06 +, Sebastian Sylvan wrote:
2009/1/23 Galchin, Vasili vigalc...@gmail.com
Hello,
Real World Haskell seems to say that the
On Thu, Jan 22, 2009 at 04:57:56PM -0800, Jonathan Cast wrote:
On Tue, 2009-01-20 at 19:14 +, Andrew Coppin wrote:
Jonathan Cast wrote:
On Mon, 2009-01-19 at 21:04 +, Andrew Coppin wrote:
I mean, heck, *I* use Haskell at work - and I'm not even supposed to be
coding things!
Daryoush Mehrtash dmehrt...@gmail.com wrote:
I am trying to figure out if there is a way to model cloud computing
computations in Haskell.
My specific problems is that in cloud computing, as in Amazon
WebServices, side effects (writes to storage, simple database, queue)
follow the
Hi folks,
I've been thinking today that I frequently need to convert data beween
types:
* Between various numeric types
* Between various calendar types (both within the new calendar
system, and between the old and new)
* Marshalling data back and forth to a database in HDBC
It's hard
On Fri, Jan 23, 2009 at 3:01 PM, John Goerzen jgoer...@complete.org wrote:
Hi folks,
I've been thinking today that I frequently need to convert data beween
types:
* Between various numeric types
* Between various calendar types (both within the new calendar
system, and between the old
Eugene Kirpichov ekirpic...@gmail.com wrote:
daemon :: IO () - IO (IO ())
daemon action = do
stopvar - newIORef False
let run = do
stop - readIORef stopvar
if stop then return () else (action run)
forkIO run
return (writeIORef stopvar True)
Magnus Therning wrote:
On Fri, Jan 23, 2009 at 3:01 PM, John Goerzen jgoer...@complete.org wrote:
Hi folks,
I've been thinking today that I frequently need to convert data beween
types:
* Between various numeric types
* Between various calendar types (both within the new calendar
On Jan 23, 2009, at 1:23 AM, Duncan Coutts wrote:
On Fri, 2009-01-23 at 08:06 +, Sebastian Sylvan wrote:
2009/1/23 Galchin, Vasili vigalc...@gmail.com
Hello,
Real World Haskell seems to say that the abstraction
layer HDBC doesn't support MySQL. If so, in what
Ertugrul Soeylemez wrote:
And to prove that IORefs do lead to a pointer race condition and hence
are insecure, try the following code:
main :: IO ()
main = do
ref - newIORef False
forkIO $ forever $ modifyIORef ref not
forever $ readIORef ref = print
It crashes for me. I'm
looks like a neath editor. too bad on windows you don't get anti aliased
fonts (I guess it uses an old J2SE or something?)
at first sight I was not able to find Haskell support in the freely
downloadable version. is this available in the commercial version?
On Thu, Jan 22, 2009 at 6:50 PM, John
No, Haskell support in the free version too. However, you'll have to
add the tools to compile .hs files in the Tools menu. You can pipe
the output to directly highlight errors/warnings in the document
(which is what's done in the screenshot below), because the editor
understands what GHC
On Fri, 2009-01-23 at 03:54 -0600, Galchin, Vasili wrote:
On Fri, Jan 23, 2009 at 3:23 AM, Duncan Coutts
duncan.cou...@worc.ox.ac.uk wrote:
This was uploaded to hackage yesterday:
I always considered the monad functions with names ending on '_' a
concession to the IO monad. Would you need them for any other monad than
IO? For self-written monads you would certainly use a monoid instead of
monadic action, all returning (), but IO is a monad. (You could however
wrap
On 23 Jan 2009, at 21:50, Henning Thielemann wrote:
I always considered the monad functions with names ending on '_' a
concession to the IO monad. Would you need them for any other monad
than IO? For self-written monads you would certainly use a monoid
instead of monadic action, all
Novice question here. Sorry if the post is wordy.
In the following code (which doesn't actually compile as-is), I'm trying
to generalize these 'make*Filter' functions into a single 'makeFilter'
function. However, I can't get the types to work right.
Foo is a tuple type on which a large number of
On Fri, 2009-01-23 at 03:54 -0600, Galchin, Vasili wrote:
ooops ... cabal install HDBC-mysql doesn't work ??
for what it's worth, calbal install hdbc-mysql worked on my office's pc.
( kubuntu 8.10 )
___
Haskell-Cafe mailing list
Hi,
Am Freitag, den 23.01.2009, 21:50 +0100 schrieb Henning Thielemann:
However our recent Monoid discussion made me think about mapM_,
sequence_, and friends. I think they could be useful for many monads if
they would have the type:
mapM_ :: (Monoid b) = (a - m b) - [a] - m b
I
On Monday 19 January 2009 23:26:09 Sittampalam, Ganesh wrote:
We (Credit Suisse) have Haskell developers in both London and NY,
although the page only listed NY (I've now corrected it).
If CS had Haskell positions in Wroclaw, Poland I'd apply for it!
Best,
Bartek
On Friday 23 January 2009 3:50:18 pm Henning Thielemann wrote:
I always considered the monad functions with names ending on '_' a
concession to the IO monad. Would you need them for any other monad than
IO? For self-written monads you would certainly use a monoid instead of
monadic action,
On Fri, 2009-01-23 at 21:30 +, Joachim Breitner wrote:
Hi,
Am Freitag, den 23.01.2009, 21:50 +0100 schrieb Henning Thielemann:
However our recent Monoid discussion made me think about mapM_,
sequence_, and friends. I think they could be useful for many monads if
they would have
Hello Haskellers!
It's probably a simple question but I can't find a proper solution...
Suppose we have a class Vector which overloads (+) operation. I'd like to
represent a Matrix data type as a set of vectors:
data Matrix3 = M3 !Vector3 !Vector3 !Vector3
In this case (+) for matrices could be
There are quite a few people with working Haskell knowledge in Wroclaw. I'm
sure many of my colleagues (from University of Wroclaw:
http://www.ii.uni.wroc.pl/ http://www.ii.uni.wroc.pl/cms/)
know Haskell and I think would enjoy working with it.
All best
Christopher Skrzętnicki
On Fri, Jan 23,
Seems like all telepath are on vacation, so you would have to show the
code.
On 24 Jan 2009, at 01:15, Olex P wrote:
Hello Haskellers!
It's probably a simple question but I can't find a proper solution...
Suppose we have a class Vector which overloads (+) operation. I'd
like to represent a
On Sat, 2009-01-24 at 01:30 +0300, Miguel Mitrofanov wrote:
Seems like all telepath are on vacation,
Now, now, you didn't let enough time elapse to know that for sure.
jcc
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
makeFilter :: (b - b - Bool) - (a - b) - b - a - Bool
makeFilter (==) proj expected = (expected ==) . proj
makeEqFilter :: Eq b = (a - b) - b - a - Bool
makeEqFilter = makeFilter (==)
Then you have a foo:
data Foo = Foo { fooA :: String, fooB :: Int }
foos = [Foo a 1, Foo b 2]
filter
On 24 Jan 2009, at 01:35, Jonathan Cast wrote:
On Sat, 2009-01-24 at 01:30 +0300, Miguel Mitrofanov wrote:
Seems like all telepath are on vacation,
Now, now, you didn't let enough time elapse to know that for sure.
They're always on vacation when you need one.
2009/1/23 Olex P hoknam...@gmail.com
Hello Haskellers!
It's probably a simple question but I can't find a proper solution...
Suppose we have a class Vector which overloads (+) operation. I'd like to
represent a Matrix data type as a set of vectors:
data Matrix3 = M3 !Vector3 !Vector3
Well if telepaths on vacation...
class Vector v where
(^+^) :: v - v - v
data Vector3 = V3 !Double !Double !Double
instance Vector Vector3 where
(V3 x1 y1 z1) ^+^ (V3 x2 y2 z2) = V3 (x1 + x2) (y1 + y2) (z1 + z2)
class Matrix m where
(^+^) :: m - m - m
data Matrix3 = M3
2009/1/23 Olex P hoknam...@gmail.com:
Well if telepaths on vacation...
class Vector v where
(^+^) :: v - v - v
data Vector3 = V3 !Double !Double !Double
instance Vector Vector3 where
(V3 x1 y1 z1) ^+^ (V3 x2 y2 z2) = V3 (x1 + x2) (y1 + y2) (z1 + z2)
class Matrix m where
2009/1/23 Olex P hoknam...@gmail.com:
class Vector v where
(^+^) :: v - v - v
data Vector3 = V3 !Double !Double !Double
instance Vector Vector3 where
(V3 x1 y1 z1) ^+^ (V3 x2 y2 z2) = V3 (x1 + x2) (y1 + y2) (z1 + z2)
class Matrix m where
(^+^) :: m - m - m
data
On Fri, 2009-01-23 at 13:39 -0800, George Pollard wrote:
On Fri, 2009-01-23 at 21:30 +, Joachim Breitner wrote:
Hi,
Am Freitag, den 23.01.2009, 21:50 +0100 schrieb Henning Thielemann:
However our recent Monoid discussion made me think about mapM_,
sequence_, and friends. I
2009/1/24 Dan Piponi dpip...@gmail.com:
2009/1/23 Olex P hoknam...@gmail.com:
class Vector v where
(^+^) :: v - v - v
data Vector3 = V3 !Double !Double !Double
instance Vector Vector3 where
(V3 x1 y1 z1) ^+^ (V3 x2 y2 z2) = V3 (x1 + x2) (y1 + y2) (z1 + z2)
class Matrix m
On Fri, 2009-01-23 at 22:58 +, Olex P wrote:
Well if telepaths on vacation...
class Vector v where
(^+^) :: v - v - v
data Vector3 = V3 !Double !Double !Double
instance Vector Vector3 where
(V3 x1 y1 z1) ^+^ (V3 x2 y2 z2) = V3 (x1 + x2) (y1 + y2) (z1 + z2)
class
On Fri, 23 Jan 2009, Derek Elkins wrote:
mempty `mappend` undefined = undefined (left identity monoid law)
The above definition doesn't meet this, similarly for the right identity
monoid law. That only leaves one definition, () `mappend` () = () which
does indeed satisfy the monoid laws.
So
* Alex Ott alex...@gmail.com [2009-01-22 20:32:26 +0100]:
PUT http://127.0.0.1:5984/test1/Users_ott_tmp_1_tst HTTP/1.1
Content-Type: ...
...
Host: 127.0.0.1:5984
...
Note that this is a valid HTTP request, according to my reading of RFC2616.
--
mithrandi, i Ainil en-Balandor, a faer
On Fri, Jan 23, 2009 at 6:10 PM, rocon...@theorem.ca wrote:
On Fri, 23 Jan 2009, Derek Elkins wrote:
mempty `mappend` undefined = undefined (left identity monoid law)
The above definition doesn't meet this, similarly for the right identity
monoid law. That only leaves one definition, ()
Provided all the overlapping instances are supplied together, as you suggest, I
think what you say makes perfect sense and does not threaten soundness.
But we have not yet implemented the idea yet. First priority is to get type
families working properly, and in conjunction with type classes.
Of course. I was just wondering if anyone was looking into the
implications of said features :)
For example, with this instance, if a is a type variable, you can't
reduce IsFunction a to HFalse, because a might be b - c for
some b, c.
Whereas in the current formulation, you can treat the
On Sat, 24 Jan 2009 14:18:24 Tristan Seligmann wrote:
* Alex Ott alex...@gmail.com [2009-01-22 20:32:26 +0100]:
PUT http://127.0.0.1:5984/test1/Users_ott_tmp_1_tst HTTP/1.1
Content-Type: ...
...
Host: 127.0.0.1:5984
...
Note that this is a valid HTTP request, according to my reading
Would this then also eventually work?
data Zero
data Succ a = Succ a
type family IsFunction f
type instances
IsFunction (a - b) = Succ (IsFunction b)
IsFunction c= Zero
Simon Peyton-Jones wrote:
Provided all the overlapping instances are supplied together, as you suggest, I
Thanks for letting me reflect on this.
I assume that my final program (my final value) is always a total value.
Anything else is an error. Therefore, if we required relaxed monoid laws
of the form
x `mappend` mzero = x
then we could safely substitute (x `mappend` mzero) by x without
Thanks, that does help. I see I was unnecessarily passing a function
parameter (as a newcomer to Haskell, I tend to forget how to properly
use composition).
The reason to do these maneuvers is that the particular accessor
function to use is being parsed from user input. The main problem is
along
On 2009 Jan 22, at 1:36, Belka wrote:
Could somebody please share some experience on how to implement
daemon start
and stop directives. In theory I need something like this:
1. my_daemon start - starts my app with an infinite loop of serving
inside.
2. my_daemon stop - puts in some TVar a
On 2009 Jan 22, at 3:11, Belka wrote:
Actually, I'm more interested in technical details how to
communicate from
shell with background process - how to send commands to it. Currently
looking into POSIX libraries hope to find answers there...
Also, maybe a FIFO-pipe-file would solve my problem.
Parsec is an awesome piece of software. Throw away anything you might
know from writing parsers in something else -- writing parsers with
parsec is so succinct you can use it most anytime without feeling like
you're resorting to it.
-Ross
On Jan 23, 2009, at 11:26 PM, Dominic Espinosa
On 2009 Jan 23, at 17:58, Olex P wrote:
class Vector v where
(^+^) :: v - v - v
class Matrix m where
(^+^) :: m - m - m
You can't reuse the same operator in different classes. Vector
owns (^+^), so Matrix can't use it itself. You could say
instance Matrix m = Vector m
2009/1/23 Brandon S. Allbery KF8NH allb...@ece.cmu.edu
On 2009 Jan 23, at 17:58, Olex P wrote:
class Vector v where
(^+^) :: v - v - v
class Matrix m where
(^+^) :: m - m - m
You can't reuse the same operator in different classes. Vector owns
(^+^), so Matrix can't
On 24 Jan 2009, at 02:33, Luke Palmer wrote:
On Fri, Jan 23, 2009 at 6:10 PM, rocon...@theorem.ca wrote:
On Fri, 23 Jan 2009, Derek Elkins wrote:
mempty `mappend` undefined = undefined (left identity monoid law)
The above definition doesn't meet this, similarly for the right
identity
monoid
58 matches
Mail list logo
