Presentation is loading. Please wait.

Presentation is loading. Please wait.

ML Datatypes.1 Standard ML Data types. ML Datatypes.2 Concrete Datatypes  The datatype declaration creates new types  These are concrete data types,

Published byRandolph Price Modified over 9 years ago

Similar presentations

Presentation on theme: "ML Datatypes.1 Standard ML Data types. ML Datatypes.2 Concrete Datatypes  The datatype declaration creates new types  These are concrete data types,"— Presentation transcript:

1 ML Datatypes.1 Standard ML Data types

2 ML Datatypes.2 Concrete Datatypes  The datatype declaration creates new types  These are concrete data types, not abstract  Concrete datatypes can be inspected - constructed and taken apart  ML’s datatypes has two kinds of values: atomic and composite  The only operations supported: Use atomic values Construct a composite value Take a composite value apart: pattern matching

3 ML Datatypes.3 Enumeration Datatypes  Enumeration types A datatype consisting of a finite number of constants datatype bool = true | false; true; val it = true : bool false; val it = false : bool fun not true = false | not false = true val not = fn: bool -> bool  But no order on the elements like Pascal, C

4 ML Datatypes.4 Composite Types  Cataloguing all types of drinks Coffee has a brand, number of sugar lumps and w/o milk e.g. Elite, 2 sugars, with milk - Thus, the type of Coffee should be: string*int*bool; Wine has vineyard name. e.g Shato-Lablan - Thus, the type of Wine should be: string; Beer has brand name. e.g. Paulaner. - Thus, the type of Beer should be: string; Water is simply water. There is nothing more to say. - Thus, the type of Water should be:unit; The datatype declaration for the type drink: datatype drink = Water | Coffee of string*int*bool | Wine of string | Beer of string;

5 ML Datatypes.5 Values of a datatype  May belong to compound data structures - val drinks = [Water, Coffee (“Elite”,2,true), Beer “Paulaner"]; val drinks = [Water,Coffee ("Elite",2,true),Beer "Paulaner"] : drink list  May be arguments and results of functions  Remember Patterns?

6 ML Datatypes.6 Explicit Pattern-Matching using “val”  val P = E Defines the variables in the pattern P to have the corresponding values of expression E.  Extracting a brand name - val p = Beer “Paulaner"; - val (Beer s) = p; val s = " Paulaner " : string - val (Wine s) = Beer "Paulaner"; uncaught exception Bind [nonexhaustive binding failure]  What will happen for the following: - val Water = Water; - val Water = “Paulaner"; val declaration fails if the matching fails (* OK *) (* FAIL - types mismatch *) Can't ruin constructors

7 ML Datatypes.7 Constructors in Patterns  Create titles for drinks: fun title Water = “Nature’s best Drink!" | title (Beer brand) = brand^“ Beer” | title (Wine brand) = brand^” Wine” | title (Coffee (brand, sugars, true)) = brand^” Coffee with “^ Int.toString(sugars)^” lumps, with milk” | title (Coffee (brand, sugars, false)) = brand^” Coffee with “^ Int.toString(sugars)^” lumps, no milk”; > val title = fn : drink -> string  Get brand names of drinks in a list : fun pname [] = [] | pname ((Beer s)::ps) = s::(pname ps) | pname ((Wine s)::ps) = s::(pname ps) | pname ((Coffee (s,_,_)) ::ps) = s::(pname ps) | pname (p :: ps) = pname ps; > val pname = fn : drink list -> string list

8 ML Datatypes.8 Polymorphic Datatypes  We can use datatypes to “unite” two different types: datatype number = whole of int | fraction of real;  We can abstract on this idea, and create a datatype uniting any two types; ‘a and ‘b datatype ('a,'b)union = type1 of 'a | type2 of 'b;  Three things are declared as a result: the type operator union the two constructors type1 : 'a -> ('a,'b)union type2 : 'b -> ('a,'b)union

9 ML Datatypes.9 Datatype ('a,'b)union  ('a,'b) union is a disjoint union of 'a and 'b Contains a copy of 'a OR a copy of 'b type1 and type2 can be viewed as labels that distinguish 'a from 'b  Allows several types where only a single type is allowed: ((string,int)union)list comprises string and integers [type1 "Audi", type2 80, type1 "Technion"] [type2 Water,type1 "Technion"] : type1 "Technion" : ((string,drink)union) list (string, 'a) union

10 ML Datatypes.10 The Disjoint union Pattern-matching can test whether type1 or type2 is present - fun concat1 [] = "" | concat1 ((type1 s)::l) = s ^ concat1 l | concat1 ((type2 _)::l) = concat1 l; val concat1 = fn:(string, 'a)union list -> string

11 ML Datatypes.11 Trees  datatype 'a tree = Nil | Br of 'a * 'a tree * 'a tree - val tree2 = Br(2,Br(1,Nil,Nil),Br(3,Nil,Nil)); val tree2 = Br (2,Br (1,Nil,Nil),Br (3,Nil,Nil)) : int tree - val tree5 = Br(5,Br(6,Nil,Nil),Br(7,Nil,Nil)); val tree5 =... : int tree - val tree4 = Br(4,tree2,tree5); val tree4 = Br(4,Br(2,Br(1,Nil,Nil),Br(3,Nil,Nil)), Br(5,Br(6,Nil,Nil),Br(7,Nil,Nil))) : int tree - fun count Nil = 0 | count (Br(v,t1,t2)) = 1 + count t1 + count t2; val count = fn : ‘a tree -> int

12 ML Datatypes.12 Binary Search Trees  The search tree will hold pairs of (key,value). The key will be an int.  The tree is sorted so any key on the left sub-tree is smaller than the current key (larger for the right sub-tree) 7 3 15 6 9 10 Remember: We will work on trees of pairs

13 ML Datatypes.13 Binary Search Trees - Search Function exception Bsearch of string; fun blookup(Br((curKey,data),lTree,rTree),searchedKey) = if (searchedKey curKey then blookup(rTree, searchedKey) else data | blookup(Nil, searchedKey) = raise Bsearch (“key "^Int.toString(searchedKey)^ ” not found!” ); > val blookup = fn:(int * ‘a) tree * int -> ‘a

14 ML Datatypes.14 Binary Search Trees – Insertion Function exception Bsearch of string; fun binsert(Nil, newKey, newData) = Br((newKey, newData), Nil, Nil) | binsert(Br((curKey,curData),lTree,rTree),newKey, newData) = if newKey curKey then Br((curKey,curData), lTree, binsert(rTree,newKey,newData)) else (*newKey=curKey*) raise Bsearch(“ The key "^Int.toString(b)^” is already in the tree! ”); > val binsert = fn:(int * ‘a)tree * int * ‘a -> (int * ‘a)tree

15 ML Datatypes.15 Question from a test (2004) שאלה 1 סעיף א' נתון: datatype ('a,'b) union = type1 of 'a | type2 of 'b; נכתוב פונקציה חד-חד-ערכית foo ב-ML שהטיפוס שלה הוא: ( unit, (bool->'a) * (bool->'b) ) union -> ( unit, ( (bool,bool) union -> ('a,'b) union ) ) union להלן הגדרת הפונקציה. השלימו את החסר בה: fun foo (type1___) = _____ | foo (type2 (f: bool->'a, g: bool->'b) ) = ____________________________ _____________________________________; fun foo (type1()) = type1() | foo (type2((f: bool->'a,g: bool->'b))) = type2( fn (type1(x)) => type1(f(x)) | (type2(x)) => type2(g(x)) );

16 ML Datatypes.16 Question from a test (2004) שאלה 1 סעיף א' נתון: datatype ('a,'b) union = type1 of 'a | type2 of 'b; נכתוב פונקציה חד-חד-ערכית foo ב-ML שהטיפוס שלה הוא: ( unit, (bool->'a) * (bool->'b) ) union -> ( unit, ( (bool,bool) union -> ('a,'b) union ) ) union להלן הגדרת הפונקציה. השלימו את החסר בה: fun foo (type1___) = _____ | foo (type2 (f: bool->'a, g: bool->'b) ) = ____________________________ _____________________________________; fun foo (type1()) = type1() | foo (type2((f: bool->'a,g: bool->'b))) = type2( fn (type1(x)) => type1(f(x)) | (type2(x)) => type2(g(x)) );

Download ppt "ML Datatypes.1 Standard ML Data types. ML Datatypes.2 Concrete Datatypes  The datatype declaration creates new types  These are concrete data types,"

Similar presentations

Types and Programming Languages Lecture 8 Simon Gay Department of Computing Science University of Glasgow 2006/07.

Types and Programming Languages Lecture 8 Simon Gay Department of Computing Science University of Glasgow 2006/07.
Modern Programming Languages, 2nd ed.

Modern Programming Languages, 2nd ed.
ML Lists.1 Standard ML Lists. ML Lists.2 Lists A list is a finite sequence of elements. [3,5,9] [a, list ] [] Elements may appear more than once [3,4]

ML Lists.1 Standard ML Lists. ML Lists.2 Lists A list is a finite sequence of elements. [3,5,9] ["a", "list" ] [] Elements may appear more than once [3,4]
ML Lists.1 Standard ML Lists. ML Lists.2 Lists  A list is a finite sequence of elements. [3,5,9] [a, list ] []  Elements may appear more than once.

ML Lists.1 Standard ML Lists. ML Lists.2 Lists  A list is a finite sequence of elements. [3,5,9] ["a", "list" ] []  Elements may appear more than once.
A Fourth Look At ML 1. Type Definitions Predefined, but not primitive in ML: Type constructor for lists: Defined for ML in ML datatype bool = true | false;

A Fourth Look At ML 1. Type Definitions Predefined, but not primitive in ML: Type constructor for lists: Defined for ML in ML datatype bool = true | false;
A Third Look At ML 1. Outline More pattern matching Function values and anonymous functions Higher-order functions and currying Predefined higher-order.

A Third Look At ML 1. Outline More pattern matching Function values and anonymous functions Higher-order functions and currying Predefined higher-order.
Type Variables in ML Until we know the type of a value (perhaps never!), we use a variable for its type Book uses, e.g., t1, tx, tf PL literature uses.

Type Variables in ML Until we know the type of a value (perhaps never!), we use a variable for its type Book uses, e.g., t1, tx, tf PL literature uses.
ML Exceptions.1 Standard ML Exceptions. ML Exceptions.2 Exceptions – The Need  An extensive part of the code is error handling  A function can return.

ML Exceptions.1 Standard ML Exceptions. ML Exceptions.2 Exceptions – The Need  An extensive part of the code is error handling  A function can return.
F28PL1 Programming Languages Lecture 14: Standard ML 4.

F28PL1 Programming Languages Lecture 14: Standard ML 4.
ML Declarations.1 Standard ML Declarations. ML Declarations.2 Declarations o Re-declaration of names in ML o The reserved words val rec o Pattern Matching.

ML Declarations.1 Standard ML Declarations. ML Declarations.2 Declarations o Re-declaration of names in ML o The reserved words "val rec" o Pattern Matching.
ML Lists.1 Standard ML Lists. ML Lists.2 Lists  A list is a finite sequence of elements. [3,5,9] [a, list ] []  ML lists are immutable.  Elements.

ML Lists.1 Standard ML Lists. ML Lists.2 Lists  A list is a finite sequence of elements. [3,5,9] ["a", "list" ] []  ML lists are immutable.  Elements.
ML Datatypes.1 Standard ML Data types. ML Datatypes.2 Concrete Datatypes  The datatype declaration creates new types  These are concrete data types,

ML Datatypes.1 Standard ML Data types. ML Datatypes.2 Concrete Datatypes  The datatype declaration creates new types  These are concrete data types,
ML Declarations.1 Standard ML Declarations. ML Declarations.2  Area of a circle: - val pi = 3.14159; val pi = 3.14159 : real - fun area (r) = pi*r*r;

ML Declarations.1 Standard ML Declarations. ML Declarations.2  Area of a circle: - val pi = ; val pi = : real - fun area (r) = pi*r*r;
ML Datatypes.1 Standard ML Data types. ML Datatypes.2 Concrete Data  Consists of constructions that can be inspected, taken apart, or joined to form.

ML Datatypes.1 Standard ML Data types. ML Datatypes.2 Concrete Data  Consists of constructions that can be inspected, taken apart, or joined to form.
Getting started with ML ML is a functional programming language. ML is statically typed: The types of literals, values, expressions and functions in a.

Getting started with ML ML is a functional programming language. ML is statically typed: The types of literals, values, expressions and functions in a.
ML: a quasi-functional language with strong typing Conventional syntax: - val x = 5; (*user input *) val x = 5: int (*system response*) - fun len lis =

ML: a quasi-functional language with strong typing Conventional syntax: - val x = 5; (*user input *) val x = 5: int (*system response*) - fun len lis =
Chapter ElevenModern Programming Languages1 A Fourth Look At ML.

Chapter ElevenModern Programming Languages1 A Fourth Look At ML.
A Fourth Look At ML Chapter ElevenModern Programming Languages, 2nd ed.1.

A Fourth Look At ML Chapter ElevenModern Programming Languages, 2nd ed.1.
Patterns in ML functions. Formal vs. actual parameters Here's a function definition (in C): –int add (int x, int y) { return x + y; } –x and y are the.

Patterns in ML functions. Formal vs. actual parameters Here's a function definition (in C): –int add (int x, int y) { return x + y; } –x and y are the.
Introduction to ML – Part 1 Frances Spalding. Assignment 1 chive/fall05/cos441/assignments/a1.ht m

Introduction to ML – Part 1 Frances Spalding. Assignment 1 chive/fall05/cos441/assignments/a1.ht m

Similar presentations

Ads by Google