LFPL Prototype Compiler by Robert Atkey (frontend: uapl, example: div23.uapl)

An Interface to LFPL Prototype Compiler by Robert Atkey (frontend: uapl, example: div23.uapl)

Modify the example or use another one (div23.uapl, insertsort.uapl) :

Choose backend:

prog
datatype ln = NilN! | ConsN of int * ln

def (ln, ln) div23(ln l) =
    match div6(l) with (m6,y) ->
      match div23aux(y) with (m2,m3) ->
        (append(m2,m6),append(m3,m6))

def (ln, ln) div6(ln l) =
  match l with
          NilN -> (NilN, NilN)
        | ConsN(h,t)@d ->
            match div6(t) with (t1,t2) ->
              if divby(h,6)
              then (ConsN(h,t1)@d,t2)
              else (t1,ConsN(h,t2)@d)

def (ln, ln) div23aux(ln l) =
  match l with
          NilN -> (NilN, NilN)
        | ConsN(h,t)@d ->
            match div23aux(t) with (t1,t2) ->
              if divby(h,2)
              then (ConsN(h,t1)@d,t2)
              else if divby(h,3)
                   then (t1,ConsN(h,t2)@d)
                   else (t1,t2)

def ln append(ln x, ln y) =
  match x with
          NilN -> y
        | ConsN(h,t)@d -> ConsN(h,append(t,y))@d

def int divby(int n, int m) =
  m * (n / m) = n

def unit main() =
  let l = ConsN(1,ConsN(2,ConsN(3,ConsN(6,NilN)@new())@new())@new())@new() in
  let blah = print_list(l) in
  match div23(l) with (l2,l3) -> 
    let blah = print_list(l2) in
    let blah = print_list(l3) in
    ()

def unit print_list(ln x) =
  match x with
    NilN -> print_newline()
  | ConsN(h,t)@d -> 
      let blah = print_int(h) in
      let blah = print_space() in
      print_list(t)

end

Back to the main page of the compiler by Robert Atkey with the uapl frontend.
Other frontends available: lfpl , deel
Other compilers available: by Nick Brown , Borel

Back to the main project page.

Michal Konečnı

Last modified: Thu Feb 6 12:28:50 GMT 2003