fun fib 0 = 0 | fib 1 = 1 | fib n = fib (n - 1) + fib (n - 2)
Get better at programming through fun, rewarding coding exercises that test your understanding of concepts with Exercism.
Determine if a number is perfect, abundant, or deficient based on Nicomachus' (60 - 120 CE) classification scheme for positive integers.
Compute the prime factors of a given natural number.
Given a number n, determine what the nth prime is.
Every language has its own way of doing things. Standard ML is no different. Our mentors will help you learn to think like a Standard ML developer and how to write idiomatic code in Standard ML. Once you've solved an exercise, submit it to our volunteer team, and they'll give you hints, ideas, and feedback on how to make it feel more like what you'd normally see in Standard ML - they'll help you discover the things you don't know that you don't know.Learn more about mentoring
The Standard ML track on Exercism has 28 exercises to help you write better code. Discover new exercises as you progress and get engrossed in learning new concepts and improving the way you currently write.See all Standard ML exercises
The best part, it’s 100% free for everyone.