
CS 251 Fall 20192019 Principles of of Programming Programming Languages Languages Ben Wood Topics λ Ben Wood • Tuples and records Datatypes, Patterns, • Positional vs. nominal and Parametric Polymorphism • Datatypes • Pattern matching • Parametric polymorphic types (generics) • Lists and options • Equality types Datatypes, Patterns, and Parametric Datatypes, Patterns, and Parametric 1 2 https://cs.wellesley.edu/~cs251/f19/ Polymorphism Polymorphism Tuples Tuple bindings Syntax: (e1, …, en) Syntax: val (x1, x2) = e Type checking: Evaluation: If e has type t1 * t2, 1. Evaluate e1 to v1, …, and en to vn. then #1 e has type t1 and #2 e has type t2 2. The result is (v1, …, vn) Evaluation: Type checking: 1. Evaluate e to a pair of values (v1, v2) in the current dynamic environment If e1 has type t1, …, and en has type tn, 2. Extend the current dynamic environment by then the pair expression has type ta * … * tn binding x1 to v1 and x2 to v2. Datatypes, Patterns, and Parametric Datatypes, Patterns, and Parametric 3 4 Polymorphism Polymorphism Poor style. Tuple accessors Examples Syntax: #1 e #2 e fun swap (pr : int*bool) = let val (x,y) = pr in (y,x) end fun sum_two_pairs (pr1 : int*int, pr2 : int*int) = Type checking: let val (x1,y1) = pr1 If e has type t1 * t2, val (x2,y2) = pr2 then #1 e has type t1 and #2 e has type t2 in x1 + y1 + x2 + y2 end fun div_mod (x : int, y : int) = (x div y, x mod y) Evaluation: 1. Evaluate e to a pair of values v1 and v2 in the fun sort_pair (pr : int*int) = let val (x,y) = pr current dynamic environment in 2. The result v1 if using #1; v2 if using #2 if x < y then pr else (y,x) end Datatypes, Patterns, and Parametric Datatypes, Patterns, and Parametric 5 6 Polymorphism Polymorphism Records Example Record values have fields (any name) holding values {name = "Wendy", id = 41123 - 12} {f1 = v1, …, fn = vn} Record types have fields (any name) holding types Has type {id : int, name : string} {f1 : t1, …, fn : tn} Evaluates to {id = 41111, name = "Wendy"} Order of fields in a record value or type never matters Building records: If an expression, e.g. variable x, has this type, then get fields with: {f1 = e1, …, fn = en} #id x #name x Accessing components: No record type declarations! #myfieldname e – The same program could also make a (Evaluation rules and type-checking as expected) {id=true,ego=false} of type {id:bool,ego:bool} Datatypes, Patterns, and Parametric Datatypes, Patterns, and Parametric 7 8 Polymorphism Polymorphism Design Choice By position vs. by name Tuples are sugar (structural/positional) (nominal) (4,7,9) {f=4,g=7,h=9} (e1,…,en) desugars to Common syntax decision {1=e1,…,n=en} Common hybrid: function/method arguments t1*…*tn desugars to {1:t1,…,n:tn} Records with contiguous fields 1...n printed like tuples Can write {1=4,2=7,3=9}, bad style Datatypes, Patterns, and Parametric Datatypes, Patterns, and Parametric 9 10 Polymorphism Polymorphism Lists How to build bigger data types Racket: (cons 1 (cons 2 (cons 3 null))) Data type building blocks in any language – Product types (“Each of”): ML has a "no value" value written (), pronounced Value contains values of each of t1 t2 … tn "unit," with type unit Value contains a t1 and a t2 and … and a tn – Sum types (“One of”): What is the type of: (1, (2, (3, ()))) Value contains values of one of t1 t2 … tn Value is t1 xor a t2 xor … xor a tn What is the type of: (1, (2, (3, (4, ())))) – Recursive types (“Self reference”): A t value can refer to other t values Why is this a problem? Datatypes, Patterns, and Parametric Datatypes, Patterns, and Parametric 11 12 Polymorphism Polymorphism Datatype bindings Datatypes: constructing values datatype mytype = TwoInts of int * int datatype mytype = TwoInts of int * int | Str of string | Str of string | Pizza | Pizza Algebraic Data Type – Values of type mytype produced by one of the constructors • Adds new type mytype to environment – Value contains: • Adds constructors to environment: TwoInts, Str, Pizza − Tag: which constructor (e.g., TwoInts) − Carried value (e.g., (7,9)) • Constructor: function that makes values of new type (or is a – Examples: value of new type): − TwoInts (3+4,5+4) evaluates to TwoInts (7,9) – TwoInts : int * int -> mytype − Str if true then “hi” else “bye” – Str : string -> mytype evaluates to Str “hi” – Pizza : mytype − Pizza is a value Datatypes, Patterns, and Parametric Datatypes, Patterns, and Parametric 13 14 Polymorphism Polymorphism Datatypes: using values Pattern matching Rad!! 1. Check what variant it is (what constructor made it) Case expression and pattern-matching 2. Extract carried data (if that variant has any) fun f x = (* f has type mytype -> int *) case x of ML could create functions to get parts of datatype values Pizza => 3 | TwoInts(i1,i2) => i1+i2 – Like to pair? or cdr in Racket | Str s => String.size s – Instead it does something much better... All-in-one: – Multi-branch conditional, picks branch based on variant. – Extracts data and binds to branch-local variables. – Type-check: all branches must have same type. Datatypes, Patterns, and Parametric – Gets even better later. Datatypes, Patterns, and Parametric 15 16 Polymorphism Polymorphism Pattern matching Pattern matching rocks. case e0 of Syntax: p1 => e1 1. Cannot forget a case | p2 => e2 … (inexhaustive pattern-match warning) | pn => en 2. Cannot duplicate a case • (For now), each pattern pi is: (redundant pattern type-checking error) – a constructor name followed by the right number of variables: – C or D x or E (x,y) or … 3. Cannot forget to test the variant correctly • Patterns are not expressions. and get an error ((car null) in Racket) – We do not evaluate them. – We match e0 against their structure. 4. It's much more general. Supports elegant, concise code. • Precise type-checking/evaluation rules later... Datatypes, Patterns, and Parametric Datatypes, Patterns, and Parametric 17 18 Polymorphism Polymorphism Useful examples Lists! Enumerations, carrying other data A list is either: datatype suit = Club | Diamond | Heart | Spade – The empty list; or datatype card_value = Jack | Queen | King | Ace | Num of int – A pair of a list element and a list that holds the rest of the list. Alternate ways of identifying real-world things/people datatype mylist = Empty datatype id = StudentNum of int | Cons of int * mylist | Name of string * (string option) datatypes can be recursive * string val some_ints = Cons (1, Cons (2, Cons (3, Empty))) Datatypes, Patterns, and Parametric Datatypes, Patterns, and Parametric 19 20 Polymorphism Polymorphism Accessing Lists Syntactic sugar for lists: build The empty list is a value: [] val some_ints = Cons (1, Cons (2, Cons (3, Empty))) A list of expressions/values is an fun length (xs : mylist) = expression/value: case xs of Empty => 0 [e1,e2,…,en] [v1,v2,…,vn] | Cons (x, xs') => 1 + length xs' If e1 evaluates to v fun sum (xs : mylist) = case xs of and e2 evaluates to a list [v1,…,vn], Empty => 0 then e1::e2 evaluates to [v,v1,…,vn] | Cons (x, xs') => x + sum xs' Datatypes, Patterns, and Parametric Datatypes, Patterns, and Parametric 21 22 Polymorphism Polymorphism Syntactic sugar for lists: access Type-checking list operations For any type t, type t list describes lists where all val some_ints = [1,2,3] elements have type t note the space between int and list int list bool list int list list (int * int) list (int list * int) list fun length (xs : int list) = case xs of [] : t list list for any type t [] => 0 SML uses type 'a list to indicate this (“quote a” or “alpha”) | x::xs' => 1 + length xs' e1::e2 : t list if and only if: fun sum (xs : int list) = – e1 : t and case xs of – e2 : t list [] => 0 | x::xs' => x + sum xs' More on 'a soon! (Nothing to do with 'a in Racket.) Datatypes, Patterns, and Parametric Datatypes, Patterns, and Parametric 23 24 Polymorphism Polymorphism (type?) Example list functions (types?) Example higher-order list functions fun countdown (x : int) = if x=0 fun map (f : int -> int, xs : int list) = then [] case xs of else x :: countdown (x-1) [] => [] | x::xs' => f x :: map (f, xs') fun append (xs : int list, ys : int list) = case xs of [] => ys • These examples only work on lists of ints. | x::xs' => x :: append (xs', ys) • Should be more general: work on any list fun rev (xs : int list) = – and any function for map... let fun revtail (acc : int list, xs : int list) = case xs of [] => acc | x::xs' => revtail (x :: acc, xs') in revtail ([], xs) Datatypes, Patterns, and Parametric Datatypes, Patterns, and Parametric end 25 26 Polymorphism Polymorphism Polymorphic types + type inference Polymorphic types + type inference The identity function: fun id (x : int) = x fun swap pair = val id : int -> int let val (x,y) = pair in (y,x) end val swap : ('a * 'b) -> ('b * 'a) Omit the type: fun id x = x Works on any type of pair! val id : 'a -> 'a val pair = swap (4,"hello") General! is more general than . • 'a is a polymorphic type variable ('a * 'b) (int * string) stands in for any type • "id takes an argument of any type and returns a Here, int instantiates 'a and string instantiates 'b. result of that same type." Datatypes, Patterns, and Parametric Datatypes, Patterns, and Parametric 27 28 Polymorphism Polymorphism Polymorphic datatypes Polymorphic list functions (types?) Lists that can hold elements of any one type. fun append (xs, ys) = case xs of datatype 'a mylist = Empty [] => ys | Cons of 'a * 'a mylist | x::xs' => x :: append (xs', ys) fun rev (xs) = A list of "alphas" is either: let fun revtail (acc : int list, xs : int list) = – the empty list; or case xs of – a pair of an "alpha" and a list of "alphas" [] => acc | x::xs' => revtail (x :: acc, xs') in revtail [] xs end datatype 'a list = [] | :: of 'a * 'a list fun map (f, xs) = case xs of The type int list is an instantiation of the type 'a list, where [] => [] the type variable 'a is instantiated with int.
Details
-
File Typepdf
-
Upload Time-
-
Content LanguagesEnglish
-
Upload UserAnonymous/Not logged-in
-
File Pages9 Page
-
File Size-