1 / 12

Comp 205: Comparative Programming Languages

Comp 205: Comparative Programming Languages. More User-Defined Types Tree types Catamorphisms Lecture notes, exercises, etc., can be found at: www.csc.liv.ac.uk/~grant/Teaching/COMP205/. Recursive Type Definitions. Some recursively-defined types:. data Nat = Zero | Succ Nat

idola-barry
Télécharger la présentation

Comp 205: Comparative Programming Languages

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Comp 205:Comparative Programming Languages • More User-Defined Types • Tree types • Catamorphisms • Lecture notes, exercises, etc., can be found at: • www.csc.liv.ac.uk/~grant/Teaching/COMP205/

  2. Recursive Type Definitions Some recursively-defined types: data Nat = Zero | Succ Nat data List a = Nil | Cons a (List a) data BTree a = Leaf a | Fork (BTree a) (BTree a)

  3. Fork Leaf Fork 2 Fork Leaf 9 Leaf Leaf 5 1 BTree Int

  4. Recursive Functions Some recursive functions on Nat: data Nat = Zero | Succ Nat -- convert "caveman notation" -- to decimal value :: Nat -> Int value Zero = 0 value (Succ n) = 1 + value n

  5. More Recursive Functions Some more recursive functions on Nat: data Nat = Zero | Succ Nat nplus :: Nat Nat -> Nat nplus m Zero = m nplus m (Succ n) = Succ (nplus m n) ntimes :: Nat Nat -> Nat ntimes m Zero = Zero ntimes m (Succ n) = nplus m (ntimes m n)

  6. Recursive Functions on BTrees data BTree a = Leaf a | Fork (BTree a) (BTree a) sumAll :: BTree Int -> Int sumAll (Leaf n) = n sumAll (Fork t1 t2) = (sumAll t1)+(sumAll t2) leaves :: BTree a -> [a] leaves (Leaf x) = [x] leaves (Fork t1 t2) = (leaves t1)++(leaves t2)

  7. Recursive Functions on BTrees data BTree a = Leaf a | Fork (BTree a) (BTree a) bTree_Map :: (a -> b) -> (BTree a) -> (BTree b) bTree_Map f (Leaf x) = Leaf (f x) bTree_Map f (Fork t1 t2) = Fork (bTree_Map f t1) (bTree_Map f t2)

  8. Recursive Functions on BTrees data BTree a = Leaf a | Fork (BTree a) (BTree a) BTree_Reduce :: (a -> b) -> (b -> b -> b) -> (BTree a) -> b bTree_Reduce f g (Leaf x) = f x bTree_Reduce f g (Fork t1 t2) = g (bTree_Reduce f g t1) (bTree_Reduce f g t2)

  9. Using Reduce The recursive functions above can all be expressed as reductions: sumAll = bTree_Reduce id (+) where id x = x leaves = bTree_Reduce (:[]) (++) bTree_Map f = bTree_Reduce (Leaf.f) Fork

  10. Catamorphisms • bTree_Reduce f g is a catamorphism: • - it replaces constructors with functions • bTree_Reduce f g replaces • Leaf with f • Fork with g

  11. g Fork f g Leaf Fork 2 g f 2 Fork Leaf 9 f f 9 Leaf Leaf 5 1 5 1 Replacing Constructors

  12. Summary • Recursive types • Catamorphisms • Next: Infinite lists and lazy evaluation

More Related