generic.mu


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29

; To demonstrate generic functions, we'll construct a factorial function with
; separate base and recursive cases. Compare factorial.mu.

; def factorial n = n*factorial(n-1)
(def factorial [
  ((default-scope scope-address) <- new (scope literal) (30 literal))
  ((n integer) <- arg (0 literal))
  more-clauses
  ((x integer) <- sub (n integer) (1 literal))
  ((subresult integer) <- factorial (x integer))
  ((result integer) <- mul (subresult integer) (n integer))
  (reply (result integer))
])

; def factorial 0 = 1
(after factorial/more-clauses [
  { begin
    ((zero? boolean) <- eq (n integer) (0 literal))
    (break-unless (zero? boolean))
    (reply (1 literal))
  }
])

(def main [
  ((1 integer) <- factorial (5 literal))
  (print-primitive ("result: " literal))
  (print-primitive (1 integer))
  (print-primitive ("\n" literal))
])