'Cnt m' presentation slideshows

Combinatorial Functions

Combinatorial Functions. Recursion for problem solving. Enumerating Initial segments ( prefixes ). inits [ 1 ,2,3] = [ [] ,[ 1 ],[ 1 ,2],[ 1 ,2,3]] inits [2,3] = [ [], [2], [2,3] ] fun inits [] = [[]] | inits (x::xs) = []:: (map (fn ys => x::ys)

237 views • 13 slides