在SML中创建一个素数列表，直到给定的n值

fun isPrime(n: int): bool =
    let
        fun isDivisibleBy(n: int, d: int): bool =
            n mod d = 0
    in
        if n <= 1 then
            false
        else if n <= 3 then
            true
        else if isDivisibleBy(n, 2) orelse isDivisibleBy(n, 3) then
            false
        else
            let
                fun checkDivisors(n: int, d: int): bool =
                    if d * d > n then
                        true
                    else if isDivisibleBy(n, d) orelse isDivisibleBy(n, d + 2) then
                        false
                    else
                        checkDivisors(n, d + 6)
            in
                checkDivisors(n, 5)
            end
    end;

fun primeList(n: int): int list =
    let
        fun generatePrimes(n: int, acc: int list): int list =
            if n < 2 then
                acc
            else if isPrime(n) then
                generatePrimes(n - 1, n :: acc)
            else
                generatePrimes(n - 1, acc)
    in
        generatePrimes(n, [])
    end;

val primes = primeList 100;