we have two more
presentations:
William Duff - Jane Street
Typing speed: how rich types enable performance engineering
Aaron Turon - Mozilla
Help wanted: research questions in Rust
Hope to see many of you.
Bob, Guy, Paul and Zena
___
Haskell
of Programming Languages
Paul Downen
University of Oregon
Jan Hoffman
Carnegie Mellon University
July 9-21 PARALLELISM AND CONCURRENCY
Umut Acar - Carnegie Mellon University
Parallel Algorithms
Arvind - Massachusetts Institute of Technology
Dataflow: A retrospective.
Atomicity in modular design
writing, discussing and refining it sounds, to me, like a good
starting point.
No matter what, I look forward to seeing this discussion continue and also
to the finished document!
Regards,
Paul.
On 25 April 2017 at 02:39, wren romano <w...@community.haskell.org> wrote:
> I'm +1 to hav
Hello GHC users,
For various reasons i'm trying to package something which is compatible
with/equivalent to the Haskell Platform.
I've been looking at the list posted at [0], and it turns out that GHC
7.10.2 doesn't bundle all the packages that are promised. (Or it's a
case of PEBKAC and i
mean that valid Haskell2010 programs might get
rejected by GHC by default, which is a pretty bad state of affairs.
--
Stephen Paul Weber, @singpolyma
See http://singpolyma.net for how I prefer to be contacted
edition right joseph
signature.asc
Description: Digital signature
Typed holes is not an extension, because it's considered a warning/error.
The reason for this is that code with typed holes is NOT valid haskell to
begin with, therefore the behaviour doesn't conflict with any description
in the report.
Well, now I feel very silly about my last email to this
RebindableSyntax
I thought this would work, but people seemed pretty sure we would need to do
more work than RebindableSyntax to get everything in place.
--
Stephen Paul Weber, @singpolyma
See http://singpolyma.net for how I prefer to be contacted
edition right joseph
signature.asc
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA256
I suppose that -XOverlappingInstances could mean silently honour
OVERLAPPABLE/OVERLAPPING pragmas, while lacking it would mean honour
OVERLAPPABLE/OVERLAPPING pragmas, but emit noisy warnings or even don't
honour them and warn.
But that is
that adds actual keywords to tag instances that
should be allowed to overlap be added, instead of resorting to pragmas.
This seems like an approach that could be useful in general and one could
imagine moving past an extension to the core language at some point,
potentially.
- --
Stephen Paul Weber
and then eventually
(likely) be rejected by newer GHCs, thus requiring a prepropcessor in either
case.
--
Stephen Paul Weber, @singpolyma
See http://singpolyma.net for how I prefer to be contacted
edition right joseph
___
Glasgow-haskell-users mailing list
this independence?
Thank you,
Charles Paul
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
.
tl;dr to the best of my knowledge this issue is resolved in HEAD. Test HEAD.
Help us make sure it stays resolved by testing HEAD.
thanks
-Carter
On Tue, Oct 1, 2013 at 1:20 PM, Paul Liu nine...@gmail.com wrote:
I reported a problem with statically linked GLFW library on Mac OS X
Lion
No. GLFW does not give you any UI elements, just basic windowing and
input handling.
Euterpea has a UI layer on top of GLFW that provides text boxes and
sliders, etc, entirely written in Haskell.
On Wed, Oct 2, 2013 at 8:40 AM, Conal Elliott co...@conal.net wrote:
Hi Paul. Is there a way to use
.
The design was based on your Phooey work, monadic composition of UI
elements wired by signals. I deliberately made the layout not reactive
in order to simplify implementation.
Regards,
Paul Liu
On Wed, Oct 2, 2013 at 3:28 PM, Conal Elliott co...@conal.net wrote:
Interesting. How
Hi Conal,
I wasn't able to make it to last Saturday's FARM track, but I think
there was a good chance that Paul would have demonstrated his Euterpea
music library, which includes a GUI interface (called MUI) written on
top of GLFW. I wrote its initial implementation (around 2009?) with a
monadic
to use it as a Fold. Is there a situation where writing a Getter is
superior than writing a function, then lifting it as needed?
Thank you,
Charles Paul
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Somebody claiming to be Jens Petersen wrote:
The libraries in question here are haskeline, terminfo, and xhtml.
Are those libraries needed by GHCI? Could we just statically link those
ones into GHC?
--
Stephen Paul Weber, @singpolyma
See http://singpolyma.net for how I prefer
Suppose I need to get an element from a data structure, and also
modify the data structure. For example, I might need to get and delete
the last element of a list:
darle xs = ((last xs), (rmlast xs)) where
rmlast [_] = []
rmlast (y:ys) = y:(rmlast ys)
There are probably other and better ways
Dear list,
I am not sure if this is the right place to post this, but I just went
to haskell.org and got a
Sorry! This site is experiencing technical difficulties.
error message.
cheers
Paul
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Mon, Jul 29, 2013 at 7:45 PM, Mateusz Kowalczyk
fuuze...@fuuzetsu.co.uk wrote:
Sit tight. I recommend using Google cached versions of
the pages.
Thanks. I hope this didn't come of as complaint. I am thankful for the
work that goes into maintaining the site.
Cheers
Paul
Somebody claiming to be harry wrote:
all of this stems from GHC
looking for libgmp.so, instead of libgmp.so.3
Most systems symlink libgmp.so to the default version installed. On Debian
stable it's libgmp.so.10 ... so it may work for you, but you may want to
upgrade.
--
Stephen Paul Weber
Somebody claiming to be harry wrote:
Stephen Paul Weber wrote
Somebody claiming to be harry wrote:
I also
need to install GHC on systems where I don't have root access, so I can't
create the link.
You can create the link somewhere else, and use LD_LIBRARY_PATH
I have done this before
:)
--
Stephen Paul Weber, @singpolyma
See http://singpolyma.net for how I prefer to be contacted
edition right joseph
signature.asc
Description: Digital signature
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org
that overlaps with an
existing, more useful, operator)
--
Stephen Paul Weber, @singpolyma
See http://singpolyma.net for how I prefer to be contacted
edition right joseph
signature.asc
Description: Digital signature
___
Glasgow-haskell-users mailing
to write eqT using what singletons generates,
wouldn't it make sense for it to generate something that relates :==: and ~
?
Cheers,
Paul
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Mon, Apr 8, 2013 at 9:59 PM, Richard Eisenberg e...@cis.upenn.edu wrote:
On Apr 8, 2013, at 3:12 PM, Paul Brauner polux2...@gmail.com wrote:
from the output of -ddump-splices I dont think it is the case but I'm
asking anyway: is there any way to deduce a ~ b from a :==: b?
Not easily
Very helpful, thanks! I may come back with more singleton/type families
questions :)
On Tue, Mar 26, 2013 at 6:41 PM, Richard Eisenberg e...@cis.upenn.eduwrote:
Hello Paul,
- Forwarded message from Paul Brauner polux2...@gmail.com -
snip
- is a ~ ('CC ('Left 'CA
of the definitions of SCC,
SLeft, ... (in which case GHC could infer it but for some reason can't)
- or are these pattern + definitions not sufficient to prove that a
~ ('CC ('Left 'CA)) no matter what?
Cheers,
Paul
___
Haskell-Cafe mailing list
Haskell-Cafe
Why does QuickCheck (2.6) list the following as instances of class Testable?
Testable Result
Testable Prop
Testable prop = Testable (Gen prop)
The Hughes/Claessen paper QuickCheck: A Lightweight Tool for Random
Testing of Haskell Programs mentions nesting property combinators on page
6, but I
for
comparison with the above. Did Roman C. publish some code for this a
while back?
Paul
On Wed, Feb 27, 2013 at 9:50 AM, Paul Callaghan paulcc@gmail.com wrote:
Another alternative is this Haskell library: https://github.com/paulcc/xsaiga
This is a combinator library which is suitable
be merged with later.
Why shouldn't Prelude (and other really stable, standard modules) just live
in the `haskell2010` package?
--
Stephen Paul Weber, @singpolyma
See http://singpolyma.net for how I prefer to be contacted
edition right joseph
signature.asc
Description: Digital signature
Somebody claiming to be Roman Cheplyaka wrote:
* Stephen Paul Weber singpol...@singpolyma.net [2013-02-25 11:29:42-0500]
Why shouldn't Prelude (and other really stable, standard modules)
just live in the `haskell2010` package?
Because then we can't make changes to it without producing a new
-base.
It would be great to have a portable base, without any GHC-specific
stuff in it. After all, modules like Control.Monad or Data.Foldable are
pure Haskell2010.
+1
--
Stephen Paul Weber, @singpolyma
See http://singpolyma.net for how I prefer to be contacted
edition right joseph
the `haskell2010` package as one of the
groupings? It seems like this sort of reorganisation could help solve the
problem we currently have where one cannot using any of the features of
`base` along with the `haskell2010` modules.
--
Stephen Paul Weber, @singpolyma
See http://singpolyma.net for how I
executable (made
by, I assume, his system's GHC).
The problem is not the size, but the size ratio.
--
Stephen Paul Weber, @singpolyma
See http://singpolyma.net for how I prefer to be contacted
edition right joseph
signature.asc
Description: Digital signature
Somebody claiming to be Nathan Hüsken wrote:
Hey,
For me thinks have changed.
With the current ghc HEAD and llvm version 3.2 I am able to do a
registerised build for android!
Do you think it is specifically the 3.2 that made it work?
--
Stephen Paul Weber, @singpolyma
See http
Somebody claiming to be Nathan Hüsken wrote:
On 01/24/2013 03:58 PM, Stephen Paul Weber wrote:
Somebody claiming to be Nathan Hüsken wrote:
With the current ghc HEAD and llvm version 3.2 I am able to do a
registerised build for android!
Do you think it is specifically the 3.2 that made
Somebody claiming to be Nathan Hüsken wrote:
On 01/24/2013 04:28 PM, Stephen Paul Weber wrote:
Do you think it is specifically the 3.2 that made it work?
Yes. With llvm version 3.1 I was only able to get an unregisterised
build to work.
http://hackage.haskell.org/trac/ghc/attachment/ticket
Somebody claiming to be Stephen Paul Weber wrote:
Somebody claiming to be Nathan Hüsken wrote:
On 01/24/2013 04:28 PM, Stephen Paul Weber wrote:
Do you think it is specifically the 3.2 that made it work?
Yes. With llvm version 3.1 I was only able to get an unregisterised
build to work.
http
Somebody claiming to be Nathan Hüsken wrote:
On 01/24/2013 05:51 PM, Stephen Paul Weber wrote:
(...)
So... it can't find memcpy for some reason?
I'm about to try with llvm-3.2 to see if that's different.
The solution for me was to wrap mkfifo (in a function I called __mkfifo)
and used
Somebody claiming to be Stephen Paul Weber wrote:
Somebody claiming to be Nathan Hüsken wrote:
But the symbol not found is __aeabi_memcpy, not memcpy itself ...
I can not find __aeabi_memcpy in the ghc source ...
Maybe it is not linking some required library?
I'm not sure. Most curious
Somebody claiming to be Karel Gardas wrote:
On 01/24/13 05:51 PM, Stephen Paul Weber wrote:
Doing a registered build with llvm-3.0 I eventually get:
In function `c58Y_info':
/tmp/ghc21061_0/ghc21061_0.bc:(.text+0x42d4): undefined reference to
`__aeabi_memcpy'
collect2: ld returned 1 exit status
Somebody claiming to be Nathan Hüsken wrote:
On 01/24/2013 07:00 PM, Stephen Paul Weber wrote:
Somebody claiming to be Karel Gardas wrote:
On 01/24/13 05:51 PM, Stephen Paul Weber wrote:
:(
Can you run it in gdb and loock what the backtrace looks like?
I can maybe get a core file and load
Somebody claiming to be Nathan Hüsken wrote:
On 01/24/2013 07:00 PM, Stephen Paul Weber wrote:
Somebody claiming to be Karel Gardas wrote:
On 01/24/13 05:51 PM, Stephen Paul Weber wrote:
So, not sure on the right solution, but when I add -lcapsthen the
linker errors go away and I can
Somebody claiming to be Nathan Hüsken wrote:
On 01/24/2013 07:26 PM, Stephen Paul Weber wrote:
Somebody claiming to be Nathan Hüsken wrote:
Can you run it in gdb and loock what the backtrace looks like?
Did you compile with -debug?
I remember I got a stack trace with gdb like this (when doing
/1184
--
Stephen Paul Weber, @singpolyma
See http://singpolyma.net for how I prefer to be contacted
edition right joseph
signature.asc
Description: Digital signature
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http
Paul Weber, @singpolyma
See http://singpolyma.net for how I prefer to be contacted
edition right joseph
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
Somebody claiming to be Ben Gamari wrote:
Stephen Paul Weber singpol...@singpolyma.net writes:
Trying that gives me:
Warning: Couldn't figure out LLVM version!
Make sure you have installed LLVM
ghc: could not execute: opt-3.0
I'm using LLVM 3.1.
Are you certain the opt-3.0
-unregisterised to see if that helps.
--
Stephen Paul Weber, @singpolyma
See http://singpolyma.net for how I prefer to be contacted
edition right joseph
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman
Somebody claiming to be Stephen Paul Weber wrote:
Somebody claiming to be Nathan Hüsken wrote:
Was that an registerised or unregisterised build?
Did anyone succesfully build ghc on an arm system which produces non
crashing executables?
Just finally got a BB10 device set up so I can test my
Somebody claiming to be Stephen Paul Weber wrote:
Somebody claiming to be Stephen Paul Weber wrote:
Somebody claiming to be Nathan Hüsken wrote:
Was that an registerised or unregisterised build?
Did anyone succesfully build ghc on an arm system which produces non
crashing executables?
Just
how feasible this syntax is, but I like it a lot better, and it
makes it more clear (to me) that this is purely type-level syntax.
--
Stephen Paul Weber, @singpolyma
See http://singpolyma.net for how I prefer to be contacted
edition right joseph
signature.asc
Description: Digital signature
pointed out something interesting:
If GHC can know that MkAge is just id (in terms of code, not in terms of
type), which seems possible, and if the only interesting case is a Functor,
which seems possible, then a RULE fmap id = id would solve this. No?
--
Stephen Paul Weber, @singpolyma
See
with that.
--
Stephen Paul Weber, @singpolyma
See http://singpolyma.net for how I prefer to be contacted
edition right joseph
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
Is there any way to set the paths in my cabal-install config relative to
$HOME or similar? I tried ~ and $HOME and neither of those worked.
--
Stephen Paul Weber, @singpolyma
See http://singpolyma.net for how I prefer to be contacted
edition right joseph
of GHCi/TH/DPH support, and IIRC it uses the old via-C instead of
LLVM, but I could be wrong about that. More eyeballs on porting to the
architecture would certainly not be a bad thing.
I haven't experience any actual bugs yet in my yeeloong GHC. Thanks for
providing it.
--
Stephen Paul Weber
it's a just-barely-works build :)
--
Stephen Paul Weber, @singpolyma
See http://singpolyma.net for how I prefer to be contacted
edition right joseph
signature.asc
Description: Digital signature
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users
.
--
Stephen Paul Weber, @singpolyma
See http://singpolyma.net for how I prefer to be contacted
edition right joseph
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
Somebody claiming to be Roman Cheplyaka wrote:
* Stephen Paul Weber singpol...@singpolyma.net [2012-12-09 21:20:34+]
I don't see a command-line switch to ask cabal-install to use a
different config file.
There's a '--config-file' option, see
https://github.com/haskell/cabal/issues/1113
is awesome.
--
Stephen Paul Weber, @singpolyma
See http://singpolyma.net for how I prefer to be contacted
edition right joseph
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell
is to be made for some platforms, we could opt to have Debian not
be such a platform.
--
Stephen Paul Weber, @singpolyma
See http://singpolyma.net for how I prefer to be contacted
edition right joseph
signature.asc
Description: Digital signature
___
Glasgow
Currently, we don't know how to do dynamic-by-default on Windows in
a satisfactory way. So I assume Windows is not one of the platforms that
would be seeing this change?
--
Stephen Paul Weber, @singpolyma
See http://singpolyma.net for how I prefer to be contacted
edition right joseph
Somebody claiming to be Ian Lynagh wrote:
On Tue, Nov 27, 2012 at 10:22:12AM -0500, Stephen Paul Weber wrote:
IIRC, one of the problems with dynamic linking in GHC is that when
the GHC version is different, the ABI can often be different enough
to making such shared libraries incompatible
complications arising from trying to build GHC using a cross-compiler for
bootstrapping (since that implies GHC acting as a cross-compiler at some
point in the bootstrapping).
Any suggestions would be very welcome.
--
Stephen Paul Weber, @singpolyma
See http://singpolyma.net for how I prefer
Thanks for all the replies. I guess I'll keep using my type class for now.
Paul
On Fri, Oct 26, 2012 at 9:25 AM, Adam Gundry adam.gun...@strath.ac.ukwrote:
Hi Paul,
On 25/10/12 16:22, Paul Visschers wrote:
Hello everyone,
I've been playing around with the data kinds extension
the repeat function so that it has the type 'repeat
:: a - Vector n a' that I've missed? If not, is this just because it isn't
implemented or are there conceptual caveats?
Paul Visschers
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
Would that also work for vectors that have their length in their type? And
while we are at it, how about overloaded tuples?
Paul
On Mon, Sep 24, 2012 at 7:19 PM, Simon Peyton-Jones
simo...@microsoft.comwrote:
| I remember a similar discussion a few years ago. The question of whether
Looks nice. Does it scale well to millions of elements, and can it handle
3D?
On Thu, Sep 6, 2012 at 12:37 PM, Alfredo Di Napoli
alfredo.dinap...@gmail.com wrote:
It seems cool, looking forward to play with it!
On 6 September 2012 09:42, Amy de Buitléir a...@nualeargais.ie wrote:
I'm
]: Functional Pearls: A Poor Man's Concurrency Monad, Koen Claessen, 1999
[3]: Combining Events And Threads For Scalable Network Services. Peng
Li and Steve Zdancewic. PLDI, 2007.
--
Regards,
Paul Liu
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
: haskell-cafe-boun...@haskell.org [mailto:haskell-cafe-
| boun...@haskell.org] On Behalf Of Paul Liu
| Sent: 30 August 2012 20:52
| To: Haskell Cafe
| Subject: [Haskell-cafe] why do I need class context in declaring data
| constructor?
|
| I had a toy program that encodes simply typed lambda
. It totally defeats the purpose of making class instances
to extend usage of data types.
Did I missed a language extension when moving code from GHC 7.0.3 to
GHC 7.2.2? What can I do to fix it for newer GHCs?
--
Regards,
Paul Liu
___
Haskell-Cafe
Hey Ertugrul,
You are absolutely right and the first item on my todo list is to add
better examples.
Paul
On Sun, Jul 22, 2012 at 5:24 AM, Ertugrul Söylemez e...@ertes.de wrote:
Hello there Paul,
Paul Visschers m...@paulvisschers.net wrote:
A couple of weeks ago I asked
shortly.
If you check it out, please comment on it and let me know if you want to
contribute. Since this is going to be my first release, any feedback is
welcome.
Paul Visschers
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
to work on it a bit
and then release it. Is anyone interested in such a library?
Paul Visschers
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I'm using the 0.5.1.0 binary package (i.e. Data.Binary/Data.Binary.Get) to
encode/decode a lazy bytestring. Unfortunately, decode/get are hanging,
possibly due to the underlying chunking logic in Data.Binary.Get.
The lazy bytestring is being populated from a socket (via socketTohandle
sock
Hi Miro!
I have no useful information for you. Few weeks ago I also checked for
any AI (machine learning first of all) related packages exist and
found nothing satisfactory except for some quite small packages
implementing a single algorithm (like NN-back-propagation). So there
is a lot to do :)
I had no problems building gmp-free GHC 7.4.1 for x86 Solaris
(Openindiana to be precise) and Mac OS X. Not as a part of Haskell
Platform, just compiler itself.
To be precise, there was a little problem under Solaris: make failed
complaining about loop in compilation. I removed this check from
vs git), based on the same idea, that would probably be more
suited for darcs website.
regards,
--
Paul
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
rule to
choose an other color and remove the underline (though it is good
practice to set it on mouseover)
cheers,
--
Paul
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hello Cafe!
I am using protocol-buffers and hprotoc packages but they fail to
compile with recent GHC due to trivial errors. Hackage names
Christopher Edward Kuklewicz as their maintainer. I've sent him
patches more than a month ago but neiter they were applied nor I got
any response. It's quite
at 7:26 PM, Vo Minh Thu not...@gmail.com wrote:
For what it's worth, I think he is active on stackoverflow.
Thu
Le 23 avril 2012 17:13, Johan Tibell johan.tib...@gmail.com a écrit :
On Mon, Apr 23, 2012 at 7:53 AM, Max Rabkin max.rab...@gmail.com wrote:
On Mon, Apr 23, 2012 at 15:01, Paul
On Thu, Apr 5, 2012 at 4:30 AM, Ertugrul Söylemez e...@ertes.de wrote:
Paul Liu nine...@gmail.com 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
anymore whithout changing callers as well.
I am curious what are interesting use-cases for that ? Symbolic
analysis ? self-compilers ?
--
Paul
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Thanks! I failed to notice this instance declaration in the document.
But I'm still curious as to whether a Monad instance for Source makes
any sense, since in 4.0 all of Source/Conduit/Sink would share the
same implementation.
Regards,
Paul Liu
On Tue, Apr 3, 2012 at 6:25 PM, yi huang
this is making switches obsolete. The idea of
switch is to completely abandoning the old state. See the broken
pendulum example.
--
Regards,
Paul Liu
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Is there any follow up on this?
I was wondering what is the best way to sequence a number of sources
together. Anybody gave a further thought on this?
Regards,
Paul Liu
On Tue, Dec 27, 2011 at 3:45 PM, Aristid Breitkreuz
arist...@googlemail.com wrote:
Hi all,
As you may have noticed, Michael
work. Thanks a lot
to everyone involved in them.
--
Paul
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
.
--
Paul
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Iavor report? My understanding is that the intention is that the
Iavor alphabet is unicode codepoints (sometimes referred to as
Iavor unicode characters).
Unicode characters are not the same as Unicode codepoints. What we want
is Unicode characters.
We don't want to be able to
Hi!
Thanks to all who responded! I got a lot of information to read and think about.
For now I decided to use stm-channelize as the simplest approach which
seem to be enough.
On Mon, Mar 5, 2012 at 9:50 PM, Alexander V Vershilov
alexander.vershi...@gmail.com wrote:
Hello.
I've also written
.
On Wed, Mar 7, 2012 at 9:38 PM, Sergei Trofimovich sly...@inbox.ru wrote:
On Wed, 7 Mar 2012 17:07:06 +0400
Paul Graphov grap...@gmail.com wrote:
Hello GHC-users!
I'm trying to compile GHC-7.4.1 under OpenIndiana and get the
following error all the time:
ghc.mk:85: *** Make has restarted
Hello GHC-users!
I'm trying to compile GHC-7.4.1 under OpenIndiana and get the
following error all the time:
ghc.mk:85: *** Make has restarted itself 2 times; is there a makefile
bug?. Stop.
I googled a bit and found that this can be a result of touching some
files during build. But actually
Hello Cafe!
I am trying to implement networked application in Haskell. It should accept many
client connections and support bidirectional conversation, that is not
just loop with
Request - Response function but also sending notifications to clients etc.
NB: I came from C++ background and used to
is there.
Daniel I look forward to your feedback,
Daniel Daniel
--
Paul
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
mistakes!
--
Regards, Paul Sujkov
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, but won't
optimize what I have at the moment.
However, I'll try to use it somehow. Maybe I misunderstand the mechanics.
Thanks a lot!
On 20 February 2012 16:06, Alex Gremm algr...@googlemail.com wrote:
Hi Paul,
even though I just started reading about Accelerate, it seems to me that
you
Yep. It doesn't help:
generateArray1 n = Acc.use $ Acc.fromList (Acc.Z Acc.:. n*n*n) [0..n*n*n]
still takes the same amount of time. I guess something's wrong elsewhere.
On 20 February 2012 16:06, Alex Gremm algr...@googlemail.com wrote:
Hi Paul,
even though I just started reading about
suggestions, it would be a great help!
On 20 February 2012 16:06, Alex Gremm algr...@googlemail.com wrote:
Hi Paul,
even though I just started reading about Accelerate, it seems to me that
you didn't use the use method which according to [1] initiates
asynchronous data transfer from host to GPU
optimizations, it would be deeply appreciated.
--
Regards, Paul Sujkov
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Sorry, I've forgotten to add a [Haskell-Cafe] tag for the message.
On 15 February 2012 19:33, Paul Sujkov psuj...@gmail.com wrote:
Hi everyone,
http://hpaste.org/63732
that's a very simple spellchecker application: it consumes standard Linux
dictionary, reads a file, and prints out words
1 - 100 of 1110 matches
Mail list logo
