Learning Haskell

[Twey]

There's no such way in Haskell because there's no way of telling what "the last result" is. Haskell programs are executed in the order necessary, not the order you set them out in the source file. There may be a way to do it in your command-line interpreter, however.

[v3r5u5]

you can do it in winhugs

[Kristian1984]

I need help quickly please. I got one problem to solve in Haskell, not very
hard but I don't know anything about Haskell programming language so I must
ask for help here and hope for (positive) answer.

So, the question goes like this:

Write function in Haskell which delete every member of a list that is bigger
then the member after him. Test function on list of Integers and on list of
Doubles.

You may use your own functions for help but you may not use functions from
extra Haskell libraries.

Can someone help me please!

[Kristian1984]

Anyone???

Please!

[boogyman]

this sounds alot like a homework assignment.

i suggest reading your text book

[Trinithis]

Hint: Split your function into two functions. The first one would be the one that the coder uses on a regular basis. The second would be the one that the first function uses behind the scenes for help (called a helper function).

I'll give you some of the code. Try filling in the rest (in the ... parts).

mkDecreasing []     = ... -- for an empty list
mkDecreasing (x:xs) = mkDecreasing' x xs

mkDecreasing' x [] = ... -- base case for a recursive call to mkDecreasing'
mkDecreasing' x (y:ys)
    | ... = ...
    | ... = ...

[DigitalDreams]

Hi All,

I am trying to implement the 6 basic logic gates as functions in haskell.

I have so far managed to get an AND, OR gate to work but i am struggling with the others.

Can anyone point me in the direction of some useful websites that could help me with this.

Also how would you implement "not equal to" i thought it would be the following but it did not work.

> notgate :: Bool -> Bool
> notgate a = /=a -- a is not equal to a

[Trinithis]

not :: Bool -> Bool
not True  = False
not False = True

p XOR q = (p OR q) AND (NOT (p AND q))
p NAND q = NOT (p AND q)
p NOR q = NOT (p AND q)

[DigitalDreams]

Thanks for the advice, can you confirm if i have coded the following correctly.

> nand :: Bool -> Bool -> Bool
> nand a b = not (a and b)

> nor :: Bool -> Bool -> Bool
> nor a b = not (a and b)

> xor :: Bool -> Bool -> Bool
> xor a b = (a or b) and (not (a and b))

Thanks

[Trinithis]

To make non-infix functions infix (aka, any non-operators), you need to surround them with backquotes (`).

nand :: Bool -> Bool -> Bool
nand a b = not (a `and` b)

nor :: Bool -> Bool -> Bool
nor a b = not (a `and` b)
	
xor :: Bool -> Bool -> Bool
xor a b = (a `or` b) `and` (not (a `and` b))