On Wednesday, 13 April 2016 at 15:00:53 UTC, Joakim wrote:
On Wednesday, 13 April 2016 at 14:33:01 UTC, Andrei
That conference had a strange incident last year where they
kicked a guy out for his political views, that had nothing to
do with his technical talk:
On Wednesday, 13 April 2016 at 14:33:01 UTC, Andrei Alexandrescu
wrote:
http://thestrangeloop.com/cfp.html
This edition seems to be a very good fit for us. From the page:
"Frequently accepted topics: functional programming, logic
programming, dynamic/scripting languages, new or emerging
Timon Gehr , dans le message (digitalmars.D:145067), a écrit :
I did: http://pastebin.com/2rEdx0RD
Nice!
port of some haskell code from RosettaCode (run it ~20 min to get
results, haskell runs in less than 2s)
http://pastebin.com/Vx4hXvaT
The main performance issue is the garbage
On 09/23/2011 10:07 AM, Christophe wrote:
Timon Gehr , dans le message (digitalmars.D:145067), a écrit :
I did: http://pastebin.com/2rEdx0RD
Nice!
port of some haskell code from RosettaCode (run it ~20 min to get
results, haskell runs in less than 2s)
http://pastebin.com/Vx4hXvaT
The
On Thu, 22 Sep 2011 11:22:10 +0200, Jacob Carlborg d...@me.com wrote:
auto newrange = filter!a5(map!2*a(range));
At first some people get the heebiejeebies when seeing string-based
lambda and the implicit naming convention for unary and binary
functions. More importantly, there's the
On 2011-09-23 18:05, Simen Kjaeraas wrote:
On Thu, 22 Sep 2011 11:22:10 +0200, Jacob Carlborg d...@me.com wrote:
auto newrange = filter!a5(map!2*a(range));
At first some people get the heebiejeebies when seeing string-based
lambda and the implicit naming convention for unary and binary
On 2011-09-21 22:20, Andrei Alexandrescu wrote:
On 9/21/11 2:29 PM, Timon Gehr wrote:
On 09/21/2011 06:55 PM, Andrei Alexandrescu wrote:
I'm back from the Strange Loop conference. It's been an interesting
experience. The audience was very diverse, with interest in everything
functional (you'd
Peter Alexander peter.alexander...@gmail.com wrote in message
news:j5dhe0$2ln6$1...@digitalmars.com...
For example, in Haskell, map (correctly) has the signature:
map :: (a - b) - [a] - [b]
but in D, std.map has the signature (expressed in some Haskell/D
pseudocode)
map :: (a - b) - [a]
Nick Sabalausky , dans le message (digitalmars.D:145002), a écrit :
For example, in Haskell, map (correctly) has the signature:
map :: (a - b) - [a] - [b]
but in D, std.map has the signature (expressed in some Haskell/D
pseudocode)
map :: (a - b) - [a] - Map!((a - b), [a])
except that
On 22.09.2011 1:53, Timon Gehr wrote:
On 09/21/2011 11:11 PM, Andrei Alexandrescu wrote:
On 9/21/11 3:34 PM, Peter Alexander wrote:
What if foo is a virtual member function? Those can't be templates.
Then it would need to take a dynamic Range as parameter, parameterized
with the element
Andrei Alexandrescu:
I have missed to answer a small part:
On 9/21/11 5:22 PM, bearophile wrote:
This is why I have asked for functions like amap/afilter in Phobos,
because in many situations in D you need an array instead of a lazy
range.
I don't think that was being asked.
I don't
On 09/22/2011 02:29 PM, Christophe wrote:
Nick Sabalausky , dans le message (digitalmars.D:145002), a écrit :
For example, in Haskell, map (correctly) has the signature:
map :: (a - b) - [a] - [b]
but in D, std.map has the signature (expressed in some Haskell/D
pseudocode)
map :: (a - b)
You might wan to play with GC.reserve.
Sent from my iPhone
On Sep 22, 2011, at 4:35 PM, Timon Gehr timon.g...@gmx.ch wrote:
On 09/22/2011 02:29 PM, Christophe wrote:
Nick Sabalausky , dans le message (digitalmars.D:145002), a écrit :
For example, in Haskell, map (correctly) has the
Timon Gehr:
Furthermore, DMD does not do any advanced optimizations
In Haskell there are ways to add library-defined optimizations, with rewrite
rules:
http://www.haskell.org/haskellwiki/Playing_by_the_rules
http://www.haskell.org/haskellwiki/GHC/Using_rules
There are also papers about this.
I'm back from the Strange Loop conference. It's been an interesting
experience. The audience was very diverse, with interest in everything
functional (you'd only need to say Haskell or monad to get positive
aahs), Web/cloud/tablet stuff, concurrent and distributed systems.
Mentioning C++ non
Andrei Alexandrescu:
which has enjoyed moderate audience and success. I uploaded the slides
at http://erdani.com/d/generic-programming-galore.pdf and the video may
be available soon.
In future talks I suggest to show some downsides too, like explaining how much
memory uses the D RE engine,
On 09/21/2011 06:55 PM, Andrei Alexandrescu wrote:
I'm back from the Strange Loop conference. It's been an interesting
experience. The audience was very diverse, with interest in everything
functional (you'd only need to say Haskell or monad to get positive
aahs), Web/cloud/tablet stuff
What is the purpose of this ternary operator on slide 16?
static if (is(typeof(1 ? T[0].init : T[1].init) U))
On 09/21/2011 09:44 PM, Andrej Mitrovic wrote:
What is the purpose of this ternary operator on slide 16?
static if (is(typeof(1 ? T[0].init : T[1].init) U))
This does the bulk of the work to get the combined type of T[0] and
T[1]. It basically just asks the compiler what the combined type
On 9/21/11 12:59 PM, bearophile wrote:
Andrei Alexandrescu:
which has enjoyed moderate audience and success. I uploaded the
slides at http://erdani.com/d/generic-programming-galore.pdf and
the video may be available soon.
In future talks I suggest to show some downsides too, like explaining
On 9/21/11 2:29 PM, Timon Gehr wrote:
On 09/21/2011 06:55 PM, Andrei Alexandrescu wrote:
I'm back from the Strange Loop conference. It's been an interesting
experience. The audience was very diverse, with interest in everything
functional (you'd only need to say Haskell or monad to get positive
On 21/09/11 8:29 PM, Timon Gehr wrote:
Where D still loses when compared to Scala is functional code syntax:
val newcol = collection filter {x=x5} map {x=2*x}
or maybe
val newcol = for(x-collection if(x5)) yield 2*x
vs
auto newrange = filter!((x){return x5;})(map!((x){return 2*x;})(range));
On Sep 21, 2011, at 12:59 PM, Andrei Alexandrescu wrote:
On 9/21/11 12:59 PM, bearophile wrote:
Andrei Alexandrescu:
which has enjoyed moderate audience and success. I uploaded the
slides at http://erdani.com/d/generic-programming-galore.pdf and
the video may be available soon.
In
On 9/21/11 3:34 PM, Peter Alexander wrote:
The problem it's simply intractable to do lazy computation in D while
maintaining the 'correct' static typing.
For example, in Haskell, map (correctly) has the signature:
map :: (a - b) - [a] - [b]
but in D, std.map has the signature (expressed in
On 09/21/2011 10:20 PM, Andrei Alexandrescu wrote:
On 9/21/11 2:29 PM, Timon Gehr wrote:
On 09/21/2011 06:55 PM, Andrei Alexandrescu wrote:
I'm back from the Strange Loop conference. It's been an interesting
experience. The audience was very diverse, with interest in everything
functional
On 09/21/2011 11:11 PM, Andrei Alexandrescu wrote:
On 9/21/11 3:34 PM, Peter Alexander wrote:
What if foo is a virtual member function? Those can't be templates.
Then it would need to take a dynamic Range as parameter, parameterized
with the element type.
Would it be a good idea to allow
Peter Alexander:
auto newrange = filter!a5(map!2*a(range));
At least I think that works??
It works:
import std.stdio, std.range, std.algorithm;
void main() {
auto r = iota(20);
auto n = filter!q{ a 5 }(map!q{ 2 * a }(r));
writeln(n);
}
The problem it's simply intractable to
On 21/09/11 10:11 PM, Andrei Alexandrescu wrote:
On 9/21/11 3:34 PM, Peter Alexander wrote:
The problem it's simply intractable to do lazy computation in D while
maintaining the 'correct' static typing.
For example, in Haskell, map (correctly) has the signature:
map :: (a - b) - [a] - [b]
On 9/21/11 5:22 PM, bearophile wrote:
This is why I have asked for functions like amap/afilter in Phobos,
because in many situations in D you need an array instead of a lazy
range.
I don't think that was being asked.
Of course, if every function that accepts a range becomes a
template then
Andrei Alexandrescu:
Feel free to spare the patronizing part, it won't be missed.
I am sorry. I have full respect for Walter's and yours work.
Bye,
bearophile
On 21.09.2011 22:32, Sean Kelly wrote:
On Sep 21, 2011, at 12:59 PM, Andrei Alexandrescu wrote:
On 9/21/11 12:59 PM, bearophile wrote:
Andrei Alexandrescu:
which has enjoyed moderate audience and success. I uploaded the
slides at http://erdani.com/d/generic-programming-galore.pdf and
the
A kind reader let me know about this conference:
https://thestrangeloop.com/sessions-page/call-for-presentations
Please consider submitting!
Andrei
32 matches
Mail list logo
