tag:blogger.com,1999:blog-6839602.post728777982527328109..comments2008-04-08T10:01:24.333-07:00Jim Applehttp://www.blogger.com/profile/11080395413026172939noreply@blogger.comBlogger4125tag:blogger.com,1999:blog-6839602.post-19438634509264687742008-04-08T10:01:00.000-07:002008-04-08T10:01:00.000-07:00I really like your Fibonacci type. Here's a challenge for you: write a useful function on this type. Perhaps a function that takes a list and returns all permutations of that list ([a] -> Fibonacci [a]).Chris Okasakihttp://www.blogger.com/profile/18247315355264748920noreply@blogger.comtag:blogger.com,1999:blog-6839602.post-74236279732560331522008-02-23T13:40:00.000-08:002008-02-23T13:40:00.000-08:00BlackMeph: The second question is "What can we say about the structure of elements of this type?"Jim Applehttp://www.blogger.com/profile/11080395413026172939noreply@blogger.comtag:blogger.com,1999:blog-6839602.post-83790820543730458812008-02-23T13:26:00.000-08:002008-02-23T13:26:00.000-08:00Umm, what is the second question? :)BlackMephhttp://www.blogger.com/profile/02745499320156194052noreply@blogger.comtag:blogger.com,1999:blog-6839602.post-22558491873932602172008-02-23T03:13:00.000-08:002008-02-23T03:13:00.000-08:00OK, after my total failure on the last quiz I came up with some new ways of reasoning about these types and so I >think< that "P a" is a list of elements that must be a fibonacci number in length (i.e. 1, 1, 2, 3, 5... elements). Pretty neat :-)Maxhttp://www.blogger.com/profile/05003540528496327090noreply@blogger.com