On 18 January 2005 15:13, Duncan Coutts wrote:
On all Unix platforms except Darwin, ghc-pkg calls:
ld -r -x -o HSfoo.o --whole-archive libHSfoo.a
See:
ghc/utils/ghc-pkg/Main.hs, function autoBuildGHCiLib
This works for the GNU linker. For the Solaris linker (which takes the
name ld, GNU
Bugs item #1105067, was opened at 2005-01-19 07:25
Message generated for change (Settings changed) made by simonmar
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1105067group_id=8032
Category: Documentation
Group: 6.2.2
Status: Closed
Resolution: Fixed
Hi Volker,
On 02 January 2005 16:35, Volker Wysk wrote:
I made an error when simplifying the program for the bug report.
Here's the message again.
I'm building a program which converts file names from ISO8859-1 to
UTF-8. It calls the recode program to do the actual conversion. This
part
On 18 Jan 2005, at 15:12, Duncan Coutts wrote:
Hi,
On all Unix platforms except Darwin, ghc-pkg calls:
ld -r -x -o HSfoo.o --whole-archive libHSfoo.a
See:
ghc/utils/ghc-pkg/Main.hs, function autoBuildGHCiLib
This works for the GNU linker. For the Solaris linker (which takes the
name ld, GNU ld
Hello.
I've had the misconception that a file descriptor can be in a closed state. So
the bug report was rather misguided - sorry for that.
Yes, what I actually want is to reset the stdin handle. Thanks for the hint to
hDuplicateTo. This should be exactly what I need.
I see that the thing
Simon Marlow [EMAIL PROTECTED] writes:
It's intentional, but it can be easily turned off. Do people want to
see feature-requests, task-list entries and so forth on this mailing
list, or should they be confined to, say, [EMAIL PROTECTED]
I would vote to put them in a separate list. At least
On 19 January 2005 05:31, John Meacham wrote:
A while ago I wrote a glibc specific implementation of the CWString
library. I have since made several improvements:
* No longer glibc specific, should compile and work on any system with
iconv (which is unix standard) (but there are still
On 18 January 2005 21:01, William Lee Irwin III wrote:
On 15 December 2004 14:46, William Lee Irwin III wrote:
There seems to be some trouble with the debian ghci on sparc64. I
can dredge up more information if given an idea of what to look for.
On Tue, Jan 18, 2005 at 04:41:02PM -,
Good point, thank you! I'd forgotten that the OGI modules paper, which I
read carefully at the time, covered recursion (Section 5.4).
But my real point wasn't that it's impossible to define a meaning, only
that the meaning might be a bit unexpected to a programmer, and involves
a fixpoint
On 17 January 2005 22:53, Sean Bowman wrote:
I'm trying to install HUnit to use with ghci and hugs and having some
trouble. It works if I use the -i option with ghci, but I'd rather
not have to specify that on the command line every time. Putting it
in a ~/.ghci file doesn't seem to work.
Question regarding implicit parameters... The GHC manual says:
Dynamic binding constraints behave just like other type class
constraints in that they are automatically propagated.
But the following code produces an error:
Hello,
I would like to port GHC to Arm so that I can compile Haskell programs
for use on my Zaurus or in Debian's ARM port.
I have talked to Ian Lynagh about this, and he believes that there was
some sort of problems with floats. I don't know exactly that was, if it
was in gcc or ghc, or if it
Isn't it just the monomorphism restriction at work?
This works fine:
f () = do
a - get_unique
putStr (showInt a \n)
b - get_unique
putStr (showInt b \n)
c - get_unique
putStr (showInt c \n)
Yes, adding -fno-monomorphism-restriction allows the example to compile.
I guess I got confused by the error message, expecting it to mention the
monomorphism restriction directly... I'm sure it does sometimes. Any
chance of improving the error message for this?
Jorge Adriano Aires wrote:
Isn't it
I have a forthcoming expository JFP paper on one way to do what I think
you're asking for without any extra-language hackery:
Embedded Interpreters
This is a tutorial on using type-indexed embedding/projection pairs when
writing interpreters in statically-typed functional languages. The
method
Satnam Singh wrote:
I'm trying to find out about existing work on implicit parallel functional
programming. I see that the Glasgow Haskell compiler has a parallel mode which
can be used with PVM and there is interesting work with pH at MIT. Does anyone
know of any other work on implicitly
I have to say I disagree... I feel Haskell is highly suited to implicit
parallel execution... The key to implicit parallelisation is that it
is implicit - not explicit, so the programmer should feel like they are
programming a sequential language. If we can assume little memory access
On Wed, 19 Jan 2005, Jan-Willem Maessen wrote:
On Jan 18, 2005, at 11:36 PM, [EMAIL PROTECTED] wrote:
On Tue, 18 Jan 2005, Satnam Singh wrote:
I'm trying to find out about existing work on implicit parallel
functional programming. I see that the Glasgow Haskell compiler has a
**
5th Int'l Workshop on
Reduction Strategies in Rewriting and Programming
WRS'05
Nara, Japan, April 22nd, 2005
Last
I have made a basic binding to Lester Ingber's Adaptive Simulated
Annealing code. Adaptive simulated annealing is a general purpose
non-linear optimization algorithm which can (be statistically
guarenteed to) find the minimum of arbitrary many-dimensional functions.
I am hoping this will turn
I thought the lazy functional languages are great for implicit
parallelism thing died out some time ago - at least as far as running
the programs on conventional hardware is concerned.
Designing an algorithm that breaks apart a sequential lazy program
into parallel chunks of the appropriate
Having donned my flame-resistant suit, I am going to venture that I think
the differences of opinion in the posts copied below are in large part the
result of people talking about different things at the same time.
First, there is a claim that functional languages facilitate parallel
execution,
David Owen [EMAIL PROTECTED] writes:
Do you know if there are solutions to exersises available somewhere?
Have you gone through the whole book, i.e. all the exercises?
Unfortuantely I don't know of anywhere that the exercise answers can
be found, even after some google searching.
Another
Keean Schupke [EMAIL PROTECTED] writes:
Can I request 2 types, one for dense (complete) matricies and
another for sparse matricies?
...and maybe also put (!) in a class, so that it can be used as a general
indexing operator for all indexed data structures? (Or is this
already possible? I
Of course both suggestions don't really change anything as:
_main = do
args - getArgs
main args
(or the equivalent for implicit parameters) is all that is required...
In a way
the implicit parameter approach makes it seem like a normal function...
Do you think implicit parameters
This is a have you seen this monad? post. I was trying to construct a
search tree, and decided I wanted to do it in a monad (so I could apply
StateT and keep state as I explored the space). I discovered that a
tree with labeled leaves is a monad, but I wanted to label internal
nodes, and such a
On Wed, Jan 19, 2005 at 01:40:06AM -0800, Andrew Pimlott wrote:
This is a have you seen this monad? post. I was trying to construct a
search tree, and decided I wanted to do it in a monad (so I could apply
StateT and keep state as I explored the space). I discovered that a
tree with labeled
In article [EMAIL PROTECTED],
Keean Schupke [EMAIL PROTECTED] wrote:
Do you think implicit parameters could replace
top-level-things-with-identity?
I hadn't really thought of it before (and I don't use implicit
parameters much).
Yes, but I think people are clamouring for
On Wednesday 19 January 2005 12:52, Ashley Yakeley wrote:
I have been musing on the connection between data-types, modules,
classes, and implicit parameters, and wondering if there might be
some grand scheme to tie it all together. For instance, a module is
very similar to class with no type
I may have got this wrong, but I think you can do named instances
without any extensions,
by using datatypes and fundeps:
data Instance0
data Instance1
instance0 :: Instance0
instance0 = undefined
instance1 :: Instance1
instance1 = undefined
class Named a b | a - b
test :: a - b - b
instance
On 19 January 2005 09:45, Ben Rudiak-Gould wrote:
Glynn Clements wrote:
Ben Rudiak-Gould wrote:
GHC really needs non-blocking
I/O to support its thread model, and memory-mapped I/O always
blocks.
If, by blocks, you mean that execution will be suspended until the
data has been
On 19 January 2005 09:45, Ben Rudiak-Gould wrote:
Okay, my ignorance of Posix is showing again. Is it currently the
case, then, that every GHC thread will stop running while a disk read
is in progress in any thread? Is this true on all platforms?
On Wed, Jan 19, 2005 at 01:39:05PM -, Simon
Simon Marlow wrote:
Okay, my ignorance of Posix is showing again. Is it currently the
case, then, that every GHC thread will stop running while a disk read
is in progress in any thread? Is this true on all platforms?
It's true on Unix-like systems, I believe. Even with -threaded. It
might
On 19 January 2005 13:50, William Lee Irwin III wrote:
On 19 January 2005 09:45, Ben Rudiak-Gould wrote:
Okay, my ignorance of Posix is showing again. Is it currently the
case, then, that every GHC thread will stop running while a disk
read is in progress in any thread? Is this true on all
Why not use a thread-pool, and a safe call to read, provided there is
an OS thread available,
defaulting to unsafe if no thread is available... You could make the
thread pool size an argument...
Keean.
Simon Marlow wrote:
On 19 January 2005 13:50, William Lee Irwin III wrote:
On 19
Hi,
[only now I am catching up with the messages from the
beginning of the year from haskell-cafe...]
Simon Peyton-Jones wrote:
* Andre Santos and his colleagues at UFPE in Brazil are working on a
.NET back end,
that generates CLR IL, though I don't know where they are up to.
*
Ben Rudiak-Gould [EMAIL PROTECTED] writes:
Yes, this is a problem. In my original proposal InputStream and
OutputStream were types, but I enthusiastically embraced Simon M's
idea of turning them into classes. As you say, it's not without its
disadvantages.
This is my greatest single
We do use a thread pool. But you still need as many OS threads as there
are blocked read() calls, unless you have a single thread doing select()
as I described. BTW our Haskell Workshop paper from last year describes
this stuff:
http://www.haskell.org/~simonmar/papers/conc-ffi.ps.gz
Cheers,
On Wed, 2005-01-19 at 15:06 +, Keean Schupke wrote:
Why not use a thread-pool, and a safe call to read, provided there is
an OS thread available,
defaulting to unsafe if no thread is available... You could make the
thread pool size an argument...
If it's just a question of speed then
Duncan Coutts wrote:
If it's just a question of speed then the fastest IO system is the
variety that GHC uses now: a single OS thread that multiplexes all IO
requests using a select loop.
But what about the continuing computation... we do not want
the fastest IO system, but we want the program
Simon Marlow wrote:
On 19 January 2005 16:49, Keean Schupke wrote:
But what about the continuing computation... we do not want
the fastest IO system, but we want the program to comlete the
fastest... So ideally we want 2 threads!
One runs the Haskell code that is not waiting for IO. (IE other
Hi,
This is a hey that's cool post :-)
I have seen both of those separately --- the generalized resumptions monad,
and the IO (and others) monad written in continuation passing style,
but never realized that the one was an instance of the other.
It is neat how the basic operations are separated
Perhaps one could have top-level implicit parameters (or top-level
contexts in general):
module (?myvar :: IORef Int) = Random where
Hi!
I suggested something very similar to this some months ago, syntax and all.
Nice to see I'm not the only one thinking along this lines.
On Wednesday 19 January 2005 14:31, Keean Schupke wrote:
I may have got this wrong, but I think you can do named instances
without any extensions,
by using datatypes and fundeps:
data Instance0
data Instance1
instance0 :: Instance0
instance0 = undefined
instance1 :: Instance1
instance1
Keean Schupke wrote:
Okay, my ignorance of Posix is showing again. Is it currently the
case, then, that every GHC thread will stop running while a disk read
is in progress in any thread? Is this true on all platforms?
It's true on Unix-like systems, I believe. Even with -threaded. It
Simon Marlow wrote:
We do use a thread pool. But you still need as many OS threads as there
are blocked read() calls, unless you have a single thread doing select()
as I described.
How does the select() help? AFAIK, select() on a regular file or block
device will always indicate that it is
On Wednesday 19 January 2005 21:20, Jorge Adriano Aires wrote:
Perhaps one could have top-level implicit parameters (or top-level
contexts in general):
module (?myvar :: IORef Int) = Random where
I suggested something very similar to this some months ago, syntax and all.
Nice to see I'm
Benjamin Franksen wrote:
Neither I nor the authors claim that their proposal is the ultimate grand
scheme, yet. Still I think there are very interesting ideas in there that
should be considered for experimental implementation or further research.
But thats interesting isn't it. If one
Ben Rudiak-Gould wrote:
GHC really needs non-blocking
I/O to support its thread model, and memory-mapped I/O always blocks.
If, by blocks, you mean that execution will be suspended until the
data has been read from the device into the buffer cache, then Unix
non-blocking I/O (i.e.
On Wednesday 19 January 2005 21:48, Keean Schupke wrote:
Benjamin Franksen wrote:
Neither I nor the authors claim that their proposal is the ultimate grand
scheme, yet. Still I think there are very interesting ideas in there that
should be considered for experimental implementation or further
Glynn Clements [EMAIL PROTECTED] writes:
They're similar, but not identical. Traditionally, Unix non-blocking
I/O (along with asynchronous I/O, select() and poll()) were designed
for slow streams such as pipes, terminals, sockets etc. Regular
files and block devices are assumed to return the
Glynn Clements [EMAIL PROTECTED] writes:
We do use a thread pool. But you still need as many OS threads as there
are blocked read() calls, unless you have a single thread doing select()
as I described.
How does the select() help? AFAIK, select() on a regular file or block
device will
In article [EMAIL PROTECTED],
Benjamin Franksen [EMAIL PROTECTED] wrote:
Please note that implicit parameters -- at least as currently implemented in
GHC -- have a number of severe problems. A good summary was given by Ben
Rudiak-Gould in
Benjamin Franksen wrote:
Please note that implicit parameters -- at least as currently implemented in
GHC -- have a number of severe problems.
Does anyone have examples of these? This one scares the foo out of me:
* It's not even safe in general to add a signature giving the same type
that the
54 matches
Mail list logo
