is
missing out when not using ALL the computational tools.
cheers,
gene
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
this is possible.. I am sure of it.. but it would be at the source code
level and a string parse and output from that ..
cheers,
gene
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
the dependency.. rather
then put the effort in to learn an entire API that doesn't match up..
BAD IDEA!!
cheers,
gene
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
be worked around, other then having to
enumerate every value in a list rather then use the handiness of
the range notation as shorthand?
cheers,
gene
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
) - a `op` b)
examples of use, that were executed using:
ghci -fglasgow-exts -farrows Control.Arrow
*pointfree (*) (3,5) (12,12)
(15,144)
* pointfree (++) (This ,That) (Old, Man)
(This That,Old Man)
Hope that helps.
-- gene
==
website: http://haskblog.cloud.prohosting.com
it up just enough to
see that it works, but I was only doing things with it to test and they were
ALL things that I brought over from Haskell...
Sorry if this is sorta off topic, but...
gene
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
that this spawned about things
monadic, as there was some really slick stuff in there... The little thing
about 'join' and etcetera... really good stuff.
cheers...
gene
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
On 2/21/07, Jules Bean [EMAIL PROTECTED] wrote:
Gene A wrote:
Prelude let revApply a f = f a
Prelude let rMap a fs = map (revApply a) fs
Prelude rMap 2 [(*4),(^2),(+12),(**0.5)]
[8.0,4.0,14.0,1.4142135623730951]
Note that revApply here is precisely flip ($).
And ($a) is the same as flip
$ [(x,y,() x y)
|x - [True,False],y - [True,False]]
(True,True,True)
(True,False,False)
(False,True,False)
(False,False,False)
gene
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
= 13
n = 14
o = 15
p = 16
q = 17
r = 18
s = 19
t = 20
u = 21
v = 22
w = 23
x = 24
y = 25
z = 26
I think that is pretty simple...
Good cheer to all from the desert,
gene
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
On 2/15/07, Gene A [EMAIL PROTECTED] wrote:
Haskell solution:
build the array of all lower case with corresponding numbers starting with 1
Prelude let lowerCaseTable = zip ['a'..'z'] [1..26]
A couple of functions:
Prelude let box a = a:[]
Prelude let formatTableItems (a,b) = (box
about an at time dense subject, in hard copy. I for
one just like to get away from the whine of the box fan, that is the
cooling device right now on my computing machine, sitting 22 from my
ear canal, and read a good book that is potentially this useful.
happy computing,
gene
ABCDEFGHIJKLMNOPQRSTUVWXYZ [2,5..26]
[B,E,H,K,N,Q,T,W,Z]
happy computing,
gene
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
a happy camper that I have the ability to use such fine
tools, and not have to be lost in the catacombs of mediocrity: ie.
Java, C++, C, and C#.
good programming,
gene
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
much.. I JUST DIDN'T use it.
Now as to the whole namespace part of the argument made by Brian...
well that is another kettle of fish, and I will leave that to guys
with his knowledge.. to cipher out such things... somebody has been
doing a good job on this language so far!
happy day to all,
gene
the compiler gets done with it.. I
assume it must, but ... ?? Does it cause the compiler less or more
work to get to that resultant code.. hmmm
thanks,
gene
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
with the rambling,
gene
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
bind and such notation... = etc..
hey, mention was made of lists being monads.. so
gene
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of
Int, Integer, Float, Double etc.. No?
thanks,
gene
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
their patience with my questions..
Thanks again to All for the clarification and links to more reading,
gene
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
or disadvantage
to one over the other.. I find a lot of these kind of things in
Haskell, and it is purely wonderful.. but always go away wondering if
I am really using the most efficient, or most acceptable method..
gene
___
Haskell-Cafe mailing list
,
2.884499140309247,2.9670416,
3.1072325056015817,3.2075343296219874,
3.3019272485002094,3.391211442600036,
3.4760266444533747]
Greetings from the Yuma Desert,
gene
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
really not too good, but does support
pushing strings and concatenation and some other things that are more
tedious to write as primatives in other languages.. The only other
language that was as easy to get to this stage with was scheme.
Sorry for the ramble,
gene
On 8/19/06, Lennart Augustsson
that?
happy days,
gene
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
24 matches
Mail list logo
