Lambdas and Generics (Intro)
|
|
- Erick Scott
- 6 years ago
- Views:
Transcription
1
2 Lambdas and Generics (Intro) Dan S. Wallach and Mack Joiner, Rice University Copyright 2016 Dan S. Wallach, All Rights Reserved
3 New this week in Subversion! week02-lists (check it out!) edu/rice/week2lists/glist.java This week s project: adding several functions to GList This week s lab: writing lambda filter functions
4 Piazza / Subversion updates If you re not enrolled, you re no longer in Piazza The you originally registered under might be different. If you can t get in, check your for another invitation. Subversion as well Changes should kick in by the end of the day.
5 Thinking generically Last week, we built functional lists But everything is in terms of Object. This has problems. // // Functional lists // interface ObjectList { ObjectList add(object o); boolean contains(object o); Object head(); ObjectList tail(); boolean empty(); } ObjectList ol = ObjectList.makeEmpty().add("Hello").add("Rice").add("Owls"); System.out.println(ol.head()); // Owls System.out.println(ol.tail().head()); // Rice System.out.println(ol.tail().tail().head()); // Hello
6 Thinking generically When all the world s an Object You have to explicitly typecast. How can we require that ObjectList ol = ObjectList.makeEmpty().add("Hello").add("Rice").add("Owls"); String foo = (String) ol.head(); everything is the same type? We want to declare this to be a List of String. Require inputs to be String Guarantee outputs to be String Never need to typecast
7 Making a generic list Java allows us to have type parameters We re defining GList of T Static methods as well The makeempty() method takes a type parameter so it can return an empty list of the proper type. Static method type parameters show up to the left of the method name. And they re often not necessary! // // Generic functional lists // interface GList<T> { public T add(t o); public boolean contains(t o); public T head(); public GList<T> tail(); public boolean empty(); public static <T> GList<T> makeempty() {... } } GList<String> list = GList.<String>makeEmpty().add("Hello").add("Rice").add( Owls ); String s = list.head(); // no typecasting! Rule of thumb: try it with and without.
8 Shirt<T>
9 Shirt<T>
10 Vocabulary alert! Generics = Parametric Polymorphism (Type) Parameter = Type arguments in the brackets (<T>, etc.) Polymorphism = Same code can operate over different types Remember Zen Coding Rule #1: Don t Repeat Yourself. Generics help.
11 What about the singleton empty-list? Beforehand: one instance of the empty-list (SINGLETON) interface ObjectList { public static ObjectList makeempty() { return Empty.SINGLETON; } class Empty implements ObjectList { private static final ObjectList SINGLETON = new Empty(); // Constructor isn't for public use. private Empty() { }
12 What about the singleton empty-list? Afterward: still one instance of the empty-list But we re doing some weird stuff to pull this off. <> : type inference <?> : type wildcard interface GList<T> { /** * Create a new empty list of the given parameter type. */ public static <T> GList<T> makeempty() GList<T> castsingleton = (GList<T>) SINGLETON; return castsingleton; } class Empty<T> implements GList<T> { private Empty() { } private static final GList<?> SINGLETON = new Empty<>();
13 Under the hood: type erasure Rule #1: there s only ever one real class (GList, etc.) Java does type erasure, so GList<String> and GList<Foo> compile down to just GList Implications At runtime, inside GList<T>, we don t know what T actually is Forbidden: T t = new T(); We ll work around this later; other PL s have reified generics which fix this. There s only ever one static method / member of a given name private static final GList<?> SINGLETON = new Empty<>(); // original code private static final GList SINGLETON = new Empty (); // runtime implementation, after type erasure
14 Under the hood: type erasure Rule #1: there s only ever one real class (GList, etc.) Java does type erasure, so GList<String> and GList<Foo> compile down to just GList Implications At runtime, inside GList<T>, we don t know what T actually is Forbidden: T t = new T(); Our empty-list never returns a T, so we ll get away with our cheating. public T head() { throw new NoSuchElementException("can't take head() of an empty list"); } But there s no problem with returning GList<T>, since we get those from the main GList class. We ll work around this later; other PL s have reified generics which fix this. There s only ever one static public method GList<T> / member add(t of val) a given { name return new Cons<>(val, this); private static final GList<?> SINGLETON = new Empty<>(); // original code private static final GList SINGLETON = new Empty (); // runtime implementation, after type erasure }
15 Your friend: type inference Q: Why don t we need to declare the type parameter of the Cons<>? interface GList<T> { default GList<T> add(t val) { } return new Cons<>(val, this); A: Java figures it out from context. IntelliJ will yell at you if it can t make an inference. You must declare type parameters for variable declarations, return types, argument types. You often use a diamond <> for a constructor s type parameter. You often leave out the type parameter (no diamond) for method calls.
16 More type inference This code works: GList<Integer> numbers = GList.<Integer>makeEmpty().add(1).add(2).add(3); This code also works: GList<Integer> emptylist = GList.makeEmpty(); GList<Integer> numbers = emptylist.add(1).add(2).add(3); This code won t compile: GList<Integer> numbers = GList.<>makeEmpty().add(1).add(2).add(3); This code won t compile, either: GList<Integer> numbers = GList.makeEmpty().add(1).add(2).add(3);
17 More type inference This code works: GList<Integer> numbers = When in doubt, make yourself a separate empty-list of the correct type. GList.<Integer>makeEmpty().add(1).add(2).add(3); This code also works: GList<Integer> emptylist = GList.makeEmpty(); GList<Integer> numbers = emptylist.add(1).add(2).add(3); This code won t compile: GList<Integer> numbers = GList.<>makeEmpty().add(1).add(2).add(3); This code won t compile, either: GList<Integer> numbers = GList.makeEmpty().add(1).add(2).add(3);
18 More on generics coming Wednesday Instead, let s talk about lambdas.
19 Operating on a list Let s say we have a List of integers and we want the even numbers. Old-school, ugly, mutation style: List<Integer> originallist =... List<Integer> resultlist = new LinkedList<>(); for (int i : originallist) { if (i % 2 == 0) { resultlist.add(i); } }
20 No mutation!
21 Operating on a list New-school, beautiful, functional style: static GList<Integer> evens(glist<integer> input) { } return input.filter(i -> i % 2 == 0); lambda expression another operation on GList (just like add())
22 What s a lambda? A lambda is a function without a name i -> i % 2 == 0 This lambda takes one argument (i) and returns a boolean Note that there are no type declarations! How? Type inference. Java figures it out from context. We re operating on GList<Integer> so i must also be an integer
23 Using lambdas: the GList filter function public GList<T> filter(predicate<t> predicate) { if (predicate.test(headval)) { return tailval.filter(predicate).add(headval); } else { return tailval.filter(predicate); } }
24 Using lambdas: the GList filter function An instance of the Predicate interface (a lambda returning boolean) public GList<T> filter(predicate<t> predicate) { if (predicate.test(headval)) { return tailval.filter(predicate).add(headval); } else { return tailval.filter(predicate); } }
25 Using lambdas: the GList filter function public GList<T> filter(predicate<t> predicate) { if (predicate.test(headval)) { return tailval.filter(predicate).add(headval); } else { return tailval.filter(predicate); } } Applying the function
26 Functional programming vocabulary Predicate: a function that returns a boolean Operator: a function returning the same type unary operator: one argument (e.g., trig functions) binary operator: two arguments (e.g., addition, subtraction) Function: arguments and results can be different types Supplier: produces data (e.g., reading lines of text from a file) Consumer: eats data, has side effect, returns nothing (e.g., printing)
27 Various forms of lambda syntax These are all equivalent: public class Foo { // "inline" lambdas Function<Integer,Integer> oneplus1 = x -> x + 1; Function<Integer,Integer> oneplus2 = (x) -> { return x + 1; }; Function<Integer,Integer> oneplus3 = (Integer x) -> (x + 1); static int oneplusx(int x) { } return x + 1; } // "method reference" lambda (works for static and instance methods) Function<Integer,Integer> oneplus4 = Foo::oneplusx;
28 Common FP list operators list.map(function) list Apply the function to every element of the list, return a new list list.filter(predicate) list Compute a new list: every element where the predicate is true list.sort(comparator) list Return a new list sorted by a function that says which is bigger More coming on Wednesday!
29 Mapping Replace each element in a list with the function applied to it GList<Integer> originals =... ; GList<Integer> squares = originals.map(i -> i * i); GList<String> strings =...; GList<String> lowercases = strings.map(x -> x.tolowercase()); GList<Integer> strlengths = strings.map(string::length); Function return type can be different (e.g., String::length)
30 Your lab this week Writing lots of lambdas that filter lists! Don t start working on it until you arrive at your lab.
31 Live coding demo Implement GList.reverse() Walk through, demonstrate GList.map() Another type parameter!
Comp215: Thinking Generically
Comp215: Thinking Generically Dan S. Wallach (Rice University) Copyright 2015, Dan S. Wallach. All rights reserved. Functional APIs On Wednesday, we built a list of Objects. This works. But it sucks. class
More informationThinking Functionally
Thinking Functionally Dan S. Wallach and Mack Joyner, Rice University Copyright 2016 Dan S. Wallach, All Rights Reserved Reminder: Fill out our web form! Fill this out ASAP if you haven t already. http://goo.gl/forms/arykwbc0zy
More informationComp215: Covariance and Contravariance
Comp215: Covariance and Contravariance Dan S. Wallach (Rice University) Copyright 2015, Dan S. Wallach. All rights reserved. This is one of those deeper CS theory days Formal definitions aren t immediately
More informationMatching & more list functions
Matching & more list functions Dan S. Wallach and Mack Joyner, Rice University Copyright 2016 Dan Wallach, All Rights Reserved When you do the same thing over and over If statements start to get ugly If
More informationComp215: More lists. Dan S. Wallach (Rice University) Copyright 2015, Dan S. Wallach. All rights reserved.
Comp215: More lists Dan S. Wallach (Rice University) Copyright 2015, Dan S. Wallach. All rights reserved. What s a good list interface We now have two different kinds of lists: lazy and eager. (We ll talk
More informationComp215: More Recursion
Comp215: More Recursion Dan S. Wallach (Rice University) xkcd.com/1557 Copyright 2015, Dan S. Wallach. All rights reserved. Traditional, simple recursion class Fibonacci { return fib(n-1) + fib(n-2); Traditional,
More informationWelcome to Comp215: Introduction to Program Design
Welcome to Comp215: Introduction to Program Design Dan S. Wallach and Mack Joyner, Rice University Copyright 2016 Dan S. Wallach, All Rights Reserved Welcome, welcome! Java (really Java8) Recursion and
More informationIntroduction to Typed Racket. The plan: Racket Crash Course Typed Racket and PL Racket Differences with the text Some PL Racket Examples
Introduction to Typed Racket The plan: Racket Crash Course Typed Racket and PL Racket Differences with the text Some PL Racket Examples Getting started Find a machine with DrRacket installed (e.g. the
More informationCS 151. Linked Lists, Recursively Implemented. Wednesday, October 3, 12
CS 151 Linked Lists, Recursively Implemented 1 2 Linked Lists, Revisited Recall that a linked list is a structure that represents a sequence of elements that are stored non-contiguously in memory. We can
More informationComp215: Trees. Mack Joyner and Dan S. Wallach (Rice University) Copyright 2016, Dan S. Wallach. All rights reserved.
Comp215: Trees Mack Joyner and Dan S. Wallach (Rice University) Copyright 2016, Dan S. Wallach. All rights reserved. Trees Sometimes, a list isn t good enough Array List Binary Tree Hash Table Insert O(1)
More informationComp215: Trees. Dan S. Wallach (Rice University) Copyright 2015, Dan S. Wallach. All rights reserved.
Comp215: Trees Dan S. Wallach (Rice University) Copyright 2015, Dan S. Wallach. All rights reserved. Trees Sometimes, a list isn t good enough Array List Binary Tree Hash Table Insert O(1) unordered O(n)
More informationCSE 331 Software Design and Implementation. Lecture 14 Generics 2
CSE 331 Software Design and Implementation Lecture 14 Generics 2 James Wilcox / Winter 2016 Hi, I m James! Big picture Last time: Generics intro Subtyping and Generics Using bounds for more flexible subtyping
More informationThe list abstract data type defined a number of operations that all list-like objects ought to implement:
Chapter 7 Polymorphism Previously, we developed two data structures that implemented the list abstract data type: linked lists and array lists. However, these implementations were unsatisfying along two
More informationUsing Scala in CS241
Using Scala in CS241 Winter 2018 Contents 1 Purpose 1 2 Scala 1 3 Basic Syntax 2 4 Tuples, Arrays, Lists and Vectors in Scala 3 5 Binary output in Scala 5 6 Maps 5 7 Option types 5 8 Objects and Classes
More informationComp215: Enums / Testing
Comp215: Enums / Testing Dan S. Wallach (Rice University) Copyright 2015, Dan S. Wallach. All rights reserved. edu.rice.regex.namedmatcher You first write something like this: enum TokenType implements
More informationObjective-C. Stanford CS193p Fall 2013
New language to learn! Strict superset of C Adds syntax for classes, methods, etc. A few things to think differently about (e.g. properties, dynamic binding) Most important concept to understand today:
More informationDiscussion 4. Data Abstraction and Sequences
Discussion 4 Data Abstraction and Sequences Data Abstraction: The idea of data abstraction is to conceal the representation of some data and to instead reveal a standard interface that is more aligned
More informationOutline of lecture. i219 Software Design Methodology 6. Object oriented programming language 3. Kazuhiro Ogata (JAIST)
i219 Software Design Methodology 6. Object oriented programming language 3 Kazuhiro Ogata (JAIST) Outline of lecture 2 Primitive wrapper class Generics Primitive wrapper class 3 For each primitive type,
More information11/7/18 JAVA GENERICS. Java Collections. Java Collections. Using Java Collections. Proposals for adding Generics to Java.
JAVA GENERICS Lecture CS110 Fall 018 Photo credit: Andrew Kennedy Java Collections Early versions of Java lacked generics interface Collection { /** Return true iff the collection contains ob */ boolean
More informationCSCI 262 Data Structures. Arrays and Pointers. Arrays. Arrays and Pointers 2/6/2018 POINTER ARITHMETIC
CSCI 262 Data Structures 9 Dynamically Allocated Memory POINTERS AND ARRAYS 2 Arrays Arrays are just sequential chunks of memory: Arrays and Pointers Array variables are secretly pointers: x19 x18 x17
More informationCSE 331 Software Design and Implementation. Lecture 14 Generics 2
CSE 331 Software Design and Implementation Lecture 14 Generics 2 Zach Tatlock / Spring 2018 Big picture Last time: Generics intro Subtyping and Generics Using bounds for more flexible subtyping Using wildcards
More informationSummer 2017 Discussion 10: July 25, Introduction. 2 Primitives and Define
CS 6A Scheme Summer 207 Discussion 0: July 25, 207 Introduction In the next part of the course, we will be working with the Scheme programming language. In addition to learning how to write Scheme programs,
More informationSoftware Engineering /48
Software Engineering 1 /48 Topics 1. The Compilation Process and You 2. Polymorphism and Composition 3. Small Functions 4. Comments 2 /48 The Compilation Process and You 3 / 48 1. Intro - How do you turn
More informationAPCS Semester #1 Final Exam Practice Problems
Name: Date: Per: AP Computer Science, Mr. Ferraro APCS Semester #1 Final Exam Practice Problems The problems here are to get you thinking about topics we ve visited thus far in preparation for the semester
More informationLambdas in Java 8. Start programming in a more functional style
Lambdas in Java 8 Start programming in a more functional style Background Who am I? Tobias Coetzee I m a Technical Lead at BBD I present the Java Expert Level Certifications at BBD (EJB, JPA, etc.) I m
More informationIntro. Scheme Basics. scm> 5 5. scm>
Intro Let s take some time to talk about LISP. It stands for LISt Processing a way of coding using only lists! It sounds pretty radical, and it is. There are lots of cool things to know about LISP; if
More information1007 Imperative Programming Part II
Agenda 1007 Imperative Programming Part II We ve seen the basic ideas of sequence, iteration and selection. Now let s look at what else we need to start writing useful programs. Details now start to be
More informationComp215: Structured Data Semantics
Comp215: Structured Data Semantics Dan S. Wallach (Rice University) Copyright! 2015, Dan S. Wallach. All rights reserved. Here s a JSON structure for a newspaper "authors": [ "name": "Alice Action", "email":
More informationCurriculum Map Grade(s): Subject: AP Computer Science
Curriculum Map Grade(s): 11-12 Subject: AP Computer Science (Semester 1 - Weeks 1-18) Unit / Weeks Content Skills Assessments Standards Lesson 1 - Background Chapter 1 of Textbook (Weeks 1-3) - 1.1 History
More informationPolymorphism and Interfaces. Corky Cartwright Department of Computer Science Rice University
Polymorphism and Interfaces Corky Cartwright Department of Computer Science Rice University 1 Polymorphism In Scheme, we defined a multitude a different kinds of lists: list-of-numbers, list-of-symbols,
More informationCS 320: Concepts of Programming Languages
CS 320: Concepts of Programming Languages Wayne Snyder Computer Science Department Boston University Lecture 03: Bare-Bones Haskell Continued: o Function Application = Rewriting by Pattern Matching o Haskell
More informationCOMP 181. Agenda. Midterm topics. Today: type checking. Purpose of types. Type errors. Type checking
Agenda COMP 181 Type checking October 21, 2009 Next week OOPSLA: Object-oriented Programming Systems Languages and Applications One of the top PL conferences Monday (Oct 26 th ) In-class midterm Review
More informationJava Review: Objects
Outline Java review Abstract Data Types (ADTs) Interfaces Class Hierarchy, Abstract Classes, Inheritance Invariants Lists ArrayList LinkedList runtime analysis Iterators Java references 1 Exam Preparation
More informationObjects and Classes. Basic OO Principles. Classes in Java. Mark Allen Weiss Copyright 2000
Objects and Classes Mark Allen Weiss Copyright 2000 8/30/00 1 Basic OO Principles Objects are entities that have structure and state. Each object defines operations that may access or manipulate that state.
More informationRecursive Data and Recursive Functions
Structural Recursion and Induction Of all the material in this course, this lesson is probably the hardest for students to grasp at first, but it s also one of the most fundamental. Once you understand
More informationCollections, Maps and Generics
Collections API Collections, Maps and Generics You've already used ArrayList for exercises from the previous semester, but ArrayList is just one part of much larger Collections API that Java provides.
More informationCS61B Lecture #24. Today: Java support for generic programming. Readings for today: A Java Reference, Chapter 10.
CS61B Lecture #24 Today: Java support for generic programming Readings for today: A Java Reference, Chapter 10. Readings for Monday: Data Structures, 6.4. Last modified: Fri Oct 19 19:33:03 2012 CS61B:
More informationThe name of our class will be Yo. Type that in where it says Class Name. Don t hit the OK button yet.
Mr G s Java Jive #2: Yo! Our First Program With this handout you ll write your first program, which we ll call Yo. Programs, Classes, and Objects, Oh My! People regularly refer to Java as a language that
More informationCMSC162 Intro to Algorithmic Design II Blaheta. Lab March 2019
CMSC162 Intro to Algorithmic Design II Blaheta Lab 10 28 March 2019 This week we ll take a brief break from the Set library and revisit a class we saw way back in Lab 4: Card, representing playing cards.
More informationCompiler Construction 2016/2017 Polymorphic Types and Generics
Compiler Construction 2016/2017 Polymorphic Types and Generics Peter Thiemann January 8, 2017 Outline 1 Polymorphic Types and Generics 2 Parametric Polymorphism 3 Translation of Polymorphic Programs 4
More informationCS2113 Lab: Collections 10/29/2018
CS2113 Lab: Collections Yawei Wang 10/29/2018 Install and Use IntelliJ on Mac or Window If you haven t installed JDK before, go to https://www.oracle.com/technetwork/java/javaseproducts/downloads/in dex.html
More informationWelcome Back. CSCI 262 Data Structures. Hello, Let s Review. Hello, Let s Review. How to Review 8/19/ Review. Here s a simple C++ program:
Welcome Back CSCI 262 Data Structures 2 - Review What you learned in CSCI 261 (or equivalent): Variables Types Arrays Expressions Conditionals Branches & Loops Functions Recursion Classes & Objects Streams
More informationCS152: Programming Languages. Lecture 7 Lambda Calculus. Dan Grossman Spring 2011
CS152: Programming Languages Lecture 7 Lambda Calculus Dan Grossman Spring 2011 Where we are Done: Syntax, semantics, and equivalence For a language with little more than loops and global variables Now:
More informationHaskell Introduction Lists Other Structures Data Structures. Haskell Introduction. Mark Snyder
Outline 1 2 3 4 What is Haskell? Haskell is a functional programming language. Characteristics functional non-strict ( lazy ) pure (no side effects*) strongly statically typed available compiled and interpreted
More informationCIS 110: Introduction to Computer Programming
CIS 110: Introduction to Computer Programming Lecture 3 Express Yourself ( 2.1) 9/16/2011 CIS 110 (11fa) - University of Pennsylvania 1 Outline 1. Data representation and types 2. Expressions 9/16/2011
More informationLecture 7: Implementing Lists, Version 2
CS18 Integrated Introduction to Computer Science Fisler, Nelson Lecture 7: Implementing Lists, Version 2 Contents 1 The Impact of addfirst on Lists 1 2 Mutating List Contents 2 2.1 The Basic List Classes...................................
More informationCSE 413 Languages & Implementation. Hal Perkins Winter 2019 Structs, Implementing Languages (credits: Dan Grossman, CSE 341)
CSE 413 Languages & Implementation Hal Perkins Winter 2019 Structs, Implementing Languages (credits: Dan Grossman, CSE 341) 1 Goals Representing programs as data Racket structs as a better way to represent
More informationLambda Notes for CS 2102
Lambda Notes for CS 2102 Remember filter and map from CS1101/1102: ;; filter: (X- >Boolean) ListOfX - > ListOfX the function argument (X- > Boolean) is a predicate. Filter applies the predicate to each
More informationCS61BL. Lecture 1: Welcome to CS61BL! Intro to Java and OOP Testing Error-handling
CS61BL Lecture 1: Welcome to CS61BL! Intro to Java and OOP Testing Error-handling About me Name: Edwin Liao Email: edliao@berkeley.edu Office hours: Thursday 3pm - 5pm Friday 11am - 1pm 611 Soda Or by
More information16 Multiple Inheritance and Extending ADTs
Object-Oriented Design Lecture 16 CS 3500 Fall 2009 (Pucella) Tuesday, Nov 10, 2009 16 Multiple Inheritance and Extending ADTs We looked last time at inheritance and delegation as two ways to reuse implementation
More informationPhoto credit: Andrew Kennedy JAVA GENERICS
Photo credit: Andrew Kennedy JAVA GENERICS Lecture 17 CS2110 Spring 2017 Java Collections 2 Early versions of Java lacked generics interface Collection { /** Return true iff the collection contains ob
More informationCSE 113 A. Announcements - Lab
CSE 113 A February 21-25, 2011 Announcements - Lab Lab 1, 2, 3, 4; Practice Assignment 1, 2, 3, 4 grades are available in Web-CAT look under Results -> Past Results and if looking for Lab 1, make sure
More informationOutline. runtime of programs algorithm efficiency Big-O notation List interface Array lists
Outline runtime of programs algorithm efficiency Big-O notation List interface Array lists Runtime of Programs compare the following two program fragments: int result = 1; int result = 1; for (int i=2;
More informationAbstract Data Types and Data Structures
Unit 6, Part 1 Abstract Data Types and Data Structures Computer Science S-111 Harvard University David G. Sullivan, Ph.D. Congrats on completing the first half! In the second half, we will study fundamental
More informationFunctional Programming and Haskell
Functional Programming and Haskell Tim Dawborn University of Sydney, Australia School of Information Technologies Tim Dawborn Functional Programming and Haskell 1/22 What are Programming Paradigms? A programming
More informationOperator overloading
1 Introduction 2 The copy constructor 3 Operator Overloading 4 Eg 1: Adding two vectors 5 The -> operator 6 The this pointer 7 Overloading = 8 Unary operators 9 Overloading for the matrix class 10 The
More informationCOSC 2P91. Introduction Part Deux. Week 1b. Brock University. Brock University (Week 1b) Introduction Part Deux 1 / 14
COSC 2P91 Introduction Part Deux Week 1b Brock University Brock University (Week 1b) Introduction Part Deux 1 / 14 Source Files Like most other compiled languages, we ll be dealing with a few different
More informationCSCI-GA Scripting Languages
CSCI-GA.3033.003 Scripting Languages 12/02/2013 OCaml 1 Acknowledgement The material on these slides is based on notes provided by Dexter Kozen. 2 About OCaml A functional programming language All computation
More information+ Abstract Data Types
Linked Lists Abstract Data Types An Abstract Data Type (ADT) is: a set of values a set of operations Sounds familiar, right? I gave a similar definition for a data structure. Abstract Data Types Abstract
More informationCS 177 Recitation. Week 1 Intro to Java
CS 177 Recitation Week 1 Intro to Java Questions? Computers Computers can do really complex stuff. How? By manipulating data according to lists of instructions. Fundamentally, this is all that a computer
More informationExercise 8 Parametric polymorphism November 18, 2016
Concepts of Object-Oriented Programming AS 2016 Exercise 8 Parametric polymorphism November 18, 2016 Task 1 Consider the following Scala classes: class A class B extends A class P1[+T] class P2[T
More informationCS558 Programming Languages
CS558 Programming Languages Winter 2018 Lecture 7b Andrew Tolmach Portland State University 1994-2018 Dynamic Type Checking Static type checking offers the great advantage of catching errors early And
More informationIntro to Programming. Unit 7. What is Programming? What is Programming? Intro to Programming
Intro to Programming Unit 7 Intro to Programming 1 What is Programming? 1. Programming Languages 2. Markup vs. Programming 1. Introduction 2. Print Statement 3. Strings 4. Types and Values 5. Math Externals
More informationCSE 333. Lecture 11 - constructor insanity. Hal Perkins Paul G. Allen School of Computer Science & Engineering University of Washington
CSE 333 Lecture 11 - constructor insanity Hal Perkins Paul G. Allen School of Computer Science & Engineering University of Washington Administrivia Exercises: - New exercise out today, due Monday morning
More informationAdvanced Topics in Programming Languages Lecture 2 - Introduction to Haskell
Advanced Topics in Programming Languages Lecture 2 - Introduction to Haskell Ori Bar El Maxim Finkel 01/11/17 1 History Haskell is a lazy, committee designed, pure functional programming language that
More information6.092: Java for 6.170
6.092: Java for 6.170 Lucy Mendel MIT EECS MIT 6.092 IAP 2006 1 Course Staff Lucy Mendel Corey McCaffrey Rob Toscano Justin Mazzola Paluska Scott Osler Ray He Ask us for help! MIT 6.092 IAP 2006 2 Class
More informationCSE 331 Software Design and Implementation. Lecture 13 Generics 1
CSE 331 Software Design and Implementation Lecture 13 Generics 1 Zach Tatlock / Spring 2018 Varieties of abstraction Abstraction over computation: procedures (methods) int x1, y1, x2, y2; Math.sqrt(x1*x1
More informationCS152: Programming Languages. Lecture 11 STLC Extensions and Related Topics. Dan Grossman Spring 2011
CS152: Programming Languages Lecture 11 STLC Extensions and Related Topics Dan Grossman Spring 2011 Review e ::= λx. e x e e c v ::= λx. e c τ ::= int τ τ Γ ::= Γ, x : τ (λx. e) v e[v/x] e 1 e 1 e 1 e
More informationIntroducing Wybe a language for everyone
Introducing Wybe a language for everyone Peter Schachte joint work with Matthew Giuca The University of Melbourne Department of Computing and Information Systems 4 December 2013 Peter Schachte (Melbourne)
More informationCS 360: Programming Languages Lecture 12: More Haskell
CS 360: Programming Languages Lecture 12: More Haskell Geoffrey Mainland Drexel University Adapted from Brent Yorgey s course Introduction to Haskell. Section 1 Administrivia Administrivia Homework 5 due
More informationPerformance: It s harder than you d think to go fast
Performance: It s harder than you d think to go fast Dan S. Wallach and Mack Joyner, Rice University Copyright 2016 Dan Wallach, All Rights Reserved Today s lecture Prime number generation Several different
More informationn Closed book n You are allowed 5 cheat pages n Practice problems available in Course Materials n Check grades in Rainbow grades
Announcements Announcements n HW12: Transaction server n Due today at 2pm n You can use up to 2 late days, as always n Final Exam, December 17, 3-6pm, in DCC 308 and 318 n Closed book n You are allowed
More informationWelcome Back. CSCI 262 Data Structures. Hello, Let s Review. Hello, Let s Review. How to Review 1/9/ Review. Here s a simple C++ program:
Welcome Back CSCI 262 Data Structures 2 - Review What you learned in CSCI 261 (or equivalent): Variables Types Arrays Expressions Conditionals Branches & Loops Functions Recursion Classes & Objects Streams
More informationClasses, interfaces, & documentation. Review of basic building blocks
Classes, interfaces, & documentation Review of basic building blocks Objects Data structures literally, storage containers for data constitute object knowledge or state Operations an object can perform
More informationThese are notes for the third lecture; if statements and loops.
These are notes for the third lecture; if statements and loops. 1 Yeah, this is going to be the second slide in a lot of lectures. 2 - Dominant language for desktop application development - Most modern
More informationA First Look at ML. Chapter Five Modern Programming Languages, 2nd ed. 1
A First Look at ML Chapter Five Modern Programming Languages, 2nd ed. 1 ML Meta Language One of the more popular functional languages (which, admittedly, isn t saying much) Edinburgh, 1974, Robin Milner
More informationWhat is it? CMSC 433 Programming Language Technologies and Paradigms Spring Approach 1. Disadvantage of Approach 1
CMSC 433 Programming Language Technologies and Paradigms Spring 2007 Singleton Pattern Mar. 13, 2007 What is it? If you need to make sure that there can be one and only one instance of a class. For example,
More informationLab 10: OCaml sequences, comparators, stable sorting 12:00 PM, Nov 12, 2017
Integrated Introduction to Computer Science Hughes Lab 10: OCaml sequences, comparators, stable sorting 12:00 PM, Nov 12, 2017 Contents 1 A last OCaml type, and its utility 1 1.1 Sequences in OCaml....................................
More informationGrouping Objects (I)
KTH ROYAL INSTITUTE OF TECHNOLOGY Stockholm Sweden Grouping Objects (I) Managing collections of objects Ric Glassey glassey@kth.se Main concepts to be covered Grouping Objects Using ArrayLists Looping
More informationOCaml Data CMSC 330: Organization of Programming Languages. User Defined Types. Variation: Shapes in Java
OCaml Data : Organization of Programming Languages OCaml 4 Data Types & Modules So far, we ve seen the following kinds of data Basic types (int, float, char, string) Lists Ø One kind of data structure
More informationCSCI-142 Exam 1 Review September 25, 2016 Presented by the RIT Computer Science Community
CSCI-12 Exam 1 Review September 25, 2016 Presented by the RIT Computer Science Community http://csc.cs.rit.edu 1. Provide a detailed explanation of what the following code does: 1 public boolean checkstring
More informationCS558 Programming Languages
CS558 Programming Languages Winter 2017 Lecture 7b Andrew Tolmach Portland State University 1994-2017 Values and Types We divide the universe of values according to types A type is a set of values and
More informationSubclassing for ADTs Implementation
Object-Oriented Design Lecture 8 CS 3500 Fall 2009 (Pucella) Tuesday, Oct 6, 2009 Subclassing for ADTs Implementation An interesting use of subclassing is to implement some forms of ADTs more cleanly,
More informationThis example highlights the difference between imperative and functional programming. The imperative programming solution is based on an accumulator
1 2 This example highlights the difference between imperative and functional programming. The imperative programming solution is based on an accumulator (total) and a counter (i); it works by assigning
More informationJava Collections Framework
Java Collections Framework Introduction In this article from my free Java 8 course, you will be given a high-level introduction of the Java Collections Framework (JCF). The term Collection has several
More informationTail Calls. CMSC 330: Organization of Programming Languages. Tail Recursion. Tail Recursion (cont d) Names and Binding. Tail Recursion (cont d)
CMSC 330: Organization of Programming Languages Tail Calls A tail call is a function call that is the last thing a function does before it returns let add x y = x + y let f z = add z z (* tail call *)
More informationComputer Components. Software{ User Programs. Operating System. Hardware
Computer Components Software{ User Programs Operating System Hardware What are Programs? Programs provide instructions for computers Similar to giving directions to a person who is trying to get from point
More information18-Dec-09. Exercise #7, Joongle. Background. Sequential search. Consider the following text: Search for the word near
Exercise #7, Joongle Due Wednesday, December 23 rd, :00 2 weeks, not too long, no lab this Tuesday Boaz Kantor Introduction to Computer Science Fall semester 2009-200 IDC Herzliya Background Consider the
More informationTwo Types of Types. Primitive Types in Java. Using Primitive Variables. Class #07: Java Primitives. Integer types.
Class #07: Java Primitives Software Design I (CS 120): M. Allen, 13 Sep. 2018 Two Types of Types So far, we have mainly been dealing with objects, like DrawingGizmo, Window, Triangle, that are: 1. Specified
More informationCS152: Programming Languages. Lecture 24 Bounded Polymorphism; Classless OOP. Dan Grossman Spring 2011
CS152: Programming Languages Lecture 24 Bounded Polymorphism; Classless OOP Dan Grossman Spring 2011 Revenge of Type Variables Sorted lists in ML (partial): type a slist make : ( a -> a -> int) -> a slist
More informationInheritance and Interfaces
Inheritance and Interfaces Object Orientated Programming in Java Benjamin Kenwright Outline Review What is Inheritance? Why we need Inheritance? Syntax, Formatting,.. What is an Interface? Today s Practical
More informationArray Basics: Outline. Creating and Accessing Arrays. Creating and Accessing Arrays. Arrays (Savitch, Chapter 7)
Array Basics: Outline Arrays (Savitch, Chapter 7) TOPICS Array Basics Arrays in Classes and Methods Programming with Arrays Searching and Sorting Arrays Multi-Dimensional Arrays Static Variables and Constants
More informationCOMP 401 Fall Recitation 7: Factories and Lists
COMP 401 Fall 2017 Recitation 7: Factories and Lists Agenda High-level introduction to Factories Factory Example/Exercise Introduction to Lists List Performance Exercise Quiz 2 Recitation Source Code Please
More informationCSE413: Programming Languages and Implementation Racket structs Implementing languages with interpreters Implementing closures
CSE413: Programming Languages and Implementation Racket structs Implementing languages with interpreters Implementing closures Dan Grossman Fall 2014 Hi! I m not Hal J I love this stuff and have taught
More informationTyped Lambda Calculus and Exception Handling
Typed Lambda Calculus and Exception Handling Dan Zingaro zingard@mcmaster.ca McMaster University Typed Lambda Calculus and Exception Handling p. 1/2 Untyped Lambda Calculus Goal is to introduce typing
More informationStanford CS193p. Developing Applications for ios Fall Stanford CS193p. Fall 2013
Developing Applications for ios -14 Today What is this class all about? Description Prerequisites Homework / Final Project ios Overview What s in ios? MVC Object-Oriented Design Concept Objective C (Time
More informationRacket Style Guide Fall 2017
CS17 Integrated Introduction to Computer Science Hughes Racket Style Guide Fall 2017 Contents 1 Introduction 1 2 Naming 1 3 Formatting 1 4 Equality 3 5 Conditionals 4 5.1 Prefer Cond to If......................................
More informationGenerics. Computer Science and Engineering College of Engineering The Ohio State University. Lecture 10
Generics Computer Science and Engineering College of Engineering The Ohio State University Lecture 10 A Simple Component Client-side view: Pencil interface Pencil { String tostring(); void setcolor(colors
More informationAnnouncements. Lecture 14 Generics 1. Announcements. CSE 331 Software Design and Implementation. Leah Perlmutter / Summer 2018
CSE 331 Software Design and Implementation Lecture 14 Generics 1 Announcements Leah Perlmutter / Summer 2018 Announcements Quiz 5 is due Thursday Homework 6 due Thursday Midterm grades and feedback will
More informationCSE 331 Software Design and Implementation. Lecture 14 Generics 1
CSE 331 Software Design and Implementation Lecture 14 Generics 1 Leah Perlmutter / Summer 2018 Announcements Announcements Quiz 5 is due Thursday Homework 6 due Thursday Midterm grades and feedback will
More information