On 2009 Feb 26, at 18:50, Galchin, Vasili wrote:
1) I noticed there is no open function in Data.ByteString. So
when I call writeFile or readFile is there an implicit open?
Correct; they're modeled after the writeFile and readFile functions in
System.IO.
2) For both readFile and
On 2009 Feb 26, at 23:16, Galchin, Vasili wrote:
h but at work I am surreptitiously writing in Haskell to
test firmware and the platform in Windows XP, Brandon. So if I want
something other than the default port configuration I am out of
luck? (the default is 9600, ??,??,??)?
I
On 2009 Feb 26, at 23:41, Achim Schneider wrote:
Brandon S. Allbery KF8NH allb...@ece.cmu.edu wrote:
On 2009 Feb 26, at 16:45, Johan Tibell wrote:
definition of `recv` would look like. My current thinking is that it
would mimic what C/Python/Java does and return a zero length
ByteString when
On 2009 Feb 26, at 23:45, Galchin, Vasili wrote:
I have forgotten about RS232 protocol. Can I just reads and
writes from the RS232 device from an application to handle data? Or
do I need to handle RS232 protocol events in the application?
Usually the OS handles protocol events,
On 2009 Feb 26, at 23:58, Galchin, Vasili wrote:
i.e. protocol events seem to leak into an application = yuck
On Thu, Feb 26, 2009 at 10:57 PM, Galchin, Vasili
vigalc...@gmail.com wrote:
I already looked at MSDN examples and am not seriously enccouraged ;^(
So, next stop: look for a
On 2009 Feb 25, at 5:23, John Lato wrote:
Brandon Allbery wrote:
I have to second this; I'm a Unix sysadmin, 98% of the time if I'm
writing a program it's for Unix *and* requires POSIX APIxs, and even
if it could apply to Windows the program needed there would be very
significantly different.
On 2009 Feb 25, at 18:06, Manlio Perillo wrote:
Debian some time ago introduced the popularity context, to find the
most installed/used packages:
http://popcon.debian.org/
Is it possible to do something similar with Cabal?
I believe that's a planned feature for Hackage.
--
brandon s.
On 2009 Feb 21, at 20:47, Jonathan Cast wrote:
On Sat, 2009-02-21 at 07:25 -0700, John A. De Goes wrote:
Not showing platform-specific packages by default *might* make
package
writers more likely to develop cross-platform packages. We've heard
many times someone say, I don't know if it works
On 2009 Feb 21, at 18:59, Don Stewart wrote:
http://haskell.org/haskellwiki/Protect_the_community
Random notes on how to maintain tone, focus and productivity in an
online community I took a few years ago.
http://shirky.com/writings/group_enemy.html A group is its own worst
enemy
--
On 2009 Feb 23, at 11:26, Andrew Wagner wrote:
Modified. Is this how you want it to show?
That works, yes.
--
brandon s. allbery [solaris,freebsd,perl,pugs,haskell] allb...@kf8nh.com
system administrator [openafs,heimdal,too many hats] allb...@ece.cmu.edu
electrical and computer engineering,
On 2009 Feb 21, at 16:14, Daniel Peebles wrote:
http://haskell.org/haskellwiki/Twitter. Please update with yourself or
any other Haskellers we may have missed.
Since I can't create an account to fix my entry:
(1) my name is misspelled
(2) partly to synchronize my accounts and partly to try to
On 2009 Feb 19, at 13:19, Svein Ove Aas wrote:
If you say so, but..
Unix domain sockets?
sendFd?
I can't speak to sendFd, but BITD OS/2 had AF_LOCAL (the portable
version of AF_UNIX; same API) sockets. There's no particular reason
aside from unwillingness that Windows wouldn't support
On 2009 Feb 15, at 11:50, Peter Verswyvelen wrote:
I could try to read the article a couple of times again, but are
there any other good readings about these existentially quantified
types and how the ST monad works?
You could think about it as playing a dirty trick on the typechecker.
On 2009 Feb 15, at 15:22, Colin Paul Adams wrote:
Can this be done with Haskell? In particular, I'm using ghc 6.10.1.
Can I get symbols for use with gdb, for instance
gdb would be extremely painful; the flow of execution in lazy
languages is unusual.
ghci from 6.8.1 on has an interactive
On 2009 Feb 12, at 11:55, Cristiano Paris wrote:
import Control.Monad.Trans -- why do I have to import this?
liftIO is defined there, I believe. Many of the monad modules re-
export it with their MonadTrans definitions, but apparently
Control.Monad.CC doesn't so you need to go to the
On 2009 Feb 12, at 1:04, wren ng thornton wrote:
It's ugly, but one option is to just reify your continuations as an
ADT, where there are constructors for each function and fields for
each variable that needs closing over. Serializing that ADT should
be simple (unless some of those
On 2009 Feb 5, at 10:26, Eugene Kirpichov wrote:
My benchmark (parsing a huge logfile with a regex like GET
/foo.xml.*fooid=([0-9]++).*barid=([0-9]++)) shows that plain PCRE is
the fastest one (I tried PCRE, PCRE-light and TDFA; DFA can't do
capturing groups at all, TDFA was abysmally slow
On 2009 Feb 5, at 9:44, Peter Verswyvelen wrote:
2) modify .hgignore to make sure only these files are added that are
part of the project. I want this process to be automated, I don't
want to check each time which files to add, since this is error prone.
.darcs/prefs/boring (regexes of
On 2009 Feb 1, at 17:49, Erik de Castro Lopo wrote:
The following code creates a symbolic link in the current directory
and then uses System.Posix.Files.getFileStatus to get the status of
the link.
However, isDirectory returns True and isSymbolicLink returns False
which is very different from
On 2009 Feb 2, at 15:27, minh thu wrote:
Thanks. Could you add to your explanation this one :
*Graph typeRepArgs (typeOf (+))
[Integer,Integer - Integer]
The actual representation of an n-argument function in Haskell is a
single-argument function that returns an (n-1)-argument function.
On 2009 Feb 2, at 17:45, Marc Weber wrote:
Or would it be better to implement one String class which can cope
with everthing (performance will drop, won't it?)
There is already an IsString class, although IIRC it deals solely with
converting String to/from a member of IsString. Most of the
On 2009 Jan 31, at 20:28, Marc Weber wrote:
tmp %./test1
/tmp nixos
ALERT test, should be shown and should create the sublogger
ALERT test, should not be shown cause we have changed to EMERGENCY
which is quite confusing because I haven't told hslogger explicitely
to use a log level printing
On 2009 Jan 28, at 0:15, Benjamin L.Russell wrote:
Although a GUI interface makes little difference to most UNIX/Linux
users, for some Haskell beginners in the Windows/OS X world, the
availability of a GUI interface could make the experience more
appealing, especially at first.
Given that some
On 2009 Jan 25, at 6:57, Krzysztof Skrzętnicki wrote:
When you succeed please write about it - I'd love to read about it!
I was interested in writing a deamon in the past but didn't have
time for it and a nice tutorial would probably help a lot.
I should mention that the easiest way to write
On 2009 Jan 21, at 21:13, Thomas DuBuisson wrote:
ioctl(3, SNDCTL_TMR_TIMEBASE or TCGETS, 0x77470b70) = -1 ENOTTY
(Inappropriate ioctl for device)
This is just the test for buffering: terminal-like devices (TCGETS)
are line buffered, others are block buffered.
select(4, [3], [],
On 2009 Jan 22, at 10:09, Andrew Wagner wrote:
See, that's the kind of name we need!
StructureWithAssociativeOperationAndIdentity -- make both the
mathematicians AND the non-mathematicians mad!
SimpleArithmetic (you have numbers and a single arithmetic
operation on them). You can play
On 2009 Jan 22, at 1:36, Belka wrote:
Could somebody please share some experience on how to implement
daemon start
and stop directives. In theory I need something like this:
1. my_daemon start - starts my app with an infinite loop of serving
inside.
2. my_daemon stop - puts in some TVar a
On 2009 Jan 22, at 3:11, Belka wrote:
Actually, I'm more interested in technical details how to
communicate from
shell with background process - how to send commands to it. Currently
looking into POSIX libraries hope to find answers there...
Also, maybe a FIFO-pipe-file would solve my problem.
On 2009 Jan 23, at 17:58, Olex P wrote:
class Vector v where
(^+^) :: v - v - v
class Matrix m where
(^+^) :: m - m - m
You can't reuse the same operator in different classes. Vector
owns (^+^), so Matrix can't use it itself. You could say
instance Matrix m = Vector m
On 2009 Jan 19, at 3:47, Neil Mitchell wrote:
Is there a Haskell-Expect module? Something that would allow me to
control an external Unix program via its stdin/stdout/stderr?
System.Process does what you want, I think:
On 2009 Jan 18, at 13:47, Matti Niemenmaa wrote:
3. Coadjute keeps track of command line arguments (see docs for
details): for me this is really a killer feature, I don't know of
anything else which does this.
It's been done many times before; it never seems to catch on. My
On 2009 Jan 15, at 5:57, Manlio Perillo wrote:
Brandon S. Allbery KF8NH ha scritto:
On 2009 Jan 14, at 9:02, Manlio Perillo wrote:
This is of course a personal opinion, but I think the interface of:
fileAccess :: FilePath - Bool - Bool - Bool - IO Bool
http://haskell.org/ghc/docs/latest/html
On 2009 Jan 15, at 5:55, Manlio Perillo wrote:
Brandon S. Allbery KF8NH ha scritto:
[... about Python import local to functions ...]
Sometime they are necessary, to avoid circular import problems
(but this not a problem with Haskell).
...in theory. In practice GHC needs help with circular
On 2009 Jan 14, at 9:02, Manlio Perillo wrote:
This is of course a personal opinion, but I think the interface of:
fileAccess :: FilePath - Bool - Bool - Bool - IO Bool
http://haskell.org/ghc/docs/latest/html/libraries/unix/System-Posix-Files.html#v
:fileAccess
is not very good.
The
On 2009 Jan 14, at 10:26, Neil Mitchell wrote:
As an example:
foo = uabc\N{VULGAR FRACTION ONE HALF}
Hmm, looks nice, and sensible. But as soon as you've got \N{}
syntax I want:
foo\E{show i}bar
i.e. embed expressions in strings. I think this would be fantastic.
why not simpy
On 2009 Jan 14, at 10:39, Manlio Perillo wrote:
Neil Mitchell ha scritto:
Hi
1) In a Python string it is available the \U{name} escape, where
name is
a character name in the Unicode database.
As an example:
foo = uabc\N{VULGAR FRACTION ONE HALF}
Hmm, looks nice, and sensible. But as
On 2009 Jan 13, at 18:54, Sjoerd Visscher wrote:
It is not impossible, but a lot of work. And if you want to do it
correctly you would have to support UTF-16 (BE of LE) and UTF-32 (BE
of LE) as well. You can't expect someone to start writing utf
encoders and decoders every time he needs a
On 2009 Jan 10, at 15:19, Peter Verswyvelen wrote:
h3 x = f x ^(+)^ g x
Is that an operator or Batman?
(yes, I know, 3 operators)
--
brandon s. allbery [solaris,freebsd,perl,pugs,haskell] allb...@kf8nh.com
system administrator [openafs,heimdal,too many hats] allb...@ece.cmu.edu
electrical and
On 2009 Jan 9, at 20:51, Tim Newsham wrote:
I'm suprised htonl comes up so often. You can unmarshall data
directly from a byte stream to an Int type without caring about the
underlying representation of your Int. Why do people want the htonl
function?
IP address math. (see @ipcalc in
On 2009 Jan 7, at 20:58, Phil wrote:
-- 124353542542 is just an arbitrary seed
main :: IO()
main = do
let x = evalState getRanq1 (ranq1Init 124353542542)
print (x)
You're throwing away the state you want to keep by using evalState
there. But you're also missing the point of
On 2009 Jan 5, at 13:57, David Menendez wrote:
2009/1/5 Ross Mellgren rmm-hask...@z.odi.ac:
If for some reason you absolutely need to avoid parentheses (mostly
as a
thought exercise, I guess), you'd have to have a flipped version of
intercalate:
Or a version of ($) that associates
On 2009 Jan 1, at 16:44, Henning Thielemann wrote:
If it is generally possible to use unsafeInterleaveIO such that it
executes actions in the right order, wouldn't this allow the
definition
of a general lazy IO monad?
I thought unsafeInterleaveIO and users of it (readFile, hGetContents)
On 2009 Jan 1, at 19:28, Kevin Van Horn wrote:
Haskell has been around in one form or another for nearly two
decades now, yet has never been extended with explicit support for
object-oriented programming. I've
http://homepages.cwi.nl/~ralf/OOHaskell/
On 2009 Jan 1, at 20:08, David Menendez wrote:
On Thu, Jan 1, 2009 at 7:39 PM, Achim Schneider bars...@web.de
wrote:
There are no lazy monads. Monads imply explicit sequencing...
Huh? How are you defining lazy monad?
We've had this discussion before; somewhere in the archives is an
On 2009 Jan 1, at 2:32, Max.cs wrote:
data Tree a = a | Branch (Tree a) (Tree a) deriving Show
but it seems not accpetable in haskell ?
You need a constructor in both legs of the type:
data Tree a = Leaf a | Branch (Tree a) (Tree a) deriving Show
--
brandon s. allbery
On 2008 Dec 29, at 23:27, Justin Goguen wrote:
My purpose is to have operations such as [aa..bc] be possible,
with its
result being [aa, ab, ac ..snip.. ba, bb, bc]
The example you provided for fromEnum seems to break down after a
string length
of about 5 or so.
It will; toEnum and
On 2008 Dec 28, at 5:59, Galchin, Vasili wrote:
no Martijn ... I am using ghci ... not Hugs
On Sun, Dec 28, 2008 at 4:02 AM, Martijn van Steenbergen mart...@van.steenbergen.nl
wrote:
It might be because you're looking at Hugs docs while using GHC.
Galchin, Vasili wrote:
On 2008 Dec 28, at 17:22, frantisek kocun wrote:
We present techniques for incremental computing by introducing
adaptive functional programming.
As an adaptive program executes, the underlying system represents
the data and control
dependences in the execution in the form of a dynamic
On 2008 Dec 27, at 12:42, Galchin, Vasili wrote:
Not in scope: `Data.ByteString.join'
Why are you trying to use join? It's not a string function; it's a
function on lists which accidentally does something useful on normal
Strings because they're implemented as lists. ByteStrings aren't
On 2008 Dec 27, at 15:16, Cristiano Paris wrote:
On Sat, Dec 27, 2008 at 4:50 PM, Hans van Thiel
hthiel.c...@zonnet.nl wrote:
However, some functions in Haskell may have side effects, like
printing
something on the screen, updating a database, or producing a random
number. These functions
On 2008 Dec 17, at 8:42, Darrin Thompson wrote:
X monad could have a variant of this logo too. X= (That's how I
originally thought of it, just was too lazy to post it anywhere. Sorry
about that.)
Or just a lambda with an extra contrasting stroke to make an X (λ'
very roughly, if you have
On 2008 Dec 19, at 4:13, Lennart Augustsson wrote:
When accurate names for Haskell concepts already exist we should use
them (as we have tried in the past). There has been too much
invention of misleading terminology in computing already. If some
people can't handle things having the right
On 2008 Dec 21, at 16:47, Don Stewart wrote:
redcom:
The long running process is pretty atomic, it's a single query to the
database which takes up to a minute to complete so I don't see a
chance to
squeeze a mainIteration in there.
How are you compiling this code (-O -threaded ?) and what
On 2008 Dec 20, at 20:20, Brian Hurt wrote:
class Fooable a where
toFoo :: a - Foo
or I can simply have all the functions which need a toFoo take an
extra
agrument. Performance really isn't that important here, so it's
really
a matter of style- which approach would people prefer in this
On 2008 Dec 20, at 20:35, Brian Hurt wrote:
We should be so lucky. My deepest fears is that Haskell doesn't
become popular *and* it's ideas aren't picked up by other languages.
No worries: they *are* being picked up, piece by piece.
--
brandon s. allbery
On 2008 Dec 18, at 5:47, Bulat Ziganshin wrote:
ruby doesn't support coroutines, but only iterators (where control
moved from caller to callee). usually control is on the caller side,
and coroutines gives control to both (or many) sides
Right, and you don't normally do iterators in Haskell;
On 2008 Dec 18, at 9:13, John Goerzen wrote:
Some ideas in Haskell are easy to integrate into other languages: see
list comprehensions in Python. I don't see Perl picking up pervasive
laziness anytime soon, nor Python compile-time type inference.
I think perl6 is specced with pervasive
On 2008 Dec 18, at 11:47, Paul Moore wrote:
2008/12/18 Brandon S. Allbery KF8NH allb...@ece.cmu.edu:
On 2008 Dec 18, at 9:13, John Goerzen wrote:
Some ideas in Haskell are easy to integrate into other languages:
see
list comprehensions in Python. I don't see Perl picking up
pervasive
On 2008 Dec 17, at 16:39, Andrew Coppin wrote:
So I keep hearing. Unfortunately, discovering what FRP actually
*means* is more or less impossible. I can't find a precise
definition of the term anywhere. There are a small handful
That would be because it's still very much an open area of
On 2008 Dec 14, at 16:50, sam lee wrote:
http://i35.tinypic.com/mjon83.png
used this: http://www.simwebsol.com/ImageTool/Default.aspx
Win from the visually interesting angle, but massive lose from the
legibility angle.
--
brandon s. allbery [solaris,freebsd,perl,pugs,haskell]
On 2008 Dec 11, at 10:28, Mauricio wrote:
and obviously a C compiler is entitled to return a small struct
in registers if it feels like it.
If a compiler is compiling code that calls a library, how is it
supposed to know if a return pointer is been passed as a register
or by using a pointer?
On 2008 Dec 9, at 20:21, Maurí cio wrote:
Why can ghc read the program, but not the standard
library parser? Does ghc use something else?
Is it possible to use whatever ghc uses to build
a prettyprinter?
Language.Haskell is known to be incomplete. The haskell-src-exts
package on
On 2008 Dec 6, at 18:13, Simon Michael wrote:
I don't yet know what a hylomorphism is and thought your pointless-
haskell package might be one of those semi-joke projects, but now I
wonder if it's something that I'll need in order to use (G)Hood with
real-world code.
Not a joke.
People
On 2008 Dec 2, at 2:48, Andy Stewart wrote:
,
| * The following packages will be built:
| *
| * glib : yes
| * gtk : yes
| * glade : no
| * cairo : yes
| * svgcairo : no
| * gtkglext : no
| * gconf : no
| * sourceview: no
| * mozembed
On 2008 Dec 2, at 14:44, Andrew Coppin wrote:
Regardless, it has been my general experience that almost everything
obtained from Hackage fails miserably to compile under Windows.
(IIRC, one package even used a Bash script as part of the build
process!) I haven't seen similar problems on
On 2008 Dec 1, at 8:28, Andrew Wagner wrote:
Hm, I've been thinking about this this morning as I've gone about my
commute. I could indeed imagine a class like the following that had
multiple implementations like you're talking about:
One can indeed --- but it turns out to be even more
On 2008 Dec 2, at 0:38, Ben George wrote:
$ghc file.hs
compilation IS NOT required
byteindex.o: In function `sKE_info':
(.text+0x8bf): undefined reference to
`__stginit_utf8zmstringzm0zi3zi3_SystemziIOziUTF8_'
collect2: ld returned 1 exit status
Use ghc --make so it looks up the dependencies
On 2008 Dec 2, at 1:50, Andy Stewart wrote:
BTW, i want to know the details compatible problem between 6.8 with
6.10?
Is most libraries have compatible with GHC 6.10.1?
The compatibility issue is mainly that GHC 6.10 ships with base-4.0,
which as with past major revisions is not
On 2008 Nov 30, at 12:43, Max Rabkin wrote:
On Sun, Nov 30, 2008 at 9:30 AM, Luke Palmer [EMAIL PROTECTED]
wrote:
cross :: [a] - [b] - [(a,b)]
It's just kind of a pain (you build [(a,(b,(c,d)))] and then flatten
out the tuples). The applicative notation is a neat little trick
which does
On 2008 Nov 29, at 20:02, John Meacham wrote:
Oh golly. I never put DrIFT on cabal, apparently whomever tried to
cabalize it didn't include the ghc driver script, and also appeared to
just drop the documentation from the package altogether. It is things
like that that make it very hard to get
On 2008 Nov 26, at 16:58, Matthias Kilian wrote:
On Wed, Nov 26, 2008 at 09:35:01PM +, Andrew Coppin wrote:
It is a fork of the JHC compiler, which should be easier to look up.
There is also Hugs, as you mentioned. In addition, you may want to
look at YHC and NHC.
Yeah, the
On 2008 Nov 27, at 8:51, Simon Marlow wrote:
Brandon S. Allbery KF8NH wrote:
On 2008 Nov 10, at 19:04, Jason Dusek wrote:
simple exe bytes args= do
(i, o, e, p)- runInteractiveProcess exe args Nothing
Nothing
hPut i bytes
s - hGetContents o
hClose i
On 2008 Nov 24, at 17:06, Greg Meredith wrote:
Now, are there references for a theory of monads and take-out
options? For example, it seems that all sensible notions of
containers have take-out. Can we make the leap and define a
container as a monad with a notion of take-out? Has this been
On 2008 Nov 18, at 17:55, Kyongho Min wrote:
I am working on a command-driven tool (::IO ()).
If the system invokes itself again, and the system's returned
data type would be 'IO a', say (IO Exp) (Expression).
tool:: a - IO()
The nested tool invocation returns (IO Exp) to the previous tool.
I
On 2008 Nov 18, at 21:23, Warren Harris wrote:
However, each of the clauses is actually an output routine to send
the expression that it denotes to a remote server, and a parser for
receiving the results. Since a clause is really a pair of
operations, it doesn't seem possible to formulate a
On 2008 Nov 12, at 5:38, Alberto G. Corona wrote:
Is there any abstract container that permits the addition of new
types of data? I know how to simulate the extension of Algebraic
datatypes, but this does not permit the addition of data with new
types in the same container and recover
On 2008 Nov 10, at 16:29, Jason Dusek wrote:
I've put together a simple test case for a rather annoying
problem. I've got a program that drives other programs. For
example, it can drive `cat`:
:; Simple cat a-file
When the file is a little bit greater than 135060 bytes, this
program fails
On 2008 Nov 10, at 19:04, Jason Dusek wrote:
simple exe bytes args= do
(i, o, e, p)- runInteractiveProcess exe args Nothing
Nothing
hPut i bytes
s - hGetContents o
hClose i
return s
Yep, that's your problem. forkIO the hPut.
Maybe I
On 2008 Nov 4, at 19:12, Jason Dusek wrote:
Many useful programs that I would like to write in Haskell
don't fall into this category -- for example, network servers
-- but a lot of their components do. Can these components can
be Haskell functions without IO in their signatures?
I'm
On 2008 Oct 30, at 8:43, Martijn van Steenbergen wrote:
roger peppe wrote:
if you're prepared to expend a few cpu cycles, you can always
use something like the following beating clocks algorithm, which
should generate
at least some genuine randomness, as long as you've got preemptive
On 2008 Oct 30, at 9:12, roger peppe wrote:
i'd be interested to know if you know of any studies on this.
i know of at least one system that uses it as the basis for
its crypto. superficially it's certainly an attractive method, with
minimal
external dependencies, and, i'd have thought, at
On 2008 Oct 28, at 13:11, Jason Dagit wrote:
So far, the only platforms we need to worry about ghc6.6 on are
OpenBSD and Debian Stale.
Paging Dr. Freud...
--
brandon s. allbery [solaris,freebsd,perl,pugs,haskell] [EMAIL PROTECTED]
system administrator [openafs,heimdal,too many hats] [EMAIL
On 2008 Oct 27, at 6:00, Henning Thielemann wrote:
On Mon, 27 Oct 2008, L.Guo wrote:
I think this is unresonable. then try it in GHC 6.8.3.
Prelude round 3.5
4
Prelude round 2.5
2
Is there any explanation about that ?
It's the definition we learnt in school ...
Maybe you did; I learned
On Oct 23, 2008, at 14:31 , Andrew Coppin wrote:
The point is... I'm not doing that. Gtk2hs is, but that's a well-
tested library, so I very much doubt it's the source of the bug.
Gtk+, on the other hand, can be quite buggy.
--
brandon s. allbery [solaris,freebsd,perl,pugs,haskell] [EMAIL
On Oct 23, 2008, at 15:35 , Andrew Coppin wrote:
Brandon S. Allbery KF8NH wrote:
On Oct 23, 2008, at 14:31 , Andrew Coppin wrote:
The point is... I'm not doing that. Gtk2hs is, but that's a well-
tested library, so I very much doubt it's the source of the bug.
Gtk+, on the other hand, can
On 2008 Oct 20, at 15:42, Rouan van Dalen wrote:
I would like to write a very very simple haskell daemon that
disconnects itself from the terminal
and sists in the background doing something.
What is the easiest way to go about this. I have tried several
things but can't seem to
get the
On 2008 Oct 19, at 2:39, Stephen Hicks wrote:
I've got one more question now. Suppose I want to do the same thing
on the other side, with two processes *receiving* the data. Is there
a way to tell whether the first process wants input, and if not, wait
for the second process to do anything?
On 2008 Oct 19, at 21:07, Bulat Ziganshin wrote:
Monday, October 20, 2008, 4:50:45 AM, you wrote:
The trouble is that C++ is a tool that's hard to use well. But
that's
why they pay us the big bucks, right?
i think that one day we will hear that ML was too easy language and
they invented
On 2008 Oct 19, at 1:37, Stephen Hicks wrote:
I'm trying to understand how to get pipes working in Haskell, in
particular with the revamped System.Process (though I've tried similar
experiments with System.Posix.IO and Control.Concurrent).
Specifically I'm trying to concatenate the output of two
On 2008 Oct 17, at 7:33, Sean Leather wrote:
Apparently, I can create a function declaration (FunD) with a name
containing an invalid sequence of characters. It passes typechecking
and compiles. It even shows up in GHCi!
This may be a feature. Consider that internal functions use # as an
On 2008 Oct 16, at 22:22, leledumbo wrote:
... If there isn't enough information to set a concrete type at
the call,
type inference fails. This is what you get with strong typing.
In my case, where does type inference fail? Strong typing is good,
but quite
confusing when combined with
On 2008 Oct 16, at 0:53, leledumbo wrote:
The compiler doesn't know what kind of list you are trying to read,
sort, and print.
So, the type must be specific? Then why it's possible to call the
sorting
function with any list?
A function may have a polymorphic type; this allows its actual
On 2008 Oct 14, at 23:55, Magicloud wrote:
As some articles say, do notation is expand to () and (=) when
being compiled.
So I want to know the details. Like:
main = do
a - getArgs
b - getLine
myFunc1 (head a) b
myFunc2 b (head a)
I cannot figure out what is the () and (=) way of this.
On 2008 Oct 11, at 12:07, David Leimbach wrote:
Are there, or have there been Haskell ports to the JVM? Are any of
them alive and well?
YHC, last I heard, was alive and well and there's a YHC Core backend
for the JVM.
Is there an interest in hosting GHC on the JVM (besides my own).
On 2008 Oct 10, at 15:48, Andrew Coppin wrote:
Don Stewart wrote:
This could be a game changer.
In what way? As far as I'm aware, .NET never really caught on and
has long since become
News to me; lots of people installing VS.NET on campus...
--
brandon s. allbery
On Oct 8, 2008, at 05:12 , Magnus Therning wrote:
This morning I got tired of my desktop wallpaper (one that ships with
Debian's Gnome packages). Typing haskell desktop wallpaper yeilded
a lot of links to wallpapers with Colleen Haskell, while she's a
beautiful lady it wasn't exactly what I was
On 2008 Oct 6, at 20:56, [EMAIL PROTECTED] wrote:
Quoting John Van Enk [EMAIL PROTECTED]:
I'm working on a Haskell based VPN. I can't think of any good
names, so I'm
crowd sourcing it.
(elided abuse of Old Possum)
I'd be tempted to pick a word starting with lan and put a v in
front
of
On 2008 Oct 6, at 23:54, wman wrote:
just for the kicks i tried the new version of bytestring without -O2
and the results were even worse:
Yep, ByteString does a lot of stuff that is really bad when GHC isn't
performing stream fusion --- but when it is, the code compiles down to
tight
On 2008 Oct 4, at 10:57, Serge D. Mechveliani wrote:
Here is a certain naive question about string setting in a Haskell
program.
I have the functions
parseProgram :: String - Program
apply:: Program - Term - Term-- interpreter,
and try to build the example modules for
On 2008 Oct 4, at 17:41, Jason Dagit wrote:
I was just thinking about how many devs put TODO ..., FIXME ...,
or HACK... into comments.
Do others think this could be nice optional information for Haddock
to display? I think it could give people an idea for how mature,
stable or clean an
501 - 600 of 1142 matches
Mail list logo
