Learn Ml - 10 Code Examples & CST Typing Practice Test

ML (Meta Language) is a functional programming language known for its strong static type system, type inference, and pattern matching capabilities. It emphasizes immutability, recursion, and expressive type-safe programming, making it ideal for symbolic computation, theorem proving, and compiler development.

View all 10 Ml code examples →

ML Counter and Theme Toggle ML Fibonacci Sequence ML Factorial Calculator ML Prime Checker ML Sum of List ML Reverse String ML Multiplication Table ML Celsius to Fahrenheit ML Simple Alarm Simulation ML Random Walk Simulation

Learn ML with Real Code Examples

Updated Nov 20, 2025

Introduction & Fundamentals Setup & Configuration Architecture & Deep Internals Performance & Security Development Workflow Learning & Career Growth Business & Strategy Examples

Code Sample Descriptions

ML Counter and Theme Toggle

val count = ref 0
val isDark = ref false

fun updateUI () = (
    print ("Counter: " ^ Int.toString(!count) ^ "\n");
    print ("Theme: " ^ (if !isDark then "Dark" else "Light") ^ "\n")
)

fun increment () = (
    count := !count + 1;
    updateUI ()
)

fun decrement () = (
    count := !count - 1;
    updateUI ()
)

fun reset () = (
    count := 0;
    updateUI ()
)

fun toggleTheme () = (
    isDark := not !isDark;
    updateUI ()
)

(* Simulate actions *)
updateUI ();
increment ();
increment ();
toggleTheme ();
decrement ();
reset ();

Demonstrates a simple counter with theme toggling using ML variables and functions.

Let’s Try →

ML Fibonacci Sequence

fun fib 0 = 0
  | fib 1 = 1
  | fib n = fib(n-1) + fib(n-2)

fun printFib n = 
    if n < 10 then (
        print (Int.toString(fib n) ^ "\n");
        printFib (n+1)
    ) else ()

printFib 0;

Generates the first 10 Fibonacci numbers recursively.

Let’s Try →

ML Factorial Calculator

fun fact 0 = 1
  | fact n = n * fact(n-1)

val result = fact 5;
print(Int.toString(result) ^ "\n");

Calculates factorial using recursion.

Let’s Try →

ML Prime Checker

fun isPrime n =
  let
    fun check i = i*i > n orelse (n mod i <> 0 andalso check (i+1))
  in
    if n < 2 then false else check 2
  end;

val n = 13;
print(if isPrime n then "Prime\n" else "Not Prime\n");

Checks if a number is prime.

Let’s Try →

ML Sum of List

val lst = [1,2,3,4,5];
fun sum [] = 0
  | sum (x::xs) = x + sum xs;

val result = sum lst;
print(Int.toString(result) ^ "\n");

Calculates the sum of a list.

Let’s Try →

ML Reverse String

fun reverseString s =
  let
    fun rev [] acc = acc
      | rev (x::xs) acc = rev xs (x::acc)
  in
    String.implode (rev (String.explode s) [])
  end;

val r = reverseString "HELLO";
print(r ^ "\n");

Reverses a string.

Let’s Try →

ML Multiplication Table

fun table n i = 
    if i > 10 then ()
    else (
        print(Int.toString(n) ^ " x " ^ Int.toString(i) ^ " = " ^ Int.toString(n*i) ^ "\n");
        table n (i+1)
    );

table 5 1;

Prints multiplication table of a number.

Let’s Try →

ML Celsius to Fahrenheit

val c = 25.0;
val f = (c * 9.0 / 5.0) + 32.0;
print (Real.toString(f) ^ "\n");

Converts Celsius to Fahrenheit.

Let’s Try →

ML Simple Alarm Simulation

val temp = 80;
val thresh = 75;
print(if temp > thresh then "Alarm: Temperature Too High!\n" else "Temperature Normal\n");

Simulates an alarm when a threshold is exceeded.

Let’s Try →

ML Random Walk Simulation

val steps = 10;
val _ = ref 0;
val pos = ref 0;
for i = 1 to steps do (
    if Random.rand() < 0.5 then pos := !pos + 1 else pos := !pos - 1;
    print(Int.toString(!pos) ^ "\n");
);

Simulates a 1D random walk.

Let’s Try →

Frequently Asked Questions about Ml

What is Ml?

What are the primary use cases for Ml?

Compiler and interpreter development. Theorem proving and formal verification. Symbolic computation. Algorithm prototyping. Academic research and teaching functional programming

What are the strengths of Ml?

Type safety reduces runtime errors. Concise and expressive syntax. Excellent for symbolic and mathematical computation. Strong foundation for teaching functional programming. Influenced many modern functional languages

What are the limitations of Ml?

Not widely used in mainstream industry. Limited standard libraries for I/O and GUI. Steep learning curve for beginners. Performance may lag behind imperative languages for some tasks. Smaller community and ecosystem compared to Python or JavaScript

How can I practice Ml typing speed?

CodeSpeedTest offers 10+ real Ml code examples for typing practice. You can measure your WPM, track accuracy, and improve your coding speed with guided exercises.

Learn Other Programming Languages

C React Python C++Rust TypeScript Kotlin PHP Java C#Ruby Mql Cql N1ql Cypher Gremlin Partiql Haskell Elixir Fsharp View all languages →

Learn Ml - 10 Code Examples & CST Typing Practice Test

Code Sample Descriptions

ML Counter and Theme Toggle

val count = ref 0
val isDark = ref false

fun updateUI () = (
    print ("Counter: " ^ Int.toString(!count) ^ "\n");
    print ("Theme: " ^ (if !isDark then "Dark" else "Light") ^ "\n")
)

fun increment () = (
    count := !count + 1;
    updateUI ()
)

fun decrement () = (
    count := !count - 1;
    updateUI ()
)

fun reset () = (
    count := 0;
    updateUI ()
)

fun toggleTheme () = (
    isDark := not !isDark;
    updateUI ()
)

(* Simulate actions *)
updateUI ();
increment ();
increment ();
toggleTheme ();
decrement ();
reset ();

Demonstrates a simple counter with theme toggling using ML variables and functions.

Let’s Try →

ML Fibonacci Sequence

fun fib 0 = 0
  | fib 1 = 1
  | fib n = fib(n-1) + fib(n-2)

fun printFib n = 
    if n < 10 then (
        print (Int.toString(fib n) ^ "\n");
        printFib (n+1)
    ) else ()

printFib 0;

Generates the first 10 Fibonacci numbers recursively.

Let’s Try →

ML Factorial Calculator

fun fact 0 = 1
  | fact n = n * fact(n-1)

val result = fact 5;
print(Int.toString(result) ^ "\n");

Calculates factorial using recursion.

Let’s Try →

ML Prime Checker

fun isPrime n =
  let
    fun check i = i*i > n orelse (n mod i <> 0 andalso check (i+1))
  in
    if n < 2 then false else check 2
  end;

val n = 13;
print(if isPrime n then "Prime\n" else "Not Prime\n");

Checks if a number is prime.

Let’s Try →

ML Sum of List

val lst = [1,2,3,4,5];
fun sum [] = 0
  | sum (x::xs) = x + sum xs;

val result = sum lst;
print(Int.toString(result) ^ "\n");

Calculates the sum of a list.

Let’s Try →

ML Reverse String

fun reverseString s =
  let
    fun rev [] acc = acc
      | rev (x::xs) acc = rev xs (x::acc)
  in
    String.implode (rev (String.explode s) [])
  end;

val r = reverseString "HELLO";
print(r ^ "\n");

Reverses a string.

Let’s Try →

ML Multiplication Table

fun table n i = 
    if i > 10 then ()
    else (
        print(Int.toString(n) ^ " x " ^ Int.toString(i) ^ " = " ^ Int.toString(n*i) ^ "\n");
        table n (i+1)
    );

table 5 1;

Prints multiplication table of a number.

Let’s Try →

ML Celsius to Fahrenheit

val c = 25.0;
val f = (c * 9.0 / 5.0) + 32.0;
print (Real.toString(f) ^ "\n");

Converts Celsius to Fahrenheit.

Let’s Try →

ML Simple Alarm Simulation

val temp = 80;
val thresh = 75;
print(if temp > thresh then "Alarm: Temperature Too High!\n" else "Temperature Normal\n");

Simulates an alarm when a threshold is exceeded.

Let’s Try →

ML Random Walk Simulation

val steps = 10;
val _ = ref 0;
val pos = ref 0;
for i = 1 to steps do (
    if Random.rand() < 0.5 then pos := !pos + 1 else pos := !pos - 1;
    print(Int.toString(!pos) ^ "\n");
);

Simulates a 1D random walk.

Let’s Try →

Frequently Asked Questions about Ml

What is Ml?

What are the primary use cases for Ml?

Compiler and interpreter development. Theorem proving and formal verification. Symbolic computation. Algorithm prototyping. Academic research and teaching functional programming

What are the strengths of Ml?

What are the limitations of Ml?

How can I practice Ml typing speed?

CodeSpeedTest offers 10+ real Ml code examples for typing practice. You can measure your WPM, track accuracy, and improve your coding speed with guided exercises.