Comments on: Learning Scheme

Comments on: Learning Scheme http://blog.cpu.eti.br/2008/12/14/learning-scheme/ Tue, 06 Jul 2010 12:43:16 -0200 http://wordpress.org/?v=2.8.3 hourly 1 By: Eduardo Habkost http://blog.cpu.eti.br/2008/12/14/learning-scheme/comment-page-1/#comment-54320 Eduardo Habkost Mon, 15 Dec 2008 13:33:56 +0000 http://blog.cpu.eti.br/?p=108#comment-54320 Your solution actually has a point: it does tail recursion and won't abuse the function-call stack, like the simpler solution probably will. Your solution actually has a point: it does tail recursion and won’t abuse the function-call stack, like the simpler solution probably will.

]]> By: Tabgal http://blog.cpu.eti.br/2008/12/14/learning-scheme/comment-page-1/#comment-54313 Tabgal Mon, 15 Dec 2008 11:53:10 +0000 http://blog.cpu.eti.br/?p=108#comment-54313 Em Haskell ficou (também não sou especialista :P) len :: [a] -> Int len [] = 0 len (x:ys) = 1 + len ys Em Haskell ficou (também não sou especialista :P)

len :: [a] -> Int
len [] = 0
len (x:ys) = 1 + len ys

]]>