On 13 May 2010 04:12, Brent Yorgey wrote:
>
> * "Demand More of Your Automata" by Aran Donohue
Great, because of Aran I now can't change some of the bits of API in
graphviz without making the code examples in his article break...
--
Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com
IvanMilje
aran.donohue:
> I wrote this a couple of weeks ago and forgot about it. I thought it might be
> of interest to some on this list:
>
> http://workshop.arandonohue.com/ring/
> ___
Looks a lot like the shootout ThreadRing benchmark,
http://shootout.
Sorry for spamming, what I wanted to write is I think `has' has better
interface than other record packages in types.
There are many libraries to write function "takes an record has Foo
and Bar and returns something." But writing type of the function is
still difficult. I can't write such types us
On 11 May 2010 03:25, adam vogt wrote:
> On Tue, May 4, 2010 at 12:18 PM, HASHIMOTO, Yusaku wrote:
>> This library is inspired by HList[2], and interfaces are stealed from
>> data-accessors[3]. And lenses[4], fclabels[5], and records[6] devote
>> themselves to similar purposes.
>>
>> [2]: http://
On Thu, May 13, 2010 at 3:01 PM, Edgar Z. Alvarenga wrote:
> On Thu, 13/May/2010 at 18:57 +0100, Maciej Piechotka wrote:
>
> > Hmm. What GDAT/existential do you use (for lazy people who do not want
> > to read paper)?
>
> The GADT that I refered was from my faileds attempts.
>
> > How is it progra
On Thu, May 13, 2010 at 10:49 AM, Edward Amsden wrote:
> On Wed, May 12, 2010 at 3:29 PM, Peter Robinson wrote:
>> As far as I know, TChan needs the 'retry' combinator which requires GHC's
>> RTS.
>> Same is true for TMVar, I think.
>
> (sorry for the doubling peter, I forgot reply-all)
>
> OK.
On Thu, 13/May/2010 at 18:57 +0100, Maciej Piechotka wrote:
> Hmm. What GDAT/existential do you use (for lazy people who do not want
> to read paper)?
The GADT that I refered was from my faileds attempts.
> How is it programmed in Lisp?
The paper don't give much details, but by what I underto
[I work with Gordon on this]
The problem domain is test frameworks, more specifically
proposition-based testing. We are most of the way through unifying
QuickCheck and SmallCheck (as well as untangling the various 'stages'),
and are now generalizing.
The generator is obvious. The 'reducer'
The problem does follow a generator / reducer model. I think between
metamorphisms, hylomorphisms and monoids, I should be able to structure my
solution correctly.
Thanks!
Gordon J. Uszkay
uszka...@mcmaster.ca
On May 13, 2010, at 3:42 PM, Edward Kmett wrote:
> There is also a (naive) me
The memory allocation / threadDelay 0 has no effect, so it isn't *that*
bug.
I've noticed something new, too. I have some other sleeping threads in the
system. When those sleep for short threadDelays compared to the frequency of
accepts, the problem is accelerated. However when the other threads
Hi Tom
I can't really make out what-is-what from the git-repository. Is it
just hosting the generator and not the generated code at the moment?
Also I don't know Frama-C, are you generating the whole CIL syntax
tree from cli_types.mli? By the look of things it is CIL to line 1116
- (** Types of l
I wrote this a couple of weeks ago and forgot about it. I thought it might
be of interest to some on this list:
http://workshop.arandonohue.com/ring/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-c
On Thursday 13 May 2010 21:28:21, Aran Donohue wrote:
> I have an accept-loop:
>
> do (conn, _saddr) <- accept sock
> forkIO $ initializeConnection conn
>
> Which allocates memory iff accept allocates, I suppose. To test the
> theory, is there a way I can force an allocation that won't get
> o
There is also a (naive) metamorphism combinator in my category-extras
library:
http://hackage.haskell.org/packages/archive/category-extras/0.53.4/doc/html/Control-Morphism-Meta-Gibbons.html
Though it is definitely worth pursuing the optimizations that Gibbons talks
about in his very good spigot p
On Thu, May 13, 2010 at 11:58 AM, Stephen Tetley
wrote:
> Hi Tom
>
> Quite a while ago I interfaced Haskell and Ocaml/CIL through both
> ATerms and ASDL pickles.
>
> I can look at digging out this code if you like - it was fairly
> complete, but it had a bug somewhere and will probably be a few
>
On 13 May 2010 20:25, Gordon J. Uszkay wrote:
[SNIP]
> The f container is a potentially infinite stream of data obtained from a
> generator, and I want to be able to control how much data is extracted, so an
> eager 'fmap' won't be sufficient (an eager process will be applied to the
> 'chunks
I have an accept-loop:
do (conn, _saddr) <- accept sock
forkIO $ initializeConnection conn
Which allocates memory iff accept allocates, I suppose. To test the theory,
is there a way I can force an allocation that won't get optimized away?
According to the old print-statement debugging metho
Thank you for all these answers - I learned a lot (especially that the
responses come in REALLY quickly, so the digest option is not a good choice).
I think I need to rephrase the problem, taking into account what I have
learned.
class (Functor f, Functor g) => Foo f g where
foo :: f a -
On Thu, May 13, 2010 at 09:03:48PM +0200, Daniel Fischer wrote:
> > so if it is possible to have partially initialized objects in Haskell,
> If the fields aren't strict, there's no problem having
> ...
Wow! Thank you, that's it :)
--
Eugene Dzhurinsky
pgpPXFjii1ixC.pgp
Description: PGP signatu
On Thursday 13 May 2010 20:43:44, Eugeny N Dzhurinsky wrote:
> On Thu, May 13, 2010 at 07:14:25PM +0100, Stephen Tetley wrote:
> > Hi Eugene
> >
> > Is something like this close to what you want:
>
> Not really. First of all, there're many properties, not 3. So it may end
> up with plenty of suppor
On Thu, May 13, 2010 at 07:14:25PM +0100, Stephen Tetley wrote:
> Hi Eugene
>
> Is something like this close to what you want:
Not really. First of all, there're many properties, not 3. So it may end up
with plenty of support (boilerplate) code.
Also, names of these parameters are not sortable.
On Thu, May 13, 2010 at 07:15:22PM +0100, Stephen Tetley wrote:
> On 13 May 2010 19:14, Stephen Tetley wrote:
> > Hi Eugene
>
> Hi Eugeny
> Whoops - apologies for the the name change...
In fact it doesn't make any difference, so both these names are equal :)
--
Eugene Dzhurinsky
pgpHrKKK4J1f
On 13 May 2010 19:24, Steffen Schuldenzucker
wrote:
> Or just:
>
> makeOrdered a b c = let (s:t:u:_) = sort [a, b, c] in Object s t u
>
Hi Steffen
True - but it does include a partial pattern (that will always match
in this case, of course).
___
Haske
Hi.
Stephen Tetley wrote:
Hi Eugene
Is something like this close to what you want:
For example this builds an object with ordered strings...
makeOrdered :: String -> String -> String -> Object
makeOrdered a b c = let (s,t,u) = sort3 (a,b,c) in Object s t u
Or just:
makeOrdered a b c = le
> Of course, I'm partial.
And of course so was I, and even more than partial !
Excuse-me if the provocation was badly formulated.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hello Job,
CMU http://www.csd.cs.cmu.edu/research/areas/principleprogr/,
UPenn http://www.cis.upenn.edu/~plclub/,
Harvard,
TTI-Chiago /UChicago
all have excellent faculty who do work related to typed functional
programming languages.
Other places worth at least checking out are:
Northeastern u
On 13 May 2010 19:14, Stephen Tetley wrote:
> Hi Eugene
Hi Eugeny
Whoops - apologies for the the name change...
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi Eugene
Is something like this close to what you want:
For example this builds an object with ordered strings...
makeOrdered :: String -> String -> String -> Object
makeOrdered a b c = let (s,t,u) = sort3 (a,b,c) in Object s t u
Alternatively you could build the with the Strings as they appe
Andrea Vezzosi wrote:
On Thu, May 13, 2010 at 10:51 AM, wren ng thornton wrote:
Andrea Vezzosi wrote:
wren ng thornton wrote:
With this change [1] I can't notice any difference for your benchmark[2].
Then again, all the runTest calls take 0 msec and I've had no luck making
the computation ta
Hi all,
We're happy to announce the newest release of the three above packages.
Notable changes include:
* Anton Ageev wrote support for anchors and aliases into both the yaml and
data-object-yaml package.
* Anton also wrote support in data-object-yaml for merge keys.
* The yaml package is now ba
Thanks for the input.
I don't have problems with traveling. The two main obstacles with going to a
school in Europe are:
1. Cost
2. I only speak english
I would be more than willing to learn another language, but I would like to
start working towards a PhD in the next year or so, and I do
>> Anybody know of a good grad school in the US for functional languages?
>
> If you imperatively need to stay in the US, I do not know if there's even one.
That's pretty harsh! Just in the northeastern US, we have CMU, UPenn,
Harvard, Northeastern, Princeton, Yale, Cornell (and maybe others I'm
Hi all,
I wrote a minimal major mode for reading (and editing) GHC Core files. It
provides syntax highlighting and removal of commonly ignored annotations,
similar to what's offered by ghc-core.
* Usage
Dump the simplifier output in a file with a .hcr suffix:
ghc -c -ddump-simpl -O2 Test.hs
On Thu, 2010-05-13 at 10:06 -0300, Edgar Z. Alvarenga wrote:
> Hi,
>
> I created a small Genetic Algorithm program, replicating this
> work ("Statistical mechanics of program systems" - JP Neirotti, N.
> Caticha, Journal of Physics A Math and Gen) made in Lisp. When a
> restricted the problem ju
If you imperatively need to stay in the US, I do not know if there's even one.
If you do not have problems with traveling, you can have a look at :
http://mpri.master.univ-paris7.fr/
Which gathers the best french students (from such schools as Ecole
Polytechnique, ENS Ulm, ENS Cachan). Or I kno
If you imperatively need to stay in the US, I do not know if there's even one.
If you do not have problems with traveling, you can have a look at :
http://mpri.master.univ-paris7.fr/
Which gathers the best french students (from such schools as Ecole
Polytechnique, ENS Ulm, ENS Cachan). Or I kno
Anybody know of a good grad school in the US for functional languages?
(good = has Ph.D. program that covers functional languages, type systems,
correctness proofs, etc...)
So far Indiana University is the only one I've found that has a strong
showing in this area.
A way to get into one of the aw
On Thu, May 13, 2010 at 04:43:26PM +0100, Stephen Tetley wrote:
> Hi Eugene
>
> You don't need to supply all the arguments to a constructor at once:
>
> makeWithOne :: String -> (String -> String -> Object)
> makeWithOne s1 = \s2 s3 -> Object s1 s2 s3
>
> -- or even:
> -- makeWithOne s1 = Object
Hi Tom
Quite a while ago I interfaced Haskell and Ocaml/CIL through both
ATerms and ASDL pickles.
I can look at digging out this code if you like - it was fairly
complete, but it had a bug somewhere and will probably be a few
revisions behind the current CIL.
Best wishes
Stephen
___
Hi Roel
Thanks for the information.
With Precis, I wanted to make a standalone tool rather than work with
GHC-API. I don't know how stable GHC-API, but I expect it to be less
stable than haskell-src-exts, and as Precis is a tool to help gauge
the stability of packages I want it to be stable itsel
On Thu, May 13, 2010 at 5:53 AM, Aran Donohue wrote:
> Thanks folks! Forward progress is made...
>
> Unfortunately, programs don't seem to write out their threadscope event
> logs until they terminate, and mine hangs until I kill it, so I can't get at
> the event log.
>
> Tracing has taught me tha
On Wed, May 12, 2010 at 10:05 PM, Don Stewart wrote:
> martin:
> > hi,
> >
> > since i got no answer from the maintainer, maybe someone else can take
> > care of it, or at least point out, what i did wrong.
> >
> > so, i recently stumbled upon some error while using Text.JSON 0.4.3 [1]:
> >
> >
On Thu, May 13, 2010 at 5:23 PM, Stephen Tetley
wrote:
> Hi Bas
>
> I'm not entirely surprised...
>
> Do you know if haskell-src-exts can parse files with Unicode syntax
> (and I'm not using enough extensions)?
>
> Thanks
>
> Stephen
Last time I checked it had problems with the ∷ and ∀ characters
On Wed, May 12, 2010 at 3:29 PM, Peter Robinson wrote:
> As far as I know, TChan needs the 'retry' combinator which requires GHC's RTS.
> Same is true for TMVar, I think.
(sorry for the doubling peter, I forgot reply-all)
OK. I'm new to this and probably didn't know where to look, but I
didn't k
Hi Eugene
You don't need to supply all the arguments to a constructor at once:
makeWithOne :: String -> (String -> String -> Object)
makeWithOne s1 = \s2 s3 -> Object s1 s2 s3
-- or even:
-- makeWithOne s1 = Object s1
This builds a higher-order function that can be applied later to two
Strings
Hello, all!
I need to create objects like this
data Object = MyObject { param1, param2, param3 :: String }
from the input file
param_1_param1=value11
param_2_param1=value21
param_2_param2=value22
param_1_param3=value13
param_2_param3=value23
param_1_param2=value12
so general pattern of recogni
On 13 May 2010 14:24, Bas van Dijk wrote:
> Hi Stephen,
>
> precis reports parse errors when applied to packages containing Unicode
> syntax.
>
> Regards,
>
> Bas
Hi Bas
I'm not entirely surprised...
Do you know if haskell-src-exts can parse files with Unicode syntax
(and I'm not using enough
In this case I think you should either make it a separate package, or don't
hide it in this module. It looks like an easy way to call Ubigraph from
Hhaskell, and there is no apparent alternative (in hackage) so why hide it?
On 13 May 2010 14:52, Gleb Alexeyev wrote:
> Ozgur Akgun wrote:
>
>> A
On Thu, May 13, 2010 at 10:51 AM, wren ng thornton wrote:
> Andrea Vezzosi wrote:
>>
>> wren ng thornton wrote:
>>>
>>> With this change [1] I can't notice any difference for your benchmark[2].
>>> Then again, all the runTest calls take 0 msec and I've had no luck making
>>> the computation take
Ozgur Akgun wrote:
A little bit of topic, but why is the module Graphics.Ubigraph hidden in
your package? I've been trying to use Ubigraph directly, and your module
helped me a lot. (I just patched the cabal file to expose Graphics.Ubigraph
as well)
Is there a specific reason for it to be hidden
A little bit of topic, but why is the module Graphics.Ubigraph hidden in
your package? I've been trying to use Ubigraph directly, and your module
helped me a lot. (I just patched the cabal file to expose Graphics.Ubigraph
as well)
Is there a specific reason for it to be hidden?
As far as I know,
Hi Stephen,
precis reports parse errors when applied to packages containing Unicode syntax.
Regards,
Bas
On Thu, May 13, 2010 at 2:25 PM, Stephen Tetley
wrote:
> On 5 May 2010 12:14, Henning Thielemann wrote:
>>
>> On Wed, 5 May 2010, Stephen Tetley wrote:
>>
>>> I'm open to suggests for pret
Hi,
I created a small Genetic Algorithm program, replicating this
work ("Statistical mechanics of program systems" - JP Neirotti, N.
Caticha, Journal of Physics A Math and Gen) made in Lisp. When a
restricted the problem just for one type, the Haskell program worked
perfectly with much less line
Thanks folks! Forward progress is made...
Unfortunately, programs don't seem to write out their threadscope event logs
until they terminate, and mine hangs until I kill it, so I can't get at the
event log.
Tracing has taught me that before the hang-cause, my program splits its time
in pthread_con
On 5 May 2010 12:14, Henning Thielemann wrote:
>
> On Wed, 5 May 2010, Stephen Tetley wrote:
>
>> I'm open to suggests for prettifying the output, or adding further
>> comparisons. While coding precis, I decided that trying to police
>> version numbers would be impractical so I decided to focus on
Thanks! It looks better now!
PS: I actually knew about the oriented attribute, but I thought this might
be something else. Anyway..
On 13 May 2010 09:23, Gleb Alexeyev wrote:
> Ozgur Akgun wrote:
>
>> Thanks for the answer.
>>
>> I see your point, that Ubigraph does some magic* to place vertice
Antoine Latter wrote:
While I also offer a transformer version of MaybeCPS, the transformer *does*
suffer from significant slowdown. Also, for MaybeCPS it's better to leave
the handlers inline in client code rather than to abstract them out; that
helps to keep things concrete. So perhaps you shou
Andrea Vezzosi wrote:
wren ng thornton wrote:
With this change [1] I can't notice any difference for your benchmark[2].
Then again, all the runTest calls take 0 msec and I've had no luck making
the computation take much time; perhaps your computer can detect a
difference.
On my machine, with
Ozgur Akgun wrote:
Thanks for the answer.
I see your point, that Ubigraph does some magic* to place vertices and
edges.
This makes me wonder, how they generate the binary tree demo:
http://ubietylab.net/ubigraph/content/Demos/random_binary_tree.html
Is there a way to disable this optimal graph l
On 13 May 2010 18:14, Henning Thielemann
wrote:
> Heinrich Apfelmus schrieb:
>
>> Yes, the integers are just indexes. Of course, the example with the even
>> integers is a bit silly;
>
> ... might be useful for bipartite graphs
So, a K_{0,n} bipartite graph? :p
--
Ivan Lazar Miljenovic
ivan.mil
Heinrich Apfelmus schrieb:
> Yes, the integers are just indexes. Of course, the example with the even
> integers is a bit silly;
... might be useful for bipartite graphs
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mail
On 13 May 2010 17:09, Heinrich Apfelmus wrote:
> Ah, ok, you want graphs that only work with one node type. If there is
> at most one such graph for each node type, you could make a data type
> family and retain the parameter, though
>
> data family Graph node :: * -> *
> data family Graph I
Ivan Lazar Miljenovic wrote:
> Heinrich Apfelmus writes:
>>
>> Graphs with different node types don't behave differently; graphs are
>> parametric with respect to the node type, just like lists don't behave
>> differently on different element types.
>
> There will be a Map-based graph available th
63 matches
Mail list logo
