I have got 99 problems

18 views
Skip to first unread message

Stephen R

unread,
Mar 7, 2013, 3:02:00 AM3/7/13
to edmonton-functional-p...@googlegroups.com
Here are a lot of functional programming problems, I haven't looked if they vary much between problem sets. 
http://www.haskell.org/haskellwiki/99_questions (The links that follow are references from this page)
http://www.ic.unicamp.br/~meidanis/courses/mc336/2006s2/funcional/L-99_Ninety-Nine_Lisp_Problems.html
http://www.christiankissig.de/cms/index.php/programming/217-99-problems-in-ocaml

I stumbled on the above while working on some problems on the following site
http://projecteuler.net/

Project Euler also lead to http://www.haskell.org/haskellwiki/Prime_numbers (which Joshua has indirectly brought up,
with the infinite prime list in Haskell). The Sieve of Ertosthesthenes is interesting, I don't have any fun examples for
when it can be used other than when you are solving programming problems and need a big set of prime numbers
in a very short amount of time.

Abram Hindle

unread,
Mar 7, 2013, 9:41:57 PM3/7/13
to edmonton-functional-p...@googlegroups.com
Thanks for this Stephen!

Here's the code from the last meeting.

Abram

On 13-03-07 01:02 AM, Stephen R wrote:
> Here are a lot of functional programming problems, I haven't looked if
> they vary much between problem sets.
> http://www.haskell.org/haskellwiki/99_questions (The links that follow
> are references from this page)
> https://sites.google.com/site/prologsite/prolog-problems
> http://www.ic.unicamp.br/~meidanis/courses/mc336/2006s2/funcional/L-99_Ninety-Nine_Lisp_Problems.html
> <http://www.ic.unicamp.br/%7Emeidanis/courses/mc336/2006s2/funcional/L-99_Ninety-Nine_Lisp_Problems.html>
> http://www.christiankissig.de/cms/index.php/programming/217-99-problems-in-ocaml
>
> I stumbled on the above while working on some problems on the
> following site
> http://projecteuler.net/
>
> Project Euler also lead
> to http://www.haskell.org/haskellwiki/Prime_numbers (which Joshua has
> indirectly brought up,
> with the infinite prime list in Haskell). The Sieve of Ertosthesthenes
> is interesting, I don't have any fun examples for
> when it can be used other than when you are solving programming
> problems and need a big set of prime numbers
> in a very short amount of time.
> --
> You received this message because you are subscribed to the Google
> Groups "Edmonton Functional Programming Users Group" group.
> To unsubscribe from this group and stop receiving emails from it, send
> an email to
> edmonton-functional-program...@googlegroups.com.
> For more options, visit https://groups.google.com/groups/opt_out.
>
>

Golf.hs
signature.asc
Reply all
Reply to author
Forward
0 new messages