Dear All,
The deadline for submisson to AADEBUG'2003, the Fifth International Workshop
on Automated and Algorithmic Debugging, is approaching. Papers and demos
should be received by 22 March, 2003. Please find the CFP enclosed.
See http://aadebug2003.elis.rug.ac.be/ for further details.
Best rega
G'day all.
On Tue, Mar 11, 2003 at 08:34:06AM +1300, Tom Pledger wrote:
> If, on the other hand, you want to vary the state type *during* a
> single monadic computation, it gets messy. You could try one of the
> following.
Very often, you just want to vary the state type for some portion
of the
Wang Meng writes:
| Hi All,
|
| Any one of your have the experience of defining a state of a state monad
| as a polymorphic type?
| I want to have:
|
| > type State = Term a => [a]
| > data M a = M (State -> IO(State,a))
|
| GHC yields a error message "Illegal polymorphic type".
| How
Hi All,
Any one of your have the experience of defining a state of a state monad
as a polymorphic type?
I want to have:
> type State = Term a => [a]
> data M a = M (State -> IO(State,a))
GHC yields a error message "Illegal polymorphic type".
How to resolve this?
Thank you very much.
-W-M-
Hi,
Has anyone have experience reading from a handle using hGetContents when
the handle is still open and receives input from outside?
I need to do some manipulation to the contents and I can't afford to close
this handle. for example, an infinite stream "abcabc..." is written from
outside to this
[We apologize if you receive multiple copies of this announcement.]
Postdoctoral research fellow (University of Nottingham)
Doctoral studentship (University of Oxford)
in DATATYPE-GENERIC PROGRAMMING
The Universities of Nottingham and Oxford have positions available to work
on an EPSRC-supported
Wait a minute!
As far as I have understood, "threaded" refers (in this context) to a
style of writing (byte code) interpreters. A threaded interpreter does
not have a dispatch loop which reads the next byte code and then
invokes the correct handler (typically by using the byte code as an index
i
>Just a side remark.
>I wonder whether the byte-code approach is the best possible solution
>taking into account the overload of the decoder. Why not threaded code?
>The FORTH (and similar) experience, PostScript implementations, etc.
>show that this paradigm may be more interesting. Anyway, when y
Bjorn Lisper wrote:
There is an interesting research question in here: how to design "lean"
implementations of lazy functional languages so they can run on small
handheld and embedded systems with restricted resources.
[...]
> Furthermore, the i/o model
must be developed to accomodate the event-dri
Bjorn Lisper wrote:
There is an interesting research question in here: how to design "lean"
implementations of lazy functional languages so they can run on small
handheld and embedded systems with restricted resources. In particular the
restricted memory available poses an interesting challenge. W
M. Parker:
>What about a port to Windows CE (i.e., for Pocket PC's). Or even better yet,
>hugs for Pocket PC!
>
>-Matt
There is an interesting research question in here: how to design "lean"
implementations of lazy functional languages so they can run on small
handheld and embedded systems with r
On Sun, 09 Mar 2003 22:13:35 -0500, Matthew Donadio <[EMAIL PROTECTED]> wrote:
I may be being a bit dense about this, but I am having some trouble
understanding how to use FFI, especially with respect to interfacing
Haskell lists/arrays to C arrays.
For example, say I have the C functions
void fo
12 matches
Mail list logo
