Andrew Harris wrote:
I've been thinking about writing a G-machine interpreter in FORTH
so that one could write Haskell like programs that would compile down
and run "graph-reduction" style on the FORTH machine.
Many developers think FORTH is nice, but the language is so, shall
we say, "te
G'day all.
Quoting Thomas Davie <[EMAIL PROTECTED]>:
> Essentially I would like some sort of inderritance property for
> Haskell types, I often find myself wanting to for example extend a
> tree with black/white colouring, or later extend the tree with some
> sort of ID, etc.
Have you had a look
I always thought Forth was way cool, but I've never managed to get anything
significant written in it. I think that Forth has echoes of the
"point-free" style in Haskell, but Haskell is a lot friendlier.
Is the Forth environment part of the hardware? If your Forth is just a
threaded interpreter
Actually I am very impressed from the FORTH simplicity and efficiency.
I was developing one FORTH system for DOS a couple of years ago and I
think it is very useful for small programs that have to perform low
level/hardware tasks. Unfortunatelly it doesn't scale well for larger
applications. I don'
Andrew Harris writes:
Brace yourself... I work in an environment where FORTH is still used.
I've been thinking about writing a G-machine interpreter in FORTH
so that one could write Haskell like programs that would compile down
and run "graph-reduction" style on the FORTH machine.
let
Well, I haven't used Arrows-minus-arr that much but I did cook up such
a library some time ago. Mostly because I had a friend who was
interested in using arrows for a data type which didn't have arr. And
indeed there are several interesting types which lack arr but make
perfect arrows otherwise.
T
Hi -
Brace yourself... I work in an environment where FORTH is still used.
I've been thinking about writing a G-machine interpreter in FORTH
so that one could write Haskell like programs that would compile down
and run "graph-reduction" style on the FORTH machine.
Many developers think
I'd like to hear more about people using Arrows-minus-arr, as I ran into
the same in a project I'm working on for interactive construction of
GUI-wrapped functional values & code.
- Conal
-Original Message-
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of Jeremy Shaw
Shameless plug warning.
> >From what I can tell, there are two problems with WASH:
>
> 1) Everything must be done the WASH way
>
> 2) WASH is mostly broken with GHC 6.4
>
> Let me elaborate a bit on #1.
>
> Let's say I have a CGI interface pre-defined; I take certain parameters
> from a GET re
On Wed, Jun 01, 2005 at 10:54:54AM -0700, Jeremy Shaw wrote:
> Hello,
>
> I have done all of those things in WASH. But, don't let that stop you
> from writing something better :) I think some people started a project
> to write a CGI interface based on a 'Category' -- where a 'Category'
> is like
Hello Fergus,
Tuesday, May 31, 2005, 10:24:41 PM, you wrote:
>> import Data.Set hiding (map)
>> import qualified Data.Set as Set
>>
>> will do fine.
FH> That code only compiles with ghc 6.4, and won't compile with ghc 6.2:
FH> you'll get an error for the "hiding (map)" part, because in 6.2
FH>
Hello Stijn,
Tuesday, May 31, 2005, 2:36:07 PM, you wrote:
SDS> Yes. Many people I know state the functional part as a big reason why
SDS> they chose python.
are you know Ruby? :) it has all the same stuff, including code
blocks, which can refer to variables from outer context
for example, "arr
John Goerzen writes:
> Is there a better CGI module out there somewhere [...]?
http://cryp.to/formdata/
The module addresses your points insofar as that it doesn't
prohibit you from solving them yourself -- like Network.CGI
does. Patches to improve (read: add) documentation would be
very welcom
Hello,
I have done all of those things in WASH. But, don't let that stop you
from writing something better :) I think some people started a project
to write a CGI interface based on a 'Category' -- where a 'Category'
is like an 'Arrow' without the 'pure/arr' function...
Jeremy Shaw.
At Wed, 1 Ju
My apologies if this sounds like a bit of a rant; I know people put good
effort into this, but
The Network.CGI module in fptools (and GHC) is not very useful. I think
that it should be removed or re-tooled. Here are the main problems with
it:
1. It does not permit custom generation of outpu
Hi,
I'm trying to use Wash with GHC 6.4. I have applied the patch from
http://article.gmane.org/gmane.comp.lang.haskell.libraries/3160, and now
it at least compiles. However, despite using -package WASH -package
WASH-CGI -package WASHHTML, ghc is not automatically sending the
input files through
On Wed, 1 Jun 2005, Thomas Davie wrote:
> On 1 Jun 2005, at 15:54, Henning Thielemann wrote:
>
> > What about
> >
> > data MyTree a = Branch a (MyTree a) (MyTree a) | Node a
> >
> > and the types
> > MyTree ()
> > MyTree Bool
> > MyTree (Bool, Int)
> > ?
>
> That's exactly what I would normal
On 1 Jun 2005, at 15:54, Henning Thielemann wrote:
On Wed, 1 Jun 2005, Thomas Davie wrote:
Hi,
I was wondering if I hat missed something and it was possible to
do this within the Haskell type system or not...
Essentially I would like some sort of inderritance property for
Haskell types,
On Wed, 1 Jun 2005, Thomas Davie wrote:
> Hi,
>I was wondering if I hat missed something and it was possible to
> do this within the Haskell type system or not...
>
> Essentially I would like some sort of inderritance property for
> Haskell types, I often find myself wanting to for example ex
Hi,
I was wondering if I hat missed something and it was possible to
do this within the Haskell type system or not...
Essentially I would like some sort of inderritance property for
Haskell types, I often find myself wanting to for example extend a
tree with black/white colouring, or lat
Gracjan Polak <[EMAIL PROTECTED]> writes:
> intern :: Ord a => a -> a
> intern x = unsafePerformIO $ internIO x
>
> iorefset :: Ord a => IORef(Map.Map a a)
> iorefset = unsafePerformIO $ do
> newIORef $ Map.empty
It will not work because you can't put values of different types as
keys of the
21 matches
Mail list logo
