view demo/list.ur @ 1675:13dad713da35

New, more principled heuristic for Especialize: only specialize uniform function arguments; that is, arguments that don't change across recursive calls
author Adam Chlipala <adam@chlipala.net>
date Wed, 11 Jan 2012 13:53:35 -0500
parents 669ac5e9a69e
children
line wrap: on
line source
datatype list t = Nil | Cons of t * list t

fun length [t] (ls : list t) =
    let
        fun length' (ls : list t) (acc : int) =
            case ls of
                Nil => acc
              | Cons (_, ls') => length' ls' (acc + 1)
    in
        length' ls 0
    end

fun rev [t] (ls : list t) = 
    let
        fun rev' (ls : list t) (acc : list t) =
            case ls of
                Nil => acc
              | Cons (x, ls') => rev' ls' (Cons (x, acc))
    in
        rev' ls Nil
    end