Produced by. Design Patterns. MSc in Computer Science. Eamonn de Leastar
|
|
|
- Homer Solomon Golden
- 6 years ago
- Views:
Transcription
1 Design Patterns MSc in Computer Science Produced by Eamonn de Leastar Department of Computing, Maths & Physics Waterford Institute of Technology
2 Swift in Context
3 Java Example Java algorithm to filter a list of strings Only printing those shorter than 3 (in this test case). import java.util.arraylist; import java.util.list; public static void main(string[] args) List<String> names = new ArrayList<String>(); names.add("ted"); names.add("fred"); names.add("jed"); names.add("ned"); System.out.println(names); Erase e = new Erase(); List<String> short_names = e.filterlongerthan(names, 3); System.out.println(short_names.size()); for (String s : short_names) System.out.println(s); public List<String> filterlongerthan(list<string> strings, int length) List<String> result = new ArrayList<String>(); for (String s : strings) if (s.length() < length + 1) result.add(s); return result; 3
4 Groovy 1 Also a valid Groovy program... import java.util.arraylist; import java.util.list; public static void main(string[] args) List<String> names = new ArrayList<String>(); names.add("ted"); names.add("fred"); names.add("jed"); names.add("ned"); System.out.println(names); Erase e = new Erase(); List<String> short_names = e.filterlongerthan(names, 3); System.out.println(short_names.size()); for (String s : short_names) System.out.println(s); public List<String> filterlongerthan(list<string> strings, int length) List<String> result = new ArrayList<String>(); for (String s : strings) if (s.length() < length + 1) result.add(s); return result; 4
5 Groovy 1 Do we need generics? What about semicolons... Should standard libraries be imported? import java.util.arraylist; import java.util.list; public static void main(string[] args) List<String> names = new ArrayList<String>(); names.add("ted"); names.add("fred"); names.add("jed"); names.add("ned"); System.out.println(names); Erase e = new Erase(); List<String> short_names = e.filterlongerthan(names, 3); System.out.println(short_names.size()); for (String s : short_names) System.out.println(s); public List<String> filterlongerthan(list<string> strings, int length) List<String> result = new ArrayList<String>(); for (String s : strings) if (s.length() < length + 1) result.add(s); return result; 5
6 Groovy 2 public static void main(string[] args) List names = new ArrayList() names.add("ted") names.add("fred") names.add("jed") names.add("ned") System.out.println(names) Erase e = new Erase() List short_names = e.filterlongerthan(names, 3) System.out.println(short_names.size()) for (String s : short_names) System.out.println(s) public List filterlongerthan(liststrings, length) List result = new ArrayList(); for (String s : strings) if (s.length() < length + 1) result.add(s) return result 6
7 Groovy 2 Do we need the static types? Must we always have a main method and class definition? Consistency (size or length)? public static void main(string[] args) List names = new ArrayList() names.add("ted") names.add("fred") names.add("jed") names.add("ned") System.out.println(names) Erase e = new Erase() List short_names = e.filterlongerthan(names, 3) System.out.println(short_names.size()) for (String s : short_names) System.out.println(s) public List filterlongerthan(liststrings, length) List result = new ArrayList(); for (String s : strings) if (s.length() < length + 1) result.add(s) return result 7
8 Groovy 3 def filterlongerthan(strings, length) List result = new ArrayList(); for (String s : strings) if (s.length() < length + 1) result.add(s) return result List names = new ArrayList() names.add("ted") names.add("fred") names.add("jed") names.add("ned") System.out.println(names) List short_names = filterlongerthan(names, 3) System.out.println(short_names.size()) for (String s : short_names) System.out.println(s) 8
9 Groovy 3 Should we have a special notation for lists? And special facilities for list processing? def filterlongerthan(strings, length) List result = new ArrayList(); for (String s : strings) if (s.length() < length + 1) result.add(s) return result List names = new ArrayList() names.add("ted") names.add("fred") names.add("jed") names.add("ned") System.out.println(names) List short_names = filterlongerthan(names, 3) System.out.println(short_names.size()) for (String s : short_names) System.out.println(s) 9
10 Groovy 4 def filterlongerthan(strings, length) return strings.findall it.size() <= length names = ["Ted", "Fred", "Jed", "Ned"] System.out.println(names) List short_names = filterlongerthan(names, 3) System.out.println(short_names.size()) short_names.each System.out.println(it) 10
11 Groovy 4 Method needed any longer? Is there an easier way to use common methods (e.g. println)? Are brackets always needed? def filterlongerthan(strings, length) return strings.findall it.size() <= length names = ["Ted", "Fred", "Jed", "Ned"] System.out.println(names) List short_names = filterlongerthan(names, 3) System.out.println(short_names.size()) short_names.each System.out.println(it) 11
12 Groovy 5 names = ["Ted", "Fred", "Jed", "Ned"] println names short_names = names.findallit.size() <= 3 println short_names.size() short_names.each println it 12
13 import java.util.arraylist; import java.util.list; public static void main(string[] args) List<String> names = new ArrayList<String>(); names.add("ted"); names.add("fred"); names.add("jed"); names.add("ned"); System.out.println(names); Erase e = new Erase(); List<String> short_names = e.filterlongerthan(names, 3); System.out.println(short_names.size()); for (String s : short_names) System.out.println(s); public List<String> filterlongerthan(list<string> strings, int length) List<String> result = new ArrayList<String>(); for (String s : strings) if (s.length() < length + 1) result.add(s); return result; names = ["Ted", "Fred", "Jed", "Ned"] println names short_names = names.findallit.size() <= 3 println short_names.size() short_names.each println it Java vs Groovy? 13
14 Java Example -> XTend Unlike Groovy - this is NOT an XTend Program import java.util.arraylist; import java.util.list; public static void main(string[] args) List<String> names = new ArrayList<String>(); names.add("ted"); names.add("fred"); names.add("jed"); names.add("ned"); System.out.println(names); Erase e = new Erase(); List<String> short_names = e.filterlongerthan(names, 3); System.out.println(short_names.size()); for (String s : short_names) System.out.println(s); public List<String> filterlongerthan(list<string> strings, int length) List<String> result = new ArrayList<String>(); for (String s : strings) if (s.length() < length + 1) result.add(s); return result; 14
15 def & var Are semicolons necessary? import java.util.arraylist; import java.util.list; def static void main(string[] args) var List<String> names = new ArrayList<String>(); names.add("ted"); names.add("fred"); names.add("jed"); names.add("ned"); System.out.println(names); var Erase e = new Erase(); var List<String> short_names = e.filterlongerthan(names, 3); System.out.println(short_names.size()); for (String s : short_names) System.out.println(s); def List<String> filterlongerthan(list<string> strings, int length) var List<String> result = new ArrayList<String>(); for (String s : strings) if (s.length() < length + 1) result.add(s); return result; 15
16 No semicolons Can some types be inferred? import java.util.arraylist; import java.util.list; def static void main(string[] args) var List<String> names = new ArrayList<String>() names.add("ted") names.add("fred") names.add("jed") names.add("ned") System.out.println(names) var Erase e = new Erase() var List<String> short_names = e.filterlongerthan(names, 3) System.out.println(short_names.size()) for (String s : short_names) System.out.println(s) def List<String> filterlongerthan(list<string> strings, int length) var List<String> result = new ArrayList<String>() for (String s : strings) if (s.length() < length + 1) result.add(s) return result 16
17 Type inference What about Collection Literals? import java.util.arraylist; import java.util.list; def static void main(string[] args) var names = new ArrayList<String>() names.add("ted") names.add("fred") names.add("jed") names.add("ned") System.out.println(names) var e = new Erase() var short_names = e.filterlongerthan(names, 3) System.out.println(short_names.size()) for (s : short_names) System.out.println(s) def filterlongerthan(list<string> strings, int length) var result = new ArrayList<String>() for (s : strings) if (s.length() < length + 1) result.add(s) return result 17
18 Collection Literals Can Lambas simplify code? import java.util.arraylist; import java.util.list; def static void main(string[] args) var names = #["Ted", "Fred", "Jed", "Ned"] System.out.println(names) var e = new Erase() var short_names = e.filterlongerthan(names, 3) System.out.println(short_names.size()) for (s : short_names) System.out.println(s) def filterlongerthan(list<string> strings, int length) var result = new ArrayList<String>() for (s : strings) if (s.length() < length + 1) result.add(s) return result 18
19 Lambdas What are List Comprehensions? import java.util.arraylist; import java.util.list; def static void main(string[] args) var names = #["Ted", "Fred", "Jed", "Ned"] System.out.println(names) var e = new Erase() var short_names = e.filterlongerthan(names, 3) System.out.println(short_names.size()) short_names.foreach[system.out.println(it)] def filterlongerthan(list<string> strings, int length) val result = new ArrayList<String>() strings.foreach[ if (it.length() < length + 1) result.add(it) ] result 19
20 Filters/List Comprehensions Do we need the at all? import java.util.list; def static void main(string[] args) var names = #["Ted", "Fred", "Jed", "Ned"] System.out.println(names) var e = new Erase() var short_names = e.filterlongerthan(names, 3) System.out.println(short_names.size()) short_names.foreach[system.out.println(it)] def filterlongerthan(list<string> strings, int length) val list = strings.filter[it.length() <= 3] list 20
21 Final Version def static void main(string[] args) var names = #["Ted", "Fred", "Jed", "Ned"] println(names) var short_names = names.filter[it.length() <= 3] println(short_names.size()) short_names.foreach[println(it)] 21
22 import java.util.arraylist; import java.util.list; Java public static void main(string[] args) List<String> names = new ArrayList<String>(); names.add("ted"); names.add("fred"); names.add("jed"); names.add("ned"); System.out.println(names); Erase e = new Erase(); List<String> short_names = e.filterlongerthan(names, 3); System.out.println(short_names.size()); for (String s : short_names) System.out.println(s); public List<String> filterlongerthan(list<string> strings, int length) List<String> result = new ArrayList<String>(); for (String s : strings) if (s.length() < length + 1) result.add(s); return result; java def static void main(string[] args) var names = #["Ted", "Fred", "Jed", "Ned"] println(names) var short_names = names.filter[it.length() <= 3] println(short_names.size()) short_names.foreach[println(it)] names = ["Ted", "Fred", "Jed", "Ned"] println names short_names = names.findallit.size() <= 3 println short_names.size() short_names.each println it xtend groovy 22
23 Java Example Java algorithm to filter a list of strings Only printing those shorter than 3 (in this test case). import java.util.arraylist; import java.util.list; public static void main(string[] args) List<String> names = new ArrayList<String>(); names.add("ted"); names.add("fred"); names.add("jed"); names.add("ned"); System.out.println(names); Erase e = new Erase(); List<String> short_names = e.filterlongerthan(names, 3); System.out.println(short_names.size()); for (String s : short_names) System.out.println(s); public List<String> filterlongerthan(list<string> strings, int length) List<String> result = new ArrayList<String>(); for (String s : strings) if (s.length() < length + 1) result.add(s); return result; 23
24 Swift import Foundation func main() var names:string[] = String[]() names.append ("ted") names.append ("fred") names.append ("jed") names.append ("ned") println(names) var short_names:string[] = filterlongerthan(names, length:3) for name:string in short_names println (name) func filterlongerthan (strings : String[], length : Int) -> String[] var result:string[] = String[]() for s:string in strings if countelements(s) < length + 1 result.append(s) return result var erase:erase = Erase() erase.main() 24
25 Swift Type Inference import Foundation func main() var names = String[]() names.append ("ted") names.append ("fred") names.append ("jed") names.append ("ned") println(names) var short_names = filterlongerthan(names, length:3) for name in short_names println (name) func filterlongerthan (strings : String[], length : Int) -> String[] var result = String[]() for s in strings if countelements(s) < length + 1 result.append(s) return result var erase = Erase() erase.main() 25
26 Swift Literals import Foundation func main() var names = ["ted", "fred", "jed", "ned"] var short_names = filterlongerthan(names, length:3) for name in short_names println (name) func filterlongerthan (strings : String[], length : Int) -> String[] var result = String[]() for s in strings if countelements(s) < length + 1 result.append(s) return result var erase = Erase() erase.main() 26
27 Swift Closures import Foundation func main() var names = ["ted", "fred", "jed", "ned"] var short_names = names.filter countelements($0) < 4 for name in short_names println (name) var erase = Erase() erase.main() 27
28 Swift Final version import Foundation var names = ["ted", "fred", "jed", "ned"] println(names) var short_names = names.filter countelements($0) < 4 println(short_names) 28
29 import java.util.arraylist; import java.util.list; public static void main(string[] args) List<String> names = new ArrayList<String>(); names.add("ted"); names.add("fred"); names.add("jed"); names.add("ned"); System.out.println(names); Erase e = new Erase(); List<String> short_names = e.filterlongerthan(names, 3); System.out.println(short_names.size()); for (String s : short_names) System.out.println(s); public List<String> filterlongerthan(list<string> strings, int length) List<String> result = new ArrayList<String>(); for (String s : strings) if (s.length() < length + 1) result.add(s); return result; names = ["Ted", "Fred", "Jed", "Ned"] println names short_names = names.findallit.size() <= 3 short_names.each println it var names = #["Ted", "Fred", "Jed", "Ned"] println(names) var short_names = names.filter[it.length() <= 3] short_names.foreach[println(it)] var names = ["ted", "fred", "jed", "ned"] println(names) var short_names = names.filter countelements($0) < 4 println(short_names) 29
30 Family Tree (3) 30
31 Smalltalk Cluster 31
32 Objective-C Scala Groovy Swift Xtend Go
33
34
35 Another Approach to Types? Type Inference : the compiler draws conclusions about the types of variables based on how programmers use those variables. Yields programs that have some of the conciseness of Dynamically Typed Languages But - decision made at compile time, not at run time More information for static analysis - refactoring tools, complexity analysis. bug checking etc... Haskell, Scala, Xtend object InferenceTest1 extends Application val x = * 3 // the type of x is Int val y = x.tostring() // the type of y is String def succ(x: Int) = x + 1 // method succ returns Int values 35
36 Pragmatic Languages Python Ruby Smalltalk Groovy Javascript PHP Scala Go Swift C Java C# C++ Objective-C 36
37 Typing Spectrum Dynamic Python Smalltalk Javascript Ruby Groovy PHP Inferred Scala Go Swift C Java C# C++ Objective-C Static Strong Weak 37
38 Except where otherwise noted, this content is licensed under a Creative Commons Attribution-NonCommercial 3.0 License. For more information, please see creativecommons.org/licenses/by-nc/3.0/
Produced by. ICT Skills Summer School. Eamonn de Leastar Department of Computing, Maths & Physics Waterford Institute of Technology
ICT Skills Summer School Produced b Eamonn de Leastar edeleastar@wit.ie Department of Computing, Maths & Phsics Waterford Institute of Technolog http://www.wit.ie http://elearning.wit.ie Tping in Programming
Groovy Primer Chris Dail Groovy Primer (March 2010)
Groovy Primer Chris Dail http://chrisdail.com Twitter: @chrisdail What is Groovy? An agile dynamic language for the Java Platform Both dynamically and statically typed Functional programming influence
Produced by. Agile Software Development. Eamonn de Leastar
Agile Software Development Produced by Eamonn de Leastar (edeleastar@wit.ie) Department of Computing, Maths & Physics Waterford Institute of Technology http://www.wit.ie http://elearning.wit.ie Xtend Programming
Produced by. Agile Software Development. Eamonn de Leastar
Agile Software Development Produced by Eamonn de Leastar (edeleastar@wit.ie) Department of Computing, Maths & Physics Waterford Institute of Technology http://www.wit.ie http://elearning.wit.ie Xtend Programming
Xtend Programming Language
Xtend Programming Language Produced by: Eamonn de Leastar (edeleastar@wit.ie) Department of Computing and Mathematics http://www.wit.ie/ Agenda Subtitle Excellent Xtend User Guide (Version 2.6) API Docs
Jussi Riihelä / Jussi Riihelä
28.4.2006 Jussi Riihelä jussi.riihela@nokia.com 1 2006-04-28 / Jussi Riihelä Content Basic facts and motivation Groovy features IDE support and runtime dependencies Criticism 2 2006-04-28 / Jussi Riihelä
Dynamic Languages and Increasing the Quality of. Software and Velocity in the Software Development. Lifecycle. Mark McFadden
Dynamic Languages SDLC 1 Running Head: DYNAMIC LANGUAGES SDLC Dynamic Languages and Increasing the Quality of Software and Velocity in the Software Development Lifecycle. Mark McFadden MBI 630 Systems
Produced by. Design Patterns. MSc Computer Science. Eamonn de Leastar
Design Patterns MSc Computer Science Produced by Eamonn de Leastar (edeleastar@wit.ie)! Department of Computing, Maths & Physics Waterford Institute of Technology http://www.wit.ie http://elearning.wit.ie
Introduction to Functional Programming in Java 8
1 Introduction to Functional Programming in Java 8 Java 8 is the current version of Java that was released in March, 2014. While there are many new features in Java 8, the core addition is functional programming
What are they, and what are the benefits and risks?
Groovy and Grails 1 What are they, and what are the benefits and risks? Who am I? 2 John Leach, Chief Technical Officer for Syger Java developer from the start and still learning Syger - a small software
Produced by. Design Patterns. MSc in Communications Software. Eamonn de Leastar
Design Patterns MSc in Communications Software Produced by Eamonn de Leastar (edeleastar@wit.ie) Department of Computing, Maths & Physics Waterford Institute of Technology http://www.wit.ie http://elearning.wit.ie
Java, Dynamic Languages and DSL. Lee Chuk Munn Staff Engineer Sun Microsystems
Java, Dynamic Languages and DSL Lee Chuk Munn Staff Engineer Sun Microsystems 1 Objective How to Script Enable Your Application Agenda Scripting and Java JSR-223 Overview Groovy Language Scripting Groovy
Produced by. Design Patterns. MSc in Computer Science. Eamonn de Leastar
Design Patterns MSc in Computer Science Produced by Eamonn de Leastar (edeleastar@wit.ie)! Department of Computing, Maths & Physics Waterford Institute of Technology http://www.wit.ie http://elearning.wit.ie
Produced by. Design Patterns. MSc in Computer Science. Eamonn de Leastar
Design Patterns MSc in Computer Science Produced by Eamonn de Leastar (edeleastar@wit.ie)! Department of Computing, Maths & Physics Waterford Institute of Technology http://www.wit.ie http://elearning.wit.ie
Produced by. Mobile Application Development. Higher Diploma in Science in Computer Science. Eamonn de Leastar
Mobile Application Development Higher Diploma in Science in Computer Science Produced by Eamonn de Leastar (edeleastar@wit.ie) Department of Computing, Maths & Physics Waterford Institute of Technology
Static Typing or Dynamic Typing: A Real Issue or a Simple Case of Tribalism
Static Typing or Dynamic Typing: A Real Issue or a Simple Case of Tribalism Dr Russel Winder Concertant LLP russel.winder@concertant.com 2007 Russel Winder 1 Aims and Objectives Survey some of the static
Scala : an LLVM-targeted Scala compiler
Scala : an LLVM-targeted Scala compiler Da Liu, UNI: dl2997 Contents 1 Background 1 2 Introduction 1 3 Project Design 1 4 Language Prototype Features 2 4.1 Language Features........................................
CSCI Test 1.Spring 2004 Student Id: Grading: Undergrads, you are responsible for 110 points. Grads: you are responsible for 120 points
1a.Define Programming Language. (3 b. From the point of view of development of software packages, list the kinds of activities that a programming language ought to support. (4 b. List the 3 factors in
Lecture 4 Memory Management
Lecture 4 Memory Management Dr. Wilson Rivera ICOM 4036: Programming Languages Electrical and Computer Engineering Department University of Puerto Rico Some slides adapted from Sebesta s textbook Lecture
Produced by. Design Patterns. MSc in Communications Software. Eamonn de Leastar
Design Patterns MSc in Communications Software Produced by Eamonn de Leastar (edeleastar@wit.ie) Department of Computing, Maths & Physics Waterford Institute of Technology http://www.wit.ie http://elearning.wit.ie
Produced by. Design Patterns. MSc in Computer Science. Eamonn de Leastar
Design Patterns MSc in Computer Science Produced by Eamonn de Leastar (edeleastar@wit.ie)! Department of Computing, Maths & Physics Waterford Institute of Technology http://www.wit.ie http://elearning.wit.ie
Produced by. Design Patterns. MSc in Computer Science. Eamonn de Leastar
Design Patterns MSc in Computer Science Produced by Eamonn de Leastar (edeleastar@wit.ie) Department of Computing, Maths & Physics Waterford Institute of Technology http://www.wit.ie http://elearning.wit.ie
Outline. Introduction Concepts and terminology The case for static typing. Implementing a static type system Basic typing relations Adding context
Types 1 / 15 Outline Introduction Concepts and terminology The case for static typing Implementing a static type system Basic typing relations Adding context 2 / 15 Types and type errors Type: a set of
More on Abstraction in Java
More on Abstraction in Java More on Interfaces Produced by: Mairead Meagher Dr. Siobhán Drohan Eamonn de Leastar Department of Computing and Mathematics http://www.wit.ie/ Topic List Interfaces define
COSC 123 Computer Creativity. Java Lists and Arrays. Dr. Ramon Lawrence University of British Columbia Okanagan
COSC 123 Computer Creativity Java Lists and Arrays Dr. Ramon Lawrence University of British Columbia Okanagan ramon.lawrence@ubc.ca Objectives 1) Create and use arrays of base types and objects. 2) Create
Closures in Java. Java and all Java-based marks are trademarks or registered trademarks of Sun Microsystems, Inc. in the U.S. and
Java and all Java-based marks are trademarks or registered trademarks of Sun Microsystems, Inc. in the U.S. and License for use and distribution This material is available for non-commercial use and can
Interpreted vs Compiled. Java Compile. Classes, Objects, and Methods. Hello World 10/6/2016. Python Interpreted. Java Compiled
Interpreted vs Compiled Python 1 Java Interpreted Easy to run and test Quicker prototyping Program runs slower Compiled Execution time faster Virtual Machine compiled code portable Java Compile > javac
A guide to learning the popular JVM programming language, Groovy 2.x, and its ecosystem
Learning Groovy A guide to learning the popular JVM programming language, Groovy 2.x, and its ecosystem Adam L. Davis This book is for sale at http://leanpub.com/learninggroovy This version was published
CS1083 Week 2: Arrays, ArrayList
CS1083 Week 2: Arrays, ArrayList mostly review David Bremner 2018-01-08 Arrays (1D) Declaring and using 2D Arrays 2D Array Example ArrayList and Generics Multiple references to an array d o u b l e prices
Algorithms. Produced by. Eamonn de Leastar
Algorithms Produced by Eamonn de Leastar (edeleastar@wit.ie) Collections ± Collections Architecture ± Definition ± Architecture ± Interfaces ± Collection ± List ± Set ± Map ± Iterator ± Implementations
Produced by. Design Patterns. MSc in Computer Science. Eamonn de Leastar
Design Patterns MSc in Computer Science Produced by Eamonn de Leastar (edeleastar@wit.ie)! Department of Computing, Maths & Physics Waterford Institute of Technology http://www.wit.ie http://elearning.wit.ie
Every language has its own scoping rules. For example, what is the scope of variable j in this Java program?
Lexical Binding There are two ways a variable can be used in a program: As a declaration As a "reference" or use of the variable Scheme has two kinds of variable "declarations" -- the bindings of a let-expression
(A) 99 (B) 100 (C) 101 (D) 100 initial integers plus any additional integers required during program execution
Ch 5 Arrays Multiple Choice 01. An array is a (A) (B) (C) (D) data structure with one, or more, elements of the same type. data structure with LIFO access. data structure, which allows transfer between
CS 106A, Lecture 25 Life After CS 106A, Part 1
CS 106A, Lecture 25 Life After CS 106A, Part 1 This document is copyright (C) Stanford Computer Science and Marty Stepp, licensed under Creative Commons Attribution 2.5 License. All rights reserved. Based
Object-oriented programming. and data-structures CS/ENGRD 2110 SUMMER 2018
Object-oriented programming 1 and data-structures CS/ENGRD 2110 SUMMER 2018 Lecture 1: Types and Control Flow http://courses.cs.cornell.edu/cs2110/2018su Lecture 1 Outline 2 Languages Overview Imperative
Functional Parsing. Languages for Lunch 10/14/08 James E. Heliotis & Axel T. Schreiner
Functional Parsing Languages for Lunch 10/14/08 James E. Heliotis & Axel T. Schreiner http://www.cs.rit.edu/~ats/talks/mops/talk.pdf why monads? execution sequencing failure handling: preempt, catch stateful
Notes from a Short Introductory Lecture on Scala (Based on Programming in Scala, 2nd Ed.)
Notes from a Short Introductory Lecture on Scala (Based on Programming in Scala, 2nd Ed.) David Haraburda January 30, 2013 1 Introduction Scala is a multi-paradigm language that runs on the JVM (is totally
Topic 9: Type Checking
Recommended Exercises and Readings Topic 9: Type Checking From Haskell: The craft of functional programming (3 rd Ed.) Exercises: 13.17, 13.18, 13.19, 13.20, 13.21, 13.22 Readings: Chapter 13.5, 13.6 and
Topic 9: Type Checking
Topic 9: Type Checking 1 Recommended Exercises and Readings From Haskell: The craft of functional programming (3 rd Ed.) Exercises: 13.17, 13.18, 13.19, 13.20, 13.21, 13.22 Readings: Chapter 13.5, 13.6
01. Which of the following statement describes dynamic resizing as is applies to the ArrayList class?
Exposure Java Chapter 11 Multiple Choice Test ArrayList Class DO NOT WRITE ON THIS TEST This test includes program segments, which are not complete programs. Answer such questions with the assumption that
Object-oriented programming in...
Programming Languages Week 12 Object-oriented programming in... College of Information Science and Engineering Ritsumeikan University plan this week intro to Java advantages and disadvantages language
Produced by. App Development & Modelling. BSc in Applied Computing. Eamonn de Leastar
App Development & Modelling BSc in Applied Computing Produced by Eamonn de Leastar (edeleastar@wit.ie) Department of Computing, Maths & Physics Waterford Institute of Technology http://www.wit.ie http://elearning.wit.ie
Computer Programming, I. Laboratory Manual. Final Exam Solution
Think Twice Code Once The Islamic University of Gaza Engineering Faculty Department of Computer Engineering Fall 2017 ECOM 2005 Khaleel I. Shaheen Computer Programming, I Laboratory Manual Final Exam Solution
Groovy For Java Programmers
Groovy For Java Programmers QCONSF 2010 Jeff Brown Core Grails Developer jeff.brown@springsource.com SpringSource - A Division Of VMware http://springsource.com/ Copyright 2010 SpringSource. Copying, publishing
Scala, Your Next Programming Language
Scala, Your Next Programming Language (or if it is good enough for Twitter, it is good enough for me) WORLDCOMP 2011 By Dr. Mark C. Lewis Trinity University Disclaimer I am writing a Scala textbook that
<Insert Picture Here> Scripting Languages: Options for the JVM
Scripting Languages: Options for the JVM Simon Ritter Technology Evangelist Languages, Languages Everywhere Clojure Tcl JavaScript v-language CAL Sather Funnel Mini PLAN Lisp Scheme
Chair of Software Engineering. Languages in Depth Series: Java Programming. Prof. Dr. Bertrand Meyer. Exercise Session 8.
Chair of Software Engineering Languages in Depth Series: Java Programming Prof. Dr. Bertrand Meyer Exercise Session 8 Tomas Hruz Today s Exercise Session Organisation Status of the projects (summary in
(A) 99 ** (B) 100 (C) 101 (D) 100 initial integers plus any additional integers required during program execution
Ch 5 Arrays Multiple Choice Test 01. An array is a ** (A) data structure with one, or more, elements of the same type. (B) data structure with LIFO access. (C) data structure, which allows transfer between
Produced by. Design Patterns. MSc in Communications Software. Eamonn de Leastar
Design Patterns MSc in Communications Software Produced by Eamonn de Leastar (edeleastar@wit.ie) Department of Computing, Maths & Physics Waterford Institute of Technology http://www.wit.ie http://elearning.wit.ie
Composite Pattern - Shapes Example - Java Sourcecode
Composite Pattern - Shapes Example - Java Sourcecode In graphics editors a shape can be basic or complex. An example of a simple shape is a line, where a complex shape is a rectangle which is made of four
Object Model Comparisons
Object Model Comparisons 1 Languages are designed, just like programs Someone decides what the language is for Someone decides what features it's going to have Can't really understand a language until
The Great Language Debate
The Great Language Debate Dr Russel Winder Partner, Concertant LLP russel.winder@concertant.com Copyright 2008 Russel Winder 1 Aims and Objectives Mull over what is good and bad about various languages.
Groovy = Java Technology + Ruby + Python for the JVM
Groovy = Java Technology + Ruby + Python for the JVM Rod Cope CTO OpenLogic, Inc. http://www.openlogic.com TS-3273 2006 JavaOne SM Conference Session TS-3273 Groovy Goal What You ll Get Out of This Session
Lesson 26: ArrayList (W08D1)
Lesson 26: ArrayList (W08D1) Balboa High School Michael Ferraro October 5, 2015 1 / 25 Do Now Prepare PS #4a (paper form) for pick-up! Consider the code below for powiter(), an iterative algorithm that
C212 Early Evaluation Exam Mon Feb Name: Please provide brief (common sense) justifications with your answers below.
C212 Early Evaluation Exam Mon Feb 10 2014 Name: Please provide brief (common sense) justifications with your answers below. 1. What is the type (and value) of this expression: 5 * (7 + 4 / 2) 2. What
Closing the Case for Groovy (and Ruby, and Python)
Closing the Case for Groovy (and Ruby, and Python) Dr Russel Winder Concertant LLP russel.winder@concertant.com 2007 Russel Winder 1 Aims and Objectives Convince people that dynamic typing is not a difficulty,
7 Topics Concerning Languages & Architecture Stefan JUG KA 2011
7 Topics Concerning Languages & Architecture Stefan Tilkov @stilkov JUG KA 2011 1 http://www.innoq.com Stefan Tilkov stefan.tilkov@innoq.com @stilkov 2 http://rest-http.info 3 1. Language Equality 4 Languages
Methods. Every Java application must have a main method.
Methods Every Java application must have a main method. The JVM calls main when it runs your program. When main finishes control goes back to the JVM. Up to now, we have always coded public static void
SWIFT BASICS
SWIFT BASICS jhkim@dit.ac.kr www.facebook.com/jhkim3217 2014. 7. 19 Reference Swift Guide, 2014 AppCode.com Swift Tutorial: A Quick Start, Ray Wenderlich background new programming language for ios, OS
Design Patterns. Produced by. Eamonn de Leastar Department of Computing, Maths & Physics Waterford Institute of Technology
Design Patterns Produced by Eamonn de Leastar edeleastar@wit.ie Department of Computing, Maths & Physics Waterford Institute of Technology http://www.wit.ie http://elearning.wit.ie Template Method Design
CSCI 3136 Principles of Programming Languages
CSCI 3136 Principles of Programming Languages Summer 2013 Faculty of Computer Science Dalhousie University 1 / 100 CSCI 3136 Principles of Programming Languages Summer 2013 Aminul Islam Faculty of Computer
CSC 172 Data Structures and Algorithms. Lecture 3 Spring 2018 TuTh 3:25 pm 4:40 pm
CSC 172 Data Structures and Algorithms Lecture 3 Spring 2018 TuTh 3:25 pm 4:40 pm Agenda Administrative aspects Java Generics Chapter 1 ADMINISTRATIVE ASPECTS Workshops Workshops Workshops begin on this
Produced by. Mobile Application Development. Eamonn de Leastar
Mobile Application Development Produced by Eamonn de Leastar (edeleastar@wit.ie) Department of Computing, Maths & Physics Waterford Institute of Technology http://www.wit.ie http://elearning.wit.ie Introducing
Cosc 241 Programming and Problem Solving Lecture 9 (26/3/18) Collections and ADTs
1 Cosc 241 Programming and Problem Solving Lecture 9 (26/3/18) Collections and ADTs Michael Albert michael.albert@cs.otago.ac.nz Keywords: abstract data type, collection, generic class type, stack 2 Collections
CS263: Runtime Systems Lecture: High-level language virtual machines
CS263: Runtime Systems Lecture: High-level language virtual machines Today: A Review of Object-oriented features Chandra Krintz UCSB Computer Science Department Virtual machines (VMs) Terminology Aka managed
Produced by. Design Patterns. MSc in Communications Software. Eamonn de Leastar
Design Patterns MSc in Communications Software Produced by Eamonn de Leastar (edeleastar@wit.ie) Department of Computing, Maths & Physics Waterford Institute of Technology http://www.wit.ie http://elearning.wit.ie
Lesson 36: for() Loops (W11D1)
Lesson 36: for() Loops (W11D1) Balboa High School Michael Ferraro October 26, 2015 1 / 27 Do Now Create a new project: Lesson36 Write class FirstForLoop: Include a main() method: public static void main(string[]
SKILL AREA 304: Review Programming Language Concept. Computer Programming (YPG)
SKILL AREA 304: Review Programming Language Concept Computer Programming (YPG) 304.1 Demonstrate an Understanding of Basic of Programming Language 304.1.1 Explain the purpose of computer program 304.1.2
Produced by. Design Patterns. MSc in Computer Science. Eamonn de Leastar
Design Patterns MSc in Computer Science Produced by Eamonn de Leastar (edeleastar@wit.ie) Department of Computing, Maths & Physics Waterford Institute of Technology http://www.wit.ie http://elearning.wit.ie
Produced by. Design Patterns. MSc in Communications Software. Eamonn de Leastar
Design Patterns MSc in Communications Software Produced by Eamonn de Leastar (edeleastar@wit.ie) Department of Computing, Maths & Physics Waterford Institute of Technology http://www.wit.ie http://elearning.wit.ie
Computational Expression
Computational Expression Do While Loop, For Loop, Arrays Janyl Jumadinova 26 November, 2018 Janyl Jumadinova Computational Expression 26 November, 2018 1 / 18 Review: Repetition structures while() loop
Annotations in Java (JUnit)
Annotations in Java (JUnit) Produced by: Eamonn de Leastar (edeleastar@wit.ie) Dr. Siobhán Drohan (sdrohan@wit.ie) Department of Computing and Mathematics http://www.wit.ie/ What are Annotations? They
SOFTWARE ARCHITECTURE 6. LISP
1 SOFTWARE ARCHITECTURE 6. LISP Tatsuya Hagino hagino@sfc.keio.ac.jp slides URL https://vu5.sfc.keio.ac.jp/sa/ 2 Compiler vs Interpreter Compiler Translate programs into machine languages Compilers are
Arne Brüsch Philipp Wille. Pattern Matching Syntax
Scala Enthusiasts BS Arne Brüsch Philipp Wille Pattern Matching Syntax Scala Modular programming language Some used to call it objectfunctional 2 Scala Modular programming language Some used to call it
The Kotlin Programming Language. Andrey Breslav Dmitry Jemerov
The Kotlin Programming Language Andrey Breslav Dmitry Jemerov What is Kotlin? Statically typed object-oriented JVM-targeted general-purpose programming language developed by JetBrains intended for industrial
INDEX. A SIMPLE JAVA PROGRAM Class Declaration The Main Line. The Line Contains Three Keywords The Output Line
A SIMPLE JAVA PROGRAM Class Declaration The Main Line INDEX The Line Contains Three Keywords The Output Line COMMENTS Single Line Comment Multiline Comment Documentation Comment TYPE CASTING Implicit Type
Activity 4: Methods. Content Learning Objectives. Process Skill Goals
Activity 4: Methods Java programs are organized into classes, each of which has one or more methods, each of which has one or more statements. Writing methods allows you to break down a complex program
...something useful to do with the JVM.
Scala Finally... ...something useful to do with the JVM. Image source: http://www.tripadvisor.com/locationphotos-g187789-lazio.html Young Developed in 2003 by Martin Odersky at EPFL Martin also brought
First Programming Language in CS Education The Arguments for Scala
First Programming Language in CS Education The Arguments for Scala WORLDCOMP 2011 By Dr. Mark C. Lewis Trinity University Disclaimer I am writing a Scala textbook that is under contract with CRC Press.
Topic 5: Higher Order Functions
Topic 5: Higher Order Functions 1 Recommended Exercises and Readings From Haskell: The craft of functional programming (3 rd Ed.) Exercises: 10.1, 10.2, 10.3, 10.4, 10.5, 10.6, 10.7, 10.8, 10.9, 10.10,
Topic 5: Higher Order Functions
Topic 5: Higher Order Functions 1 Recommended Exercises and Readings From Haskell: The craft of functional programming (3 rd Ed.) Exercises: 10.1, 10.2, 10.3, 10.4, 10.5, 10.6, 10.7, 10.8, 10.9, 10.10,
COSC 123 Computer Creativity. Introduction to Java. Dr. Ramon Lawrence University of British Columbia Okanagan
COSC 123 Computer Creativity Introduction to Java Dr. Ramon Lawrence University of British Columbia Okanagan ramon.lawrence@ubc.ca Key Points 1) Introduce Java, a general-purpose programming language,
CS558 Programming Languages
CS558 Programming Languages Fall 2017 Lecture 7b Andrew Tolmach Portland State University 1994-2017 Type Inference Some statically typed languages, like ML (and to a lesser extent Scala), offer alternative
Produced by. Mobile Application Development. Eamonn de Leastar
Mobile Application Development Produced by Eamonn de Leastar (edeleastar@wit.ie) Department of Computing, Maths & Physics Waterford Institute of Technology http://www.wit.ie http://elearning.wit.ie Application
CS Programming Languages: Scala
CS 3101-2 - Programming Languages: Scala Lecture 3: Fun with Functions Daniel Bauer (bauer@cs.columbia.edu) October 29, 2014 Daniel Bauer CS3101-2 Scala - 03 - Fun with Functions 1/37 Contents 1 Defining
Practically Functional. Daniel Spiewak
Practically Functional Daniel Spiewak whoami Author of Scala for Java Refugees and other articles on Scala and FP Former editor Javalobby / EclipseZone Engaged in academic research involving Scala DSLs
MEAP Edition Manning Early Access Program Get Programming with Java Version 1
MEAP Edition Manning Early Access Program Get Programming with Java Version 1 Copyright 2018 Manning Publications For more information on this and other Manning titles go to www.manning.com welcome First,
Produced by. Mobile Application Development. Higher Diploma in Science in Computer Science. Eamonn de Leastar
Mobile Application Development Higher Diploma in Science in Computer Science Produced by Eamonn de Leastar (edeleastar@wit.ie) Department of Computing, Maths & Physics Waterford Institute of Technology
Richard Mallion. Swift for Admins #TEAMSWIFT
Richard Mallion Swift for Admins #TEAMSWIFT Apple Introduces Swift At the WWDC 2014 Keynote, Apple introduced Swift A new modern programming language It targets the frameworks for Cocoa and Cocoa Touch
CHAPTER 1 Introduction to Computers and Java
CHAPTER 1 Introduction to Computers and Java Copyright 2016 Pearson Education, Inc., Hoboken NJ Chapter Topics Chapter 1 discusses the following main topics: Why Program? Computer Systems: Hardware and
Parsing Scheme (+ (* 2 3) 1) * 1
Parsing Scheme + (+ (* 2 3) 1) * 1 2 3 Compiling Scheme frame + frame halt * 1 3 2 3 2 refer 1 apply * refer apply + Compiling Scheme make-return START make-test make-close make-assign make- pair? yes
Produced by. App Development & Modelling. Eamonn de Leastar
App Development & Modelling Produced by Eamonn de Leastar (edeleastar@wit.ie) Department of Computing, Maths & Physics Waterford Institute of Technology http://www.wit.ie http://elearning.wit.ie Repositories
Generics: Past, Present
Generics: Past, Present and Future @richardwarburto @raouluk binarysearch(list
Announcements. CSCI 334: Principles of Programming Languages. Lecture 16: Intro to Scala. Announcements. Squeak demo. Instructor: Dan Barowy
Announcements CSCI 334: Principles of Programming Languages Lecture 16: Intro to Scala HW7 sent out as promised. See course webpage. Instructor: Dan Barowy Announcements No class on Tuesday, April 17.
M e t h o d s a n d P a r a m e t e r s
M e t h o d s a n d P a r a m e t e r s Objective #1: Call methods. Methods are reusable sections of code that perform actions. Many methods come from classes that are built into the Java language. For
Getting Groovy without the bad clothes by James Williams
Getting Groovy without the bad clothes by James Williams This article is released under the Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 United States License. What is Groovy? Groovy
CSC324 Principles of Programming Languages
CSC324 Principles of Programming Languages http://mcs.utm.utoronto.ca/~324 November 14, 2018 Today Final chapter of the course! Types and type systems Haskell s type system Types Terminology Type: set
MY GOOD FRIEND RUST. Matthias Endler trivago
MY GOOD FRIEND RUST Matthias Endler trivago How to write the word Mississippi? How to write the word Mississippi? Mississippi Sebastian is stupid. Oh please tell me more about Matthias Endler! } Düsseldorf,
EXAMINATION INSTRUCTIONS
EXAMINATION INSTRUCTIONS This examination has 6 pages. Check that you have a complete paper. Each candidate should be prepared to produce, upon request, his or her SUNY/UB card. This examination has 5
LAMBDA EXPRESSIONS. Summer 2018
LAMBDA EXPRESSIONS Summer 2018 LAMBDA EXPRESSIONS USES Introduced in Java SE 8, lambda expressions are a way to create single-method classes in your code in a much less cumbersome manner than anonymous