Hi,
the last few days, I tried to get an IO-Event system running with GHC i.e.
trigger an IO action when there is data to read from a fd.
I looked at a few different implementations, but all of them have some
downside.
* using select package
- This uses the select syscall. select is rather
2015-10-07 21:17 GMT+02:00 David Turner <dct25-56...@mythic-beasts.com>:
>
>
> On 7 October 2015 at 18:16, Markus Ongyerth <ong...@gmail.com> wrote:
>>
>> 2015-10-07 18:30 GMT+02:00 David Turner <dct25-56...@mythic-beasts.com>:
>> > Hi,
>>
2015-10-07 18:30 GMT+02:00 David Turner :
> Hi,
>
> Why the non-threaded runtime, out of interest?
Mostly because i am used to the poll/select method I mentioned and that
one works without any threading.
I don't really mind using the threaded runtime though, it's
important way.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
?
--
Markus Läll
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
to them all is to use TH (as
already suggested :-).
A similar issue is printf, which handles the errors at runtime (though
I think there's a TH solution already existing for that).
On Tue, Apr 24, 2012 at 10:58 AM, Yitzchak Gale g...@sefer.org wrote:
Markus Läll wrote:
What can go wrong when you
.
Thanks,
Yitz
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
--
Markus Läll
___
Glasgow-haskell-users mailing list
need to compile-time parse it. As you will need a
compile-time parser for all such languages, then TH is the only
reasonable choice -- or isn't it?
On Tue, Apr 24, 2012 at 12:35 PM, Yitzchak Gale g...@sefer.org wrote:
Markus Läll wrote:
You do know, that you already *can* have safe Text
is meta-programming par excellence, which is what
Template Haskell is for -- use it.
If I have a correct understanding of what Yitz has in mind, then this
is why *I'm* having this argument. In all due respect, Yitz, correct
me if I've got something wrong!
* Parsing is a partial function.
--
Markus
/mailman/listinfo/glasgow-haskell-users
___
Glasgow-haskell-users mailing list
glasgow-haskell-us...@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
--
Markus Läll
___
Haskell
-extensions.html#overloaded-strings
On Sun, Apr 22, 2012 at 4:54 PM, Greg Weber g...@gregweber.info wrote:
Thanks Markus, I think you have saved the day!
Even after googling for this extension and searching in the manual I
am still coming up pretty blank.
Is there somewhere I missed where
?
-- Johan
___
Glasgow-haskell-users mailing list
glasgow-haskell-us...@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
--
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe
-cafe
--
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, however it's
interesting that Text has a function like that and not the String
functions in the standard
library.
-- Anupam
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Markus Läll
.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
)
--
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, or is a newtype the only way to do it?
--
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
://www.haskell.org/mailman/listinfo/haskell-cafe
--
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
This could be a nice feature and not hard to implement, maybe someone could
take it up?
2011/4/7 José Pedro Magalhães j...@cs.uu.nl
Yes, I have that tarball. I just don't know how to tell cabal-install to
use it. Going to each package, individually unpacking and installing it is
what I've
Check out unlines!
On Sat, Apr 2, 2011 at 4:32 PM, Manfred Lotz manfred.l...@arcor.de wrote:
Hi there,
I have a list of say type Record which I write to a file and
read back from the file if required.
The list's content is a single line in the file it doesn't matter how
many records the
) - (Integer,Integer) - Bool
(a,b) `lt` (c,d) = let
sum1 = (a + b)
sum2 = (c + d)
in if sum1 == sum2
then a c
else sum1 sum2
Implementing fromEnum looks like a bit harder problem..
--
Markus Läll
On Fri, Mar 4, 2011 at 5:12 AM, Daniel Fischer
daniel.is.fisc
I have been using Notepad++ -- it has proper (I think) syntaks highlighting
and in the latest version now has line wrapping a la kate: broken lines
start at the indent level of the first one.
--
Markus Läll
On Fri, Mar 4, 2011 at 1:14 AM, Daniel Fischer
daniel.is.fisc...@googlemail.com wrote
What about having the order by diagonals, like:
0 1 3
2 4
5
and have none of the pair be bounded?
--
Markus Läll
On 4 Mar 2011, at 01:10, Daniel Fischer daniel.is.fisc...@googlemail.com
wrote:
On Thursday 03 March 2011 23:25:48, Alexander Solla wrote:
On Thu, Mar 3, 2011 at 1:58 PM
the order of evaluation that IO monad forces
you to otherwise have.
Someone correct me if I'm wrong :)
--
Markus Läll
On Tue, Feb 15, 2011 at 8:08 AM, Alexander McPhail
haskell.vivian.mcph...@gmail.com wrote:
Hi list,
Could someone explain why the error pointed out by Luke occurred?
From
== that
all the apropriate functions exist.
And it is correct only that far -- the value-level coding is still up to
you, so no mind-reading...
--
Markus Läll
On Fri, Feb 11, 2011 at 1:16 PM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
On 11 February 2011 22:06, C K Kashyap ckkash
days ago.)
--
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi!
I'am trying to express a happstack component like the simplified one here:
https://gist.github.com/763597
What exactly is the problem for the compiler?
Is there a better way to describe such a abstract or parametrized component?
Regards
alios
function in another module and
import qualified, or
- write a typeclass with a 'name' function and fit the non-accessor
function 'name' somehow into that...
I think the best approach is the modular one, but this really depends on
what you are doing.
--
Markus Läll
On Thu, Dec 30, 2010 at 7:01 PM
as the central? I mean -- if we don't trust DNS,
then the main hackage has no special security advantages?
--
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
are just playing around and developing
things for themselves.
--
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Thu, Dec 9, 2010 at 11:04 PM, Richard O'Keefe o...@cs.otago.ac.nz wrote:
On 10/12/2010, at 12:18 AM, Markus Läll wrote:
My take on the issue is that we should make it possible to easily mirror
hackage (what the OP asked for), so that people could use it when they
wanted to, and have
by Alexey Khudyakov (which does type-level binary
encoding(!) for natural numbers)
As for the terminology, I can't tell..
Out of intrest, is this kind of type-level stuff to prove things about
your container types and operations on them?
--
Markus Läll
On Mon, Oct 25, 2010 at 12:52 PM, Patrick Browne
by
the constructor `Foo' at /home/alios/src/lab/Scratch.hs:7:14
In the second argument of `(==)', namely `b'
In the expression: a == b
In the definition of `==': (Foo a) == (Foo b) = a == b
Failed, modules loaded: none.
-}
snip
thnx
Markus
Hi Michael,
although I never used it myself, lists seem strange in the way that when
combining list monads, then all the values go through the chain one by one
-- x will be 1 first, then 2, then 3 and so on.. Try it out, to see. (I
think the result is then also a list of all combinations of
).
Since I am at the very start, I would appreciate further literature
advices. In addition, does anybody know particular people who are
familiar with this topic?
Any answer is appreciated :-)
Regards, Markus
___
Haskell-Cafe mailing list
Haskell
Yep, the test is done by a rookie. If I get more time, I'll try to
look into testing a little more, and redo the timing (if anyone
doesn't do it firs) -- using optimizations, more runs per function and
the criterion package.
___
Haskell-Cafe mailing list
it too late and didn't
want to restart... At least for the last two functions it showed a
similar difference in seconds as with no -O2)
Markus Läll
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
)= a:c:e:rest
matchPattern10 (a:_:c:_:rest) = a:c:rest
matchPattern10 (a:_:rest) = a:rest
matchPattern10 (rest) = rest
On Wed, Jun 9, 2010 at 11:47 PM, Markus Läll markus.l...@gmail.com wrote:
So out
I would be intrested in seeing this! Could you paste or upload it somewhere?
2010/5/24 C. McCann c...@uptoisomorphism.net:
2010/5/23 Günther Schmidt gue.schm...@web.de:
is there anybody currently using Haskell to construct or implement a query
language?
I've a half-baked, type-indexed (in
On Thu 08.01 12:22, Simon Marlow wrote:
Markus Barenhoff wrote:
On Mon 15.12 09:26, Simon Marlow wrote:
Yesterday I updated my sources to the current darcs version. Now the build
works
again, but there still seems to exist a problem with memory allocation:
--- snip ---
$ ghci
GHCi
NCOW NNC default -
0x7fbff000 0x7fc0 0 0 0 --- 0 0 0x0 NCOW NNC none -
0x7ffe 0x8000 3 0 0xff00061704e0 rwx 1 0 0x2100 NCOW NNC
default -
--- snip ---
Regards
Markus
--
Markus Barenhoff - Münster - Germany - Europe - Earth
pgpPa5oBuexNi.pgp
Description: PGP
/ghc/ghc'
gmake: *** [bootstrap2] Error 2
Regards
Markus
--
Markus Barenhoff - Langemarckstr. 18 - D-48147 Münster - Germany - Europe -
Earth
Tel. +49-251-3956651 - Mob. +49-173-7215776 - e-mail: al...@alios.org
jabber: al...@jabber.ccc.de - icq: 27998346
pgpblKr602QIa.pgp
Description: PGP
On Fri 28.11 09:42, Simon Marlow wrote:
Markus Barenhoff wrote:
On Thu 27.11 09:49, Simon Marlow wrote:
Hi!
I checked out and translated the head version of ghc today from darcs.
It compiled fine. When I now try to start the ghci I get the following:
snip
GHCi, version
On Thu 27.11 09:49, Simon Marlow wrote:
Brandon S. Allbery KF8NH wrote:
On 2008 Nov 26, at 9:30, Markus Barenhoff wrote:
Because the ports seem not to get updated, I tried to compile ghc 6.10.1
under freebsd 7 on amd64 myself. For compiling I first used the ports ghc
The tree's not being
problems?
Any ideas?
Thnx and regards
Markus
pgpYevBnlAqWV.pgp
Description: PGP signature
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
Title: Nachricht
try
fromInt = fromInteger . toInteger
Markus
--
Markus
Schnell
-Ursprüngliche Nachricht-Von:
[EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] Im Auftrag
von StenioGesendet: Dienstag, 16. März 2004 10:29An:
Ketil MaldeCc: [EMAIL PROTECTED]Betreff: Re
and for some days now
Markus Schnell
-Ursprüngliche Nachricht-
Von: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] Im Auftrag von Gour
Gesendet: Freitag, 12. März 2004 14:53
An: [EMAIL PROTECTED]
Betreff: Re: [Haskell-cafe] Haskell overview
MR K P SCHUPKE ([EMAIL PROTECTED
try using (sudo) gcc-select 2
Cheers,
Markus
-Ursprüngliche Nachricht-
Von: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] Im Auftrag von Thomas Davie
Gesendet: Donnerstag, 20. November 2003 02:07
An: [EMAIL PROTECTED]
Betreff: GHC and Panther (Mac OS X 10.3)
Hi,
I've just
would be heartily welcome.
Cheers,
Markus
--
Markus Schnell
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
?
A clarifying sentence or two would be heartily welcome.
Cheers,
Markus
--
Markus Schnell
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
___
Haskell mailing
Thank you, Ralf.
Curiosity satisfied. :)
Markus
--
Markus Schnell
There is just one Generic Haskell project
even though the actual language extension is a moving target of course
because this is an active project.
The boilerplate approach is about lightweight generic programming
would be
tedious. But _viewing_ programs this way could be advantagous.
What do you think?
Best wishes,
Markus
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
and 'everywhere (mkT f) seg' would also jump into the attributes,
which is waisted effort.
-- Markus
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
There is updateable syntax.
You can write
setSquare :: DiningRoom - Int - DiningRoom
setSquarer n = r { square = n }
HTH,
Markus
-Ursprüngliche Nachricht-
Von: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] Im Auftrag von Serge D.
Mechveliani
Gesendet
in the segmap function,
while using a self-written map on the structure was much faster.
I didn't keep records, though.
Perhaps the boilerplate people (Ralf Lämmel, Simon PJ) have already
looked at performance issues?
If you stayed with me, thank you for your time.
Markus
=== Approach
are barely mentioned in the Haskell
books/tutorials, but they are a real burden if you want to run
programs for larger problems.
A tutorial on this by one of the experts would be very welcome.
:-)
Thanks,
Markus
-Ursprüngliche Nachricht-
Von: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] Im
, Olympia, WA,
August 1996. Springer LNCS Vol. 1129.
Great! I knew only the more compiler-oriented Runciman/Röjemo papers.
(Which were already helpful, but not very 'tutorial'.)
Thanks,
Markus
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http
the equivalent of statement in '0x0058db43' points
to memory in '0xfffc'. Could not read.)
Cheers,
Markus
--
Markus Schnell
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi Graham,
Instead, I replace the class instances by a single algebraic
data type,
whose members are functions corresponding to OO-style class methods.
could you give an example?
Thanks,
Markus
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http
the laws. That is your
sole responsibility.
what is intended in that ==? Eq.== for
You can define it to your liking as long as it is commutative.
HTH,
Markus
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
in parallel.
Make your code testable from the beginning. That will lead to a more
flexible
design also.
(In a perfect world I would follow this advice myself... ;-))
Cheers,
Markus
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org
.
You have to SEE the structure of the code.
That depends very much on what your program does.
No rules of thumb. Experience and experiments will do.
(That was taken *directly* out of my convoluted brain and
may be totally dumb.)
Markus
--
Markus Schnell
Infineon Technologies AG, CPR ET
Tel +49
, I have to understand it - this may take a
while... :)
But I'm not sure if it's suitable for what I'm doing, as the attributes
get inserted at run time, and not all of them appear everywhere. So
Maybe is quite natural here.
Markus
___
Haskell mailing
problems are just around the corner ...
Thank you.
Markus
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
where deCat (Just (Cat c)) = c
deCat x = x
...
Does anyone have some suggestions for making this more concise?
Generic Haskell? Tricky type classes?
Thanks,
Markus
--
Markus Schnell
Infineon Technologies AG, CPR ET
Tel +49 (89) 234-20875
and it worked
very well (for me).
I hope this is a sensible idea.
Markus
--
Markus Schnell
Infineon Technologies AG, CPR ET
Tel +49 (89) 234-20875
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
(BinaryMode ReadMode)
inputtext2 - hGetContents handle3
handle4 - openFileEx outputfile (BinaryMode WriteMode)
hPutStr handle4 (inputtext ++ extra2)
Here's my guess: You open outputfile four times but never close it.
Markus
Yes, this would work, thanks.
But let me extent my question: what if all the types would be in a
class FakeClass which has function specialID :: a - ID and
I would like to do
foo $ map specialID [a,b,c,d]
?
___
Haskell mailing list
[EMAIL PROTECTED]
.
Is there a nice solution?
Markus
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
the forall. What does it do?
How do I have to read a type definition with foralls? Or more
concrete: What is the difference between
(forall b. Term b = b - b) - a - a
and
(Term b) = (b - b) - a - a
?
Markus
___
Haskell mailing list
[EMAIL PROTECTED
Thanks! These examples and counterexamples help a lot
in understanding.
Markus
The reason is that sum only works on integer lists, whereas the given
type for fun requires that the first argument be a function that works
on lists of any type, such as length.
If sum were allowed as argument
I think you are looking like something done in the
HTML-Combinator-libraries.
I tried something like that some time ago, but didn't finish. But perhaps
you
can get an idea from that. See the files with this mail. (The code is in
unknown condition.)
Markus
ah, yes. i was aware that would work
Does the zipper fall into this category?
http://haskell.org/wiki/wiki?TheZipper
Markus
You might also find the 'cast' function in Section 3 of Scrap your
boilerplate useful.
http://research.microsoft.com/~simonpj/papers/hmap/
I'm not certain, but it has the right smell.
Simon
I put some points together of how one can integrate Haskell with a Mac OS X Cocoa
application:
http://www.markusschnell.com/cocoa_howto.html
Perhaps some Mac-Users can comment on it.
Thanks,
Markus
--
Markus Schnell
I would recommend reading the variables in the main
and pack the rest of your program into a monad.
But only if you really need to access the variables
from everywhere and don't want to pass them around
explicitely.
Markus
I need to be able to access these values effieiently and from
virtually
++ tail tl)
where (idx, gen') = randomR (0,length xs - 1) gen
(hd, tl) = splitAt idx xs
Markus
--
Markus Schnell, Infineon Technologies AG
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Try the November release of Hugs with the +N option.
Well, now Hugs and ghc show the same behaviour for my program:
they don't parse my doc, even with the same error.
But the +N does not work: it says
New hierarchical libraries not found along search path; ignoring +N
toggle.
I tried adding
do I avoid writing different Code for Hugs
and ghc?
For example, I had to hide Word in Hugs with
import Prelude hiding (Word)
but was not allowed to do that with ghc. I ended up using Wort.
Why the difference?
Markus
___
Haskell mailing list
[EMAIL
).
Any ideas, suggestions?
Markus
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
versions for your
programs. Have a look at it, comments (or better versions) are welcome.
Markus
--
Markus Schnell
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
purely in Haskell with the Binary module, but
I never was sure which of the many was working on my Mac. So I didn't really
try. (Can anybody comment on that?)
Markus
-Ursprüngliche Nachricht-
Von: Immanuel Litzroth [mailto:[EMAIL PROTECTED]]
Gesendet am: Montag, 27. Januar 2003 11:55
$ cc -c cfile.c
$ ghc -o myprog Main.hs cfile.o
won't you need -fffi also?
Markus
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
should have layout rules anyway.
Perhaps somebody could come up with a Haskell indent (part of a pretty
printer?)?
Markus
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
there, but - as someone already pointed out - I don't
want to need a math major to read a paper regarding programming. This
doesn't mean there is something wrong with these papers, it's just that
I wished there would be more accessible versions.
Hope to got my point across,
Markus
--
Markus
Has anybody tried to implement (typed) feature structures in Haskell with
unification?
I'm trying to build my own library, but if there is already support for it,
I would consider using this alternative.
Thanks,
Markus
--
Markus Schnell
Speech Interface Group, Infineon Technologies AG
Tel
: previous declaration of
'GHCziTopHandler_runIO_closure'
Using ghci or compiling with -O2 doesn't show this error.
Any ideas what's wrong?
Thanks,
Markus
By the way, if there is a list more suited for the subject, please tell me.
___
Haskell mailing list
Hi,
as the posix module isn't avalible under windows, is there any function to
set the modification time of a file or directory under windows with ghc?
Thanks,
Markus Lauer
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http
of
FooList for every a in that is in class Foo?
Thanks for any hint,
Markus
--
Markus Lauer [EMAIL PROTECTED]
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Hi,
I compiled ghc-5.00 from the source distribution
(config --prefix=.; make; make install).
when I call ghci I get
ghc-5.00: not built for interactive use
Is there anything special to enable GHCi?
My System is Suse Linux 7.0 Kernel 2.2.16 i686 unknown.
Thanks
Markus
--
Markus
an existing ghc-4.08.1 installation to compile. I would have
tried to compile with an ghc-4.08.2 compiler build from the x86 HC files,
but the donload link for the HC files doesn't work.
Markus
--
Markus Lauer [EMAIL PROTECTED]
___
Glasgow-haskell-bugs mailing
92 matches
Mail list logo