Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
haskell linked list
data List a = Nil | Cons a (List a) instance (Show a) => Show (List a) where show Nil = "Nil" show (Cons p l) = "(" ++ show p ++ ", " ++ show l ++ ")" fromlst :: [a] -> List a fromlst [] = Nil fromlst (p:q) = Cons p (fromlst q) tolst :: List a -> [a] tolst Nil = [] tolst (Cons p q) = p : tolst q main :: IO () main = do let n = fromlst [1..10] :: List Int putStrLn . show $ n putStr . show . tolst $ n
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
haskell_exam_demo
Sierpinski Triangle as lazy list
Token
Derive type class for parameterized data type
boolean functions of zero arguments in haskell
Monoid and friends
Znajdz trójkąty prostokątne
Goodstein sequences
tried some polynoms 2: now with some `*` and foldr(-p)
Is Preorder BST
Please log in to post a comment.