LFPL Compiler
Examples:
append.lfpl
assign.lfpl
assign1.lfpl
assign2.lfpl
call.lfpl
cons.lfpl
empty.lfpl
empty2.lfpl
empty3.lfpl
if.lfpl
if2.lfpl
insert.lfpl
leaf.lfpl
list1.lfpl
list2.lfpl
list3.lfpl
list4.lfpl
nil.lfpl
node.lfpl
reverse.lfpl
simple.lfpl
sort.lfpl
tree1.lfpl
tree2.lfpl
tree3.lfpl
void.lfpl
prog datatype list = Nil | Cons of int * list (* Insertion sort *) def list insert (int a,list l,<> d) = match l with Nil -> Nil | Cons(b,l in d1) -> (if a<b then Cons(a,Cons(b,l in d) in d1) else Cons(b,insert(b,l,d) in d1)) def list sort (list l) = match l with Nil -> Nil | Cons(a,l in d) -> insert(a,sort(l),d) end