How do you test concurrent programs in which you actually have to test over
all possible interleaving schedules by the scheduler . Is this possible to
do with quickcheck .
Thanks ,
Satvik
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.
On Thu, Apr 5, 2012 at 8:59 PM, Tillmann Rendel
wrote:
> Paul R wrote:
>>
>> I am curious what are interesting use-cases for that? Symbolic
>> analysis? self-compilers?
>
>
> Optimization. For example, imagine the following definition of function
> composition:
>
> map f . map g = map (f . g)
>
+1 -- the reagents model is interesting and it would be good to see a
Haskell implementation.
On Thu, Apr 5, 2012 at 3:05 PM, Ben Gamari wrote:
> Ben writes:
>
> > perhaps it is too late to suggest things for GSOC --
> >
> > but stephen tetley on a different thread pointed at aaron turon's
> >
On Thu, Apr 5, 2012 at 11:59 AM, Tillmann Rendel <
ren...@informatik.uni-marburg.de> wrote:
> Paul R wrote:
>
>> I am curious what are interesting use-cases for that? Symbolic
>> analysis? self-compilers?
>>
>
> Optimization. For example, imagine the following definition of function
> composition:
Ben writes:
> perhaps it is too late to suggest things for GSOC --
>
> but stephen tetley on a different thread pointed at aaron turon's
> work, which there's a very interesting new concurrency framework he
> calls "reagents" which seems to give the best of all worlds : it is
> declarative and co
Paul R wrote:
I am curious what are interesting use-cases for that? Symbolic
analysis? self-compilers?
Optimization. For example, imagine the following definition of function
composition:
map f . map g = map (f . g)
f . g = \x -> f (g x)
In Haskell, we cannot write this, because we cann
perhaps it is too late to suggest things for GSOC --
but stephen tetley on a different thread pointed at aaron turon's work, which
there's a very interesting new concurrency framework he calls "reagents" which
seems to give the best of all worlds : it is declarative and compositional like
STM,
>> I think I might know what your problem is. You're accepting file uploads
>> using handleMultipart, yes? Snap kills uploads that are going too slow,
>> otherwise you would be vulnerable to slowloris
>> (http://ha.ckers.org/slowloris/) DoS attacks. What's probably happening here
>> is that you're
>> I think I might know what your problem is. You're accepting file uploads
>> using handleMultipart, yes? Snap kills uploads that are going too slow,
>> otherwise you would be vulnerable to slowloris
>> (http://ha.ckers.org/slowloris/) DoS attacks. What's probably happening here
>> is that you're
Grigory> So now I wonder, what are the languages that are functional in
Grigory> the sense above? With a reasonable syntax and semantics, thus
Grigory> no assembler. I guess Lisp might be of this kind, but I'm not
Grigory> sure. In addition, I'm not a fan of parentheses. What else?
Grigory> Pure?
On Thu, Apr 5, 2012 at 10:14 AM, Grigory Sarnitskiy wrote:
> First, what are 'functions' we are interested at? It can't be the usual
> set-theoretic definition, since it is not constructive. The constructive
> definition should imply functions that can be constructed, computed. Thus
> these are
Addendum:
Intel's Forte was the framework,
reFLect was the language : http://www.cs.ox.ac.uk/tom.melham/res/reflect.html
Quoting that page:
"reFLect is a functional programming language designed and implemented by a
team at Intel Corporation's Strategic CAD Labs under the direction of Jim
Gru
On 5 Apr 2012, at 15:14, Grigory Sarnitskiy wrote:
> Hello! I've just realized that Haskell is no good for working with functions!
>
>
>
> Obviously, that's not all of the imaginable possibilities. One also can
> rewrite programs. And write programs that rewrite programs. And write
> pro
Quoth Anthony Cowley ,
...
> I think this is a consequence of line buffering rather than a bug. If
> you write your own increment function in Haskell, you get the same
> behavior. If you `hSetBuffering stdout NoBuffering` before your `putStr`
> call, you should get the behavior you wanted.
Though
On Thu, Apr 5, 2012 at 4:30 AM, Ertugrul Söylemez wrote:
> Paul Liu wrote:
>
>> > This isn't switching. It's selection. If fullTime decides to be
>> > productive, then alterTime acts like fullTime. Otherwise it acts
>> > like halfTime. If both inhibit, then alterTime inhibits. This
>> > allo
Le 5 avril 2012 16:14, Grigory Sarnitskiy a écrit :
> Hello! I've just realized that Haskell is no good for working with functions!
>
> First, what are 'functions' we are interested at? It can't be the usual
> set-theoretic definition, since it is not constructive. The constructive
> definition
Hello! I've just realized that Haskell is no good for working with functions!
First, what are 'functions' we are interested at? It can't be the usual
set-theoretic definition, since it is not constructive. The constructive
definition should imply functions that can be constructed, computed. Thus
On Thursday, April 5, 2012 at 1:53 AM, Sutherland, Julian wrote:
> Hey Guys,
>
> I'm Julian, I am reaching the end of my second year as a JMC (Joint
> Mathematics and Computer science) Student at Imperial College London
> and I'd like to apply to GSOC for a project involving Haskell and I just
>
On Thu, Apr 5, 2012 at 12:05 PM, Gregory Collins
wrote:
> +haskell-cafe, oops
>
> On Thu, Apr 5, 2012 at 11:04 AM, Gregory Collins
> wrote:
>>
>> On Wed, Apr 4, 2012 at 10:09 PM, tsuraan wrote:
>>>
>>> > It's hard to rule Snap timeouts out; try building snap-core with the
>>> > "-fdebug" flag an
+haskell-cafe, oops
On Thu, Apr 5, 2012 at 11:04 AM, Gregory Collins wrote:
> On Wed, Apr 4, 2012 at 10:09 PM, tsuraan wrote:
>
>> > It's hard to rule Snap timeouts out; try building snap-core with the
>> > "-fdebug" flag and running your app with "DEBUG=1", you'll get a spew of
>> > debugging o
There is also recent work by Aaron Turon and Olin Shivers - Modular
Rollback through Control Logging
http://www.ccs.neu.edu/home/shivers/
http://www.ccs.neu.edu/home/turon/
Note that as well as the paper on Olin Shivers's site there is a more
recent monadic presentation on Aaron Turon's site with
On Thu, Apr 5, 2012 at 03:21, Holger Siegel wrote:
> Am 05.04.2012 um 08:42 schrieb Brandon Allbery:
> > On Thu, Apr 5, 2012 at 01:53, Sutherland, Julian <
> julian.sutherlan...@imperial.ac.uk> wrote:
> > data Tree = Node Left Right | Leaf
> >
> > Could be converted to a struct in C/C++:
> >
> >
Am 05.04.2012 um 08:42 schrieb Brandon Allbery:
> On Thu, Apr 5, 2012 at 01:53, Sutherland, Julian
> wrote:
> data Tree = Node Left Right | Leaf
>
> Could be converted to a struct in C/C++:
>
> struct Tree {
> struct Tree* left;
> struct Tree* right;
> };
>
> Shouldn't this actually
> I thoutgh on the use or ErrorT or something similar but the fact is
> that i need many bacPoints, not just one. That is, The user can go
> many pages back in the navigation pressing many times te back
> buttton.
The approach in the previous message extends to an arbitrary,
statically unknown nu
24 matches
Mail list logo
