Examples

Recursive Fibonacci

A classic recursive algorithm that showcases Juno's explicit type casting system. Notice how we cast between int and uint — Juno requires explicit conversions, preventing subtle bugs from implicit type coercion.

Copyimport Io;

uint fib(int n) {
  if (n < 2) {
    return uint<n>;
  }
  return fib(n-1) + fib(n-2);
}

void main() {
  int n = 6;
  Io.println("fib("^^string<n>^^") = "^^string<fib(n)>);
}

Key features demonstrated:

• Explicit type casting: uint<n> and string<n> show Juno's strict type system
• String concatenation: The ^^ operator joins strings together
• Recursion: Clean, readable recursive function definition
• Module imports: Simple import Io; gives access to I/O functions

Output:

fib(6) = 8

More examples coming soon!

I'm working on adding more examples to showcase Juno's features. Check back soon for:

• Working with structs and custom types
• Variant types in action
• File I/O operations
• String manipulation
• Working with Java libraries

Want to contribute an example? Check out our GitHub repository!