Re: [Haskell-cafe] Re: A suggestion for the next high profile Haskell project [Was: Re: What is a hacker?]

2006-12-19 Thread Tomasz Zielonka
On Tue, Dec 19, 2006 at 12:52:17PM +0100, Joachim Durchholz wrote: Tomasz Zielonka schrieb: On Mon, Dec 18, 2006 at 12:14:36AM +0100, Joachim Durchholz wrote: Haskell might be prone to denial-of-service attacks. E.g. sending it data that cause it to evaluate an infinite data structure.

Re: [Haskell-cafe] Re: A suggestion for the next high profile Haskell project [Was: Re: What is a hacker?]

2006-12-19 Thread Neil Mitchell
Hi Joachim, Why? In case the strictness analyzer was buggy? I'd be perfectly happy if that analysis were just a note saying run ghc with such-and-these options and inspect the intermediate code for function foo to see that the strictness analyzer determined it will always terminate. I

Re: [Haskell-cafe] Re: A suggestion for the next high profile Haskell project [Was: Re: What is a hacker?]

2006-12-19 Thread Seth Gordon
Joachim Durchholz wrote: Trying to fully evaluate an infinite data structure will result in looping or memory exhaustion, and you have that possibilities in almost all languages. Yes, but I suspect that Haskell makes it easier to make that kind of bug. Worse, it's easy to introduce this

Re : [Haskell-cafe] Re: A suggestion for the next high profile Haskell project [Was: Re: What is a hacker?]

2006-12-19 Thread minh thu
2006/12/19, Neil Mitchell [EMAIL PROTECTED]: Hi Neil, Hi Joachim, Why? In case the strictness analyzer was buggy? I'd be perfectly happy if that analysis were just a note saying run ghc with such-and-these options and inspect the intermediate code for function foo to see that the

Re: Re : [Haskell-cafe] Re: A suggestion for the next high profile Haskell project [Was: Re: What is a hacker?]

2006-12-19 Thread Neil Mitchell
Hi minh thu, Lazy semantics - equational reasoning ? I thought that : lack of mutable state - equational reasoning. For instance, I think to data flow variable in Oz (whcih I really don't know much / never used) : if a (Oz managed) thread attemps to read the value of an unbound (data flow)

Re : Re : [Haskell-cafe] Re: A suggestion for the next high profile Haskell project [Was: Re: What is a hacker?]

2006-12-19 Thread minh thu
2006/12/19, Neil Mitchell [EMAIL PROTECTED]: Hi minh thu, Lazy semantics - equational reasoning ? I thought that : lack of mutable state - equational reasoning. For instance, I think to data flow variable in Oz (whcih I really don't know much / never used) : if a (Oz managed) thread attemps

Re : Re : Re : [Haskell-cafe] Re: A suggestion for the next high profile Haskell project [Was: Re: What is a hacker?]

2006-12-19 Thread minh thu
2006/12/19, Brandon S. Allbery KF8NH [EMAIL PROTECTED]: On Dec 19, 2006, at 16:03 , minh thu wrote: 2006/12/19, Neil Mitchell [EMAIL PROTECTED]: not_term = non_term f x = 12 Now evaluating: main = f non_term In a lazy language the value is always 12, in a strict language its always

Re: [Haskell-cafe] Re: A suggestion for the next high profile Haskell project [Was: Re: What is a hacker?]

2006-12-18 Thread Tomasz Zielonka
On Mon, Dec 18, 2006 at 12:14:36AM +0100, Joachim Durchholz wrote: Magnus Therning schrieb: There is of course the possibility that Haskell would bring a whole slew of yet-to-be-determined security issues. I doubt it will be worse than C though. Haskell might be prone to denial-of-service