ayberkt

{- Based on Miran Lipovaca's RPN solver from LYAH. -}

import Control.Monad (forever)

apply :: String -> [Double] -> [Double]
apply "*"   (x:y:ys)  = (x * y):ys
apply "+"   (x:y:ys)  = (x + y):ys
apply "-"   (x:y:ys)  = (x - y):ys
apply "/"   (x:y:ys)  = (x / y):ys
apply "exp" (x:y:ys)  = (x ** y):ys

ayberkt

data Tree a = EmptyTree
            | Node a (Tree a) (Tree a)
            deriving (Eq, Ord, Show)


simpleTree :: Tree Int
simpleTree = Node 1 (Node 2 EmptyTree EmptyTree)
                    (Node 3 EmptyTree EmptyTree)

tree1 :: Tree Int

ayberkt

def curried_f(x, y=None, z=None):
    def f(x, y, z): return x**3 + y**2 + z

    if y is not None and z is not None:
        return f(x, y, z)
    if y is not None:
        return lambda z: f(x, y, z)

    return lambda y, z=None: f(x, y, z) if (y is not None and z is not None) else (lambda z: f(x, y, z))