[Haskell-cafe] "translating" recursively defined sequence

[Christopher Howard]

On 03/04/2013 08:36 PM, Bob Ippolito wrote:
> I suppose it depends on your definition of straightforward but you can
> use the iterate function from Data.List to quickly define sequences like
> this.
> 
> a = iterate (\x -> (1/5) * (x**2)) 10
> 
> 
> On Mon, Mar 4, 2013 at 9:19 PM, Christopher Howard
> <christopher.howard at frigidcode.com
> <mailto:christopher.howard at frigidcode.com>> wrote:
> 
>     Hi. My Haskell is (sadly) getting a bit rusty. I was wondering what
>     would be the most straightforward and easily followed "procedure" for
>     translating a recursively defined sequence into a Haskell function. For
>     example, this one from a homework assignment.
> 
>     quote:
>     --------
>     a_1 = 10
>     a_(k+1) = (1/5) * (a_k)**2
>     --------
> 
>     (The underscore is meant to represent subscripting what follows it.)
> 
>     --
>     frigidcode.com <http://frigidcode.com>
> 
> 

Very cool! Thanks!

-- 
frigidcode.com

-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 555 bytes
Desc: OpenPGP digital signature
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20130304/c00622d9/attachment.pgp>