CS116 Chapter 2: Module 2

• School: University of Waterloo
• Department: Computer Science
• Course: CS116
• Professor: John- Paul Pretti

Document Summary

Module 2 not as simple to formulate a contract for map because map works for many types of functions. Example (map sqr list) (map not list) (map string-length los) Consumes (num -> num [>=0]) and (listof num) (boolean -> boolean) and (listof boolean) (string -> nat) and (listof string) Filter filter consumers a predicate and a list and produces a list. Foldr foldr consumes a function with 2 parameters, and a base be careful with the use of x and y represent types of values. Polymorphism flexibility in the type of arguments is called polymorphism a polymorphic function has a contract that has variables for the types concept not limited to scheme (but easier to implement in scheme than other languages) Things that have many faces means that x and y do not have to be atomic values: num, booleans, etc. they can be structures lists, and lists of lists a well.