[Haskell-cafe] Using tiny (atomic) mutables between multiple threads

readMyVar and writeMyVar really atomic? Or are they atomic only if I apply them to MyVar Word8 type? 3. Are the above readMyVar and writeMyVar safe against asynchronous exceptions? Or again, only if I use MyVar Word8 type? Belka -- View this message in context: http://www.nabble.com/Using-tiny

Re: [Haskell-cafe] Using tiny (atomic) mutables between multiple threads

again! Belka -- View this message in context: http://www.nabble.com/Using-tiny-%28atomic%29-mutables-between-multiple-threads-tp25420972p25430039.html Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com. ___ Haskell-Cafe mailing list

Re: [Haskell-cafe] Seeking for an extention (functional incapsulation)

Exponentially? Now I'm missing something... I meant: in as-is version you have 3 declarations (data, sdtField2 :: ..., sdtField2 = ...), but in a proposed one - only one, with subdeclarations. My perception is more oriented on that compositional criterion, than calculates char counts. Besides,

Re: [Haskell-cafe] Seeking for an extention (functional incapsulation)

Belka wrote: Exponentially? Now I'm missing something... I meant: in as-is version you have 3 declarations (data, sdtField2 :: ..., sdtField2 = ...), but in a proposed one - only one, with subdeclarations. My perception is more oriented on that compositional criterion, than calculates

[Haskell-cafe] Seeking for an extention (functional incapsulation)

y - f x * f y), but opposite - I called it under. t `under` f = \x y - (x f) `t` (y f) 2. currying and uncurrying Is there any such extension? Belka -- View this message in context: http://www.nabble.com/Seeking-for-an-extention-%28functional-incapsulation%29-tp24856249p24856249.html Sent from

Re: [Haskell-cafe] Seeking for an extention (functional incapsulation)

practice. Belka -- View this message in context: http://www.nabble.com/Seeking-for-an-extention-%28functional-incapsulation%29-tp24856249p24856983.html Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com. ___ Haskell-Cafe mailing

[Haskell-cafe] typeclasses comprehension problems: situation classes?

is the last one to make... I'd rather belive, that there is something I'm not aware of (for a considerably long time already) in Haskell. A lack of some programming technique Please, Help! Regards, Belka ==TRY=1===DOESN'T=COMPILE== {-# LANGUAGE

[Haskell-cafe] Classes: functional dependency (type - value)

Right key_set - return $ Right (assumption, key_set) - Best regards, Belka -- View this message in context: http://www.nabble.com/Classes%3A-functional-dependency-%28type--%3E-value%29-tp23470077p23470077.html Sent from

Re: [Haskell-cafe] using haskell for a project

{...} new_spell = Spell { } Have luck, with the brain rewriting! =) Belka -- View this message in context: http://www.nabble.com/using-haskell-for-a-project-tp23348425p23352598.html Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com

Re: [Haskell-cafe] [tryReadAdvChan :: AdvChan a - IO (Maybe a)] problems

. The FlowUnit diversifies to real bizness data, and service data. That way I now may gain control over blocking But this solution is not simple and lightweight. If anybody is interested, I could describe the concept in more details. Belka Neil Davies-2 wrote: Belka You've described

[Haskell-cafe] [tryReadAdvChan :: AdvChan a - IO (Maybe a)] problems

synchronous-channels package there (http://hackage.haskell.org/cgi-bin/hackage-scripts/package/synchronous-channels), but it isn't any further in solving my the unbalacedness problems. Any suggestions on the fresh matter are welcome. Belka. -- View this message in context: http://www.nabble.com

Re: [Haskell-cafe] controlling timeout for Network.Socket.connect - how?

/kqueue). Thanks, now I'm confident, that am on the right way! ^__^ I wonder, if *select* really blocks the whole process... or blocks just the green thread, that called it?.. It doesn't depend from being safe/unsafe FFI-ed, does it? Belka -- View this message in context: http://www.nabble.com

Re: [Haskell-cafe] controlling timeout for Network.Socket.connect - how?

/kqueue). Thanks, now I'm confident, that am on the right way! ^__^ I wonder, if *select* really blocks the whole process... or blocks just the green thread, that called it?.. It doesn't depend from being safe/unsafe FFI-ed, does it? Belka -- View this message in context: http://www.nabble.com

Re: [Haskell-cafe] controlling timeout for Network.Socket.connect - how?

It's hard to belive, that nobody ever tackled/solved the subj. problem. I still can delay a bit solving it, in hope somebody would share experience. Regards, Belka Belka wrote: Hello, communion people! I have a problem and ask for an advice. I'm dealing with sockets on *Linux

[Haskell-cafe] controlling timeout for Network.Socket.connect - how?

these low-level functions __ Could anybody, please share some experience on how to adjust timeout for *connect*? Thanks in advance, Best regards, Belka -- View this message in context: http://www.nabble.com/controlling-timeout-for-Network.Socket.connect---how--tp22139581p22139581.html Sent

[Haskell-cafe] estimating the speed of operation

on something else?.. For now I can only guess. Could anybody, please clarify and maybe suggest configuration, which would allow objective speed estimation? Thanks in advance, Best regards, Belka -- View this message in context: http://www.nabble.com/estimating-the-speed-of-operation-tp22075843p22075843

Re: [Haskell-cafe] estimating the speed of operation

about the second string. I still wonder if (and how) GHC optimizes the process. Belka -- View this message in context: http://www.nabble.com/estimating-the-speed-of-operation-tp22075843p22078560.html Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com

Re: Re[Haskell-cafe] cursive referencing

somedata2 $ fst p)) and my mod (added some_very_expensive_f) fix (\p - (AA (some_very_expensive_f somedata1) $ snd p, BB (some_very_expensive_f somedata2) $ fst p)) 2. Does the sumAA evaluates this some_very_expensive_f every iteration of recursion, or is it evaluated only once? Belka

Re: Re[Haskell-cafe] cursive referencing

) (\ a - BB somedata2 a) ) But in the code aa (bb aa) last aa stays lacking an argument, of course, if we don't consider 1st application aa ( as having a side effect on aa. And that's where separate and rule shows up it's power (speaking about where and namespacing in general). =) Belka -- View

Re[Haskell-cafe] cursive referencing

} f :: SomeData1 - SomeData2 - AA f somedata1 somedata2 = ?? -- Always True: ghci f == aa $ bb f True - Any ideas? Belka -- View this message in context: http://www.nabble.com/Recursive-referencing-tp21722002p21722002.html Sent from the Haskell - Haskell-Cafe

Re: [Haskell-cafe] how to implement daemon start and stop directives?

If you want a normal daemon, you want to look at System.Posix.Process to create a proper daemon (forkProcess, createSession; don't forget to close stdOutput (and, errr, Haskell library types: stdin and stderr are where? not System.Posix.IO with stdOutput) and reopen them on / dev/null,

Re: [Haskell-cafe] how to implement daemon start and stop directives?

is locked-while-awaits for anything to come out from the other side of the pipe... Belka -- View this message in context: http://www.nabble.com/how-to-implement-daemon-start-and-stop-directives--tp21598690p21599567.html Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com

[Haskell-cafe] how to implement daemon start and stop directives?

Hi! 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 value signalizing, that stop is given -

[Haskell-cafe] Connect to DBMS - what's the cost

Hello, community people! Is anybody aware, what aproximately is the cost for the acquiring connection to DB (and also disconnecting from it)? I guess that may differ from DBMS to DBMS, so I mostly am interested in PostgreSQL case, but for other DBMS it's also good to know. Actually, since all

[Haskell-cafe] Haskell, successing crossplatform API standart: first feedback

small DB. Now I'm planning 1. To try some modification of Lucu, so it has a DB connection in it's environment and some basic triggering (providing conditioned actions after WEB interaction process). 2. Implement one simple project on it. Regards, Belka -- View this message in context: http

[Haskell-cafe] Haskell, successing crossplatform API standart

Hello! (1) Is anybody aware of SOA approach being supported in Haskell? Found HAIFA package (SOAP, WEB services), but it seems to be a RIP project (with it's last updated in 2006) - trying to install it is a total mess (for me, a newby). (2) Please, perhaps experienced developers could suggest

[Haskell-cafe] Could not find module ... which is hidden problem

Hello! START-- $ sudo runghc Setup configure --user Configuring HCL-1.2... $ sudo runghc Setup build Preprocessing library HCL-1.2... Preprocessing executables for HCL-1.2... Building HCL-1.2... HCL.hs:302:7: Could not find module

Re: [Haskell-cafe] What *not* to use Haskell for

(1) Function as a system of N concurrent inputs and 1 output is easy essence. How about function as N concurrent inputs and M concurrent outputs? I think it's not native to lambda calculus. So system's programming (if we ever had such paradigm) would solve this issue, while criticizing all FP.