Rust Advanced Topics
|
|
- Brianne Johnston
- 6 years ago
- Views:
Transcription
1 Rust Advanced Topics Adapted from Generic Functions 1. fn takes_anything<t>(thing: T) -> T { 2. thing 3. } 4. fn main() { 5. let x = takes_anything(4); 6. let y = takes_anything(4.5); 7. let z = takes_anything(true); 8. let a = takes_anything(string::from("hello")); 9. println!("{}\n{}\n{}\n{}", x, y, z, a); 10.} 1
2 Generic Functions with Bounds 1. fn prints_anything<t: Debug>(thing: T) { 2. println!("{:?}", thing); 3. } 4. fn prints_anything<t>(thing: T) 5. where T: Debug { 6. println!("{:?}", thing); 7. } Generic Structs 1. struct Point<Precision> { 2. x: Precision, 3. y: Precision 4. } 5. fn main() { 6. let point = Point { x: 1_u32, y: 2 }; 7. let point: Point<i32> = Point { x: 1, y: 2 }; 8. } Rust finds the types of all variables and generics with sufficient information. 2
3 Generic Enums 1. enum Either<T, X> { 2. Left(T), 3. Right(X) 4. } What can you do with an Either? 5. fn main() { 6. let alternative: Either<i32, f64> = Either::Left(123); 7. } Option (the most important generic enum) 1. enum Option<T> { 2. Some(T), 3. None 4. } Part of the standard library and automatically made available for use. 5. fn main() { 6. let mut args = std::env::args(); 7. println!("{:?} {:?}", args.nth(0), args.nth(1)) 8. } 3
4 Results (the second most important enum) 1. enum Result<T, E> { 2. Ok(T), 3. Err(E) 4. } Err(Error { repr: Os { code: 2, message: "No such file or directory" } }) 5. fn main() { 6. let file = std::fs::file::open("i don't exist!"); 7. println!("{:?}", file); 8. } Why are Options useful? 1. fn main() { 2. let mut args = std::env::args(); 3. match args.nth(1) { 4. Some(arg) => { println!("argument: {}", arg)}, 5. None => { println!("no Argument") } 6. } 7. } 4
5 Why are Options useful? 1. fn main() { 2. let mut args = std::env::args(); 3. if let Some(arg) = args.nth(1) { 4. println!("argument: {}", arg); 6. } Why are Results useful? 1. fn main() { 2. let maybe_file = std::fs::file::open("not there!"); 3. match maybe_file { 4. Ok(f) => { println!("file opened! Debug: {:?}", f) }, 5. Err(e) => { println!("file not opened!! Error: {:?}", e) } 6. } 7. } 5
6 Remember, you must cover all variants! 1. fn main() { 2. let maybe_file = std::fs::file::open("not there!"); 3. match maybe_file { 4. Err(e) => { println!("error: {:?}", e) } 6. } Remember, you must cover all variants! 1. fn main() { 2. let maybe_file = std::fs::file::open("not there!"); 3. match maybe_file { 4. Err(e) => { println!("error: {:?}", e) } 5. _ => {} 6. } 7. } 6
7 Ownership Ownership is the basis for the memory management of Rust. 1. Every value has exactly one owner 2. Ownership can be passed on (given away) 3. The owner is responsible for dropping/de-alocating/removing data 4. The owner has all powers over the data and can mutate it These rules: are fundamental to Rusts type system are enforced at compile time are practical in many other ways 1. #[derive(debug)] 2. struct Dot { Ownership transferred from here to here do to this line. 7. let dot = Dot { x: 1, y: 2 }; 8. pacman(dot); 9. } 10.fn pacman(dot: Dot) { 11. println!("eating {:?}", dot); 12.} 7
8 1. #[derive(debug)] 2. struct Dot { Ownership transferred from here to here do to this line. 7. let dot = Dot { x: 1, y: 2 }; 8. pacman(dot); 9. pacman(dot); 10.} 11.fn pacman(dot: Dot) { 12. println!("eating {:?}", dot); 13.} 1. #[derive(debug)] 2. struct Dot { Ownership transferred from here to here do to this line. 7. let dot = Dot { x: 1, y: 2 }; 8. pacman(dot); 9. pacman(dot); 10.} pacman consumes dot. The value cannot be used anymore. 11.fn pacman(dot: Dot) { 12. println!("eating {:?}", dot); 13.} 8
9 1. #[derive(debug, Clone)] 2. struct Dot { 7. let dot = Dot { x: 1, y: 2 }; 8. pacman(dot.clone()); 9. pacman(dot); 10.} 11.fn pacman(dot: Dot) { 12. println!("eating {:?}", dot); 13.} Better to be explicit than implicit! C++ does this clone for you! 1. #[derive(debug, Clone, Copy)] 2. struct Dot { 7. let dot = Dot { x: 1, y: 2 }; 8. pacman(dot); 9. pacman(dot); 10.} 11.fn pacman(dot: Dot) { 12. println!("eating {:?}", dot); 13.} Rust will let you make this the default behavior! Copy is meant for data that can be quickly copied. 9
10 Borrowing (instead of transferring ownership) 1. What you own, you can borrow 2. Reuse of data after a function call is not possible with ownership if the called function doesn't return the ownership to the value again. 1. #[derive(debug)] 2. struct Point { 7. let mut point = Point { x: 1, y: 2 }; 8. inspect(&point); 9. point.x = 2; 10. inspect(&point); 11. } 12. fn inspect(p: &Point) { 13. println!("{:?}", p); 14. } What if we want to change the borrowed value? 10
11 1. #[derive(debug)] 2. struct Point { 7. let mut point = Point { x: 1, y: 2 }; 8. inspect(&point); 9. move_point(&mut point, 3, 3); 10. inspect(&point); 11. } Mutable borrows are exclusive! 12. fn move_point(p: &mut Point, x: i32, y: i32) { 13. p.x = x; p.y = y; 14. } 15. fn inspect(p: &Point) { println!("{:?}", p); } 1. #[derive(debug)] 2. struct Point { fn main() { 8. let mut point = Point { x: 1, y: 2 }; 9. inspect(&point); 10. // move_point(&mut point, 3, 3); 11. let point2 = move_point(&mut point, 3, 3); 12. inspect(&point); 13. } fn move_point(p: &mut Point, x: i32, y: i32) -> &Point { 16. p.x = x; p.y = y; 17. p 18. } fn inspect(p: &Point) { 21. println!("{:?}", p); 22. } What happens here? 11
12 Borrowing Rules Values can be: 1. Borrowed immutably as often as you'd like 2. Or mutably exactly once 1. fn push_all(on: &mut Vec<u8>, from: &Vec<u8>) { 2. // What is the problem with this function? 3. } Borrowing obeys lexical rules! 1. fn main() { 2. let mut data = vec!['a', 'b', 'c']; 3. { 4. let slice = &mut data[..]; 5. do_something(slice); 6. } 7. data.push('d'); 8. data.push('e'); 9. data.push('f'); 10. } 11. fn do_something(slice: &[char]) { 12. // Do something that mutates slice 13. } 12
13 Pillars of Rust A productive systems programming language that adheres to the following: Memory Safety without Garbage Collection Concurrency without Data Races Abstraction without Overhead Stability without Stagnation 13
1: /////////////// 2: // 1. Basics // 3: /////////////// 4: 5: // Functions. i32 is the type for 32-bit signed integers 6: fn add2(x: i32, y: i32) ->
1: /////////////// 2: // 1. Basics // 3: /////////////// 4: 5: // Functions. i32 is the type for 32-bit signed integers 6: fn add2(x: i32, y: i32) -> i32 { 7: // Implicit return (no semicolon) 8: x + y
More informationCMSC 330: Organization of Programming Languages
CMSC 330: Organization of Programming Languages Structs and Enums in Rust CMSC330 Spring 2018 Copyright 2018 Niki Vazou, the University of Maryland. Some material based on https://doc.rustlang.org/book/second-edition/index.html
More informationCMSC 330: Organization of Programming Languages. Ownership, References, and Lifetimes in Rust
CMSC 330: Organization of Programming Languages Ownership, References, and Lifetimes in Rust CMSC330 Spring 2018 1 Memory: the Stack and the Heap The stack constant-time, automatic (de)allocation Data
More informationIntroduction to Rust. CC-BY Mozilla. Jonathan Pallant
Introduction to Rust CC-BY Mozilla Jonathan Pallant 27 October 2016 What is Rust? Rust is a systems programming language that runs blazingly fast, prevents segfaults, and guarantees thread safety. www.rust-lang.org
More information$ cat ~/.profile GIT_AUTHOR_NAME=Florian Gilcher TWITTER_HANDLE=argorak GITHUB_HANDLE=skade BLOG=skade.
Useful Rust $ cat ~/.profile GIT_AUTHOR_NAME=Florian Gilcher GIT_AUTHOR_EMAIL=florian@rustfest.eu TWITTER_HANDLE=argorak GITHUB_HANDLE=skade BLOG=skade.me YAKS=yakshav.es Backend Developer Ruby Programmer
More informationIndex. object lifetimes, and ownership, use after change by an alias errors, use after drop errors, BTreeMap, 309
A Arithmetic operation floating-point arithmetic, 11 12 integer numbers, 9 11 Arrays, 97 copying, 59 60 creation, 48 elements, 48 empty arrays and vectors, 57 58 executable program, 49 expressions, 48
More informationNext Gen Networking Infrastructure With Rust
Next Gen Networking Infrastructure With Rust Hi, I m @carllerche You may remember me from Most newer databases are written in a language that includes a runtime C / C++ Memory management we ll do it live
More informationRust for C++ Programmers
Rust for C++ Programmers Vinzent Steinberg C++ User Group, FIAS April 29, 2015 1 / 27 Motivation C++ has a lot of problems C++ cannot be fixed (because of backwards compatibility) Rust to the rescue! 2
More informationIntroduction to Rust 2 / 101
1 / 101 Introduction to Rust 2 / 101 Goal Have a good chance of being able to read and understand some Rust code. 3 / 101 Agenda 1. What's not that unique about Rust 2. What makes Rust somewhat unique
More informationCMSC 330: Organization of Programming Languages. Strings, Slices, Vectors, HashMaps in Rust
CMSC 330: Organization of Programming Languages Strings, Slices, Vectors, HashMaps in Rust CMSC330 Spring 2018 1 String Representation Rust s String is a 3-tuple A pointer to a byte array (interpreted
More informationProgramming In Rust. Jim Blandy, / Portland, (Slides are as presented; followup discussion,
Programming In Rust Jim Blandy, Mozilla @jimblandy / Portland, 2015 (Slides are as presented; followup discussion, fixes, etc. on Reddit: http://goo.gl/thj2pw) 2 The set of Rust enthusiasts certainly seems
More informationCMSC 330: Organization of Programming Languages
CMSC 330: Organization of Programming Languages Closures and Iterators In Rust CMSC330 Spring 2018 Copyright 2018 Michael Hicks, the University of Maryland. Some material based on https://doc.rustlang.org/book/second-edition/index.html
More informationCMSC 330: Organization of Programming Languages. Rust Basics
CMSC 330: Organization of Programming Languages Rust Basics CMSC330 Spring 2018 1 Organization It turns out that a lot of Rust has direct analogues in OCaml So we will introduce its elements with comparisons
More informationGuaranteeing memory safety in Rust
Guaranteeing memory safety in Rust Nicholas D. Matsakis Mozilla Research 1 Hashtable in C / C++ template struct Hashtable { Bucket *buckets; unsigned num_buckets; template
More informationRust. A new systems programming language. 1.0 was released on May 15th. been in development 5+ years. releases every 6 weeks
1 Rust A new systems programming language 1.0 was released on May 15th been in development 5+ years releases every 6 weeks Pursuing the trifecta: safe, concurrent, fast Gone through many radical iterations
More informationThe Case for Building a Kernel
The Case for Building a Kernel in Rust Amit Levy Brad Campbell Branden Ghena Pat Pannuto Philip Levis Prabal Dutta Stanford University & University of Michigan September 2nd 2017 Memory and type safety
More informationAdvances in Programming Languages
Advances in Programming Languages Lecture 18: Concurrency and More in Rust Ian Stark School of Informatics The University of Edinburgh Friday 24 November 2016 Semester 1 Week 10 https://blog.inf.ed.ac.uk/apl16
More informationIdiomatic Rust. Writing concise and elegant Rust code
Idiomatic Rust Writing concise and elegant Rust code Matthias Endler! Düsseldorf, Germany! Backend Engineer at! Website performance! Hot Chocolate matthiasendler mre matthias-endler.de EXPECTATION... REALITY...
More informationCorrections made in this version not in first posting:
1 Changelog 1 Corrections made in this version not in first posting: 12 April 2017: slide 15: correct arrow from B-freed to D-freed 12 April 2017: slide 42: correct phrasing on what is borrowed fuzzing
More informationRust intro. (for Java Developers) JFokus #jfokus 1. 1
Rust intro (for Java Developers) JFokus 2017 - #jfokus 1. 1 Hi! Computer Engineer Programming Electronics Math
More informationNicholas Matsakis! Mozilla Research
Nicholas Matsakis! Mozilla Research Parallel! Systems programming without the hassle crashes! heisenbugs! fear 2 C/C++: efficiency first! destructors memory layout smart pointers monomorphization Research
More informationAaron Turon! Mozilla Research
Aaron Turon Mozilla Research C/C++ ML/Haskell Rust Safe systems programming Why Mozilla? Browsers need control. Browsers need safety. Servo: Next-generation browser built in Rust. C++ What is control?
More informationAdding Lifetime Checking to Chapel Michael Ferguson, Cray Inc. CHIUW 2018 May 25, 2018
Adding Lifetime Checking to Chapel Michael Ferguson, Cray Inc. CHIUW 2018 May 25, 2018 Safe Harbor Statement This presentation may contain forward-looking statements that are based on our current expectations.
More informationRust for high level applications. Lise Henry
Rust for high level applications Lise Henry Who am I Elisabeth Henry A.k.a Lizzie Crowdagger Computer science background Semi-professional fantasy writer I like Rust, but not really into systems programming
More informationCMSC 330: Organization of Programming Languages
CMSC 330: Organization of Programming Languages Smart Pointers in Rust CMSC330 Spring 2018 Copyright 2018 Michael Hicks, the University of Maryland. Some material based on https://doc.rustlang.org/book/second-edition/index.html
More informationNext Gen Networking Infrastructure With Rust
Next Gen Networking Infrastructure With Rust Hi, I m @carllerche Let s write a database! Most newer databases are written in a language that includes a runtime. C / C++ Memory management we ll do it live
More informationRustBelt: Securing the Foundations of the Rust Programming Language
RustBelt: Securing the Foundations of the Rust Programming Language Ralf Jung, Jacques-Henri Jourdan, Robbert Krebbers, Derek Dreyer POPL 2018 in Los Angeles, USA Max Planck Institute for Software Systems
More informationConcurrency, Thread. Dongkun Shin, SKKU
Concurrency, Thread 1 Thread Classic view a single point of execution within a program a single PC where instructions are being fetched from and executed), Multi-threaded program Has more than one point
More informationRegion-based Memory Management. Advanced Operating Systems Lecture 10
Region-based Memory Management Advanced Operating Systems Lecture 10 Lecture Outline Rationale Stack-based memory management Region-based memory management Ownership Borrowing Benefits and limitations
More informationRust. A safe, concurrent, practical language. Graydon Hoare October 2012
Rust A safe, concurrent, practical language Graydon Hoare October 2012 This is not a marketing talk Purpose: Convince you there's something interesting here Provide some technical
More informationWhy you should take a look at
Why you should take a look at Antonin Carette - FOSDEM 2018 - Rust devroom Slides and resources available @ github.com/k0pernicus/fosdem_rust_talk 1 Chalut 'tiot biloute! I tried to understand what the
More informationRust: system programming with guarantees
Rust: system programming with guarantees CRI Monthly Seminar Arnaud Spiwack Pierre Guillou MINES ParisTech, PSL Research University Fontainebleau, July 6th, 2015 1 / 29 High level programming languages
More informationAmit Levy SITP Retreat, June 22, Tock: A Secure Operating System for Microcontrollers
Amit Levy SITP Retreat, June 22, 2018 Tock: A Secure Operating System for Microcontrollers Limitations of Microcontroller Sofware Low memory: ~64 kb RAM No virtual memory Can t use Linux! No isolation
More informationMY PYTHON IS RUSTING. A PYTHON AND RUST LOVE STORY Ronacher
MY PYTHON IS RUSTING A PYTHON AND RUST LOVE STORY Armin @mitsuhiko Ronacher and here is where you can find me twitter.com/@mitsuhiko github.com/mitsuhiko lucumr.pocoo.org/ so I heard you are doing Rust
More informationChapter 4 Defining Classes I
Chapter 4 Defining Classes I This chapter introduces the idea that students can create their own classes and therefore their own objects. Introduced is the idea of methods and instance variables as the
More informationMUTABLE LISTS AND DICTIONARIES 4
MUTABLE LISTS AND DICTIONARIES 4 COMPUTER SCIENCE 61A Sept. 24, 2012 1 Lists Lists are similar to tuples: the order of the data matters, their indices start at 0. The big difference is that lists are mutable
More informationJens Getreu
SECURE PROGRAMMING OF RESOURCE CONSTRAINED DEVICES Jens Getreu 2018-01-16 AGENDA 1. Resource Constrained Devices 2. The Heartbleed vulnerability 3. The Rust Programming Language 4. Conclusion and recommendations
More informationRefinement Types for TypeScript
Refinement Types for TypeScript Panagiotis Vekris Benjamin Cosman Ranjit Jhala University of California, San Diego PLDI 16 Thursday, June 16 Extensible static analyses for modern scripting languages 2
More informationThe Concept of Ownership in Rust and Swift
The Concept of Ownership in Rust and Swift The Concept of Ownership in Rust and Swift By Elaf A Alhazmi, M.Sc. A Thesis Submitted to The Department of Computing and Software and the School of Graduate
More informationCommon Programming. Variables and Mutability
3 Common Programming Concepts This chapter covers concepts that appear in almost every programming language and how they work in Rust. Many programming languages have much in common at their core. None
More informationMulticore and Multiprocessor Systems: Part I
Chapter 3 Multicore and Multiprocessor Systems: Part I Max Planck Institute Magdeburg Jens Saak, Scientific Computing II 44/337 Symmetric Multiprocessing Definition (Symmetric Multiprocessing (SMP)) The
More informationMemory Management. Advanced Operating Systems (M) Lecture 3
Memory Management Advanced Operating Systems (M) Lecture 3 This work is licensed under the Creative Commons Attribution-NoDerivatives 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nd/4.0/
More informationObject-Oriented Programming in Java. Topic : Objects and Classes (cont) Object Oriented Design
Electrical and Computer Engineering Object-Oriented in Java Topic : Objects and Classes (cont) Object Oriented Maj Joel Young Joel.Young@afit.edu 11-Sep-03 Maj Joel Young Using Class Instances Accessing
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 informationD7020E. The dynamic evolution of a system Robust and Energy-Efficient Real-Time Systems. blocked Lecture 2: Components & the Timber language.
Recall The dynamic evolution of a system Robust and Energy-Efficient Real-Time Systems with offset asynchronous calls synchronous call T T blocked Lecture 2: Components & the Timber language buffered??
More informationD7020E. Robust and Energy-Efficient Real-Time Systems D7020E. Lecture 2: Components & the Timber language
Robust and Energy-Efficient Real-Time Systems Lecture 2: Components & the Timber language 1 1 Recall The dynamic evolution of a system... with offset asynchronous calls synchronous call T T blocked buffered
More informationOS Extensibility: SPIN and Exokernels. Robert Grimm New York University
OS Extensibility: SPIN and Exokernels Robert Grimm New York University The Three Questions What is the problem? What is new or different? What are the contributions and limitations? OS Abstraction Barrier
More informationCS527 Software Security
Security Policies Purdue University, Spring 2018 Security Policies A policy is a deliberate system of principles to guide decisions and achieve rational outcomes. A policy is a statement of intent, and
More informationTopic 6: A Quick Intro To C. Reading. "goto Considered Harmful" History
Topic 6: A Quick Intro To C Reading Assumption: All of you know basic Java. Much of C syntax is the same. Also: Some of you have used C or C++. Goal for this topic: you can write & run a simple C program
More informationC2Rust Migrating Legacy Code to Rust
C2Rust Migrating Legacy Code to Rust Acknowledgements & Disclaimer This research was developed with funding from the Defense Advanced Research Projects Agency (DARPA). The views, opinions and/or findings
More informationProcesses. Johan Montelius KTH
Processes Johan Montelius KTH 2017 1 / 47 A process What is a process?... a computation a program i.e. a sequence of operations a set of data structures a set of registers means to interact with other
More informationA process. the stack
A process Processes Johan Montelius What is a process?... a computation KTH 2017 a program i.e. a sequence of operations a set of data structures a set of registers means to interact with other processes
More informationConcurrent Programming in the D Programming Language. by Walter Bright Digital Mars
Concurrent Programming in the D Programming Language by Walter Bright Digital Mars Introduction What is sequential consistency across threads? What are the problems with it? D features that mitigate those
More informationProgramming Languages and Techniques (CIS120)
Programming Languages and Techniques () Lecture 13 February 12, 2018 Mutable State & Abstract Stack Machine Chapters 14 &15 Homework 4 Announcements due on February 20. Out this morning Midterm results
More informationCMPT 115. C tutorial for students who took 111 in Java. University of Saskatchewan. Mark G. Eramian, Ian McQuillan CMPT 115 1/32
CMPT 115 C tutorial for students who took 111 in Java Mark G. Eramian Ian McQuillan University of Saskatchewan Mark G. Eramian, Ian McQuillan CMPT 115 1/32 Part I Starting out Mark G. Eramian, Ian McQuillan
More informationTopic 6: A Quick Intro To C
Topic 6: A Quick Intro To C Assumption: All of you know Java. Much of C syntax is the same. Also: Many of you have used C or C++. Goal for this topic: you can write & run a simple C program basic functions
More informationCPSC 3740 Programming Languages University of Lethbridge. Data Types
Data Types A data type defines a collection of data values and a set of predefined operations on those values Some languages allow user to define additional types Useful for error detection through type
More informationPhysics 2660: Fundamentals of Scientific Computing. Lecture 3 Instructor: Prof. Chris Neu
Physics 2660: Fundamentals of Scientific Computing Lecture 3 Instructor: Prof. Chris Neu (chris.neu@virginia.edu) Announcements Weekly readings will be assigned and available through the class wiki home
More informationThe Case for N-Body Simulations in Rust
Int'l Conf. Scientific Computing CSC'16 3 The Case for N-Body Simulations in Rust A. Hansen, M. C. Lewis Department of Computer Science, Trinity University, San Antonio, Texas, United States Abstract In
More informationCSE341: Programming Languages Lecture 9 Function-Closure Idioms. Dan Grossman Winter 2013
CSE341: Programming Languages Lecture 9 Function-Closure Idioms Dan Grossman Winter 2013 More idioms We know the rule for lexical scope and function closures Now what is it good for A partial but wide-ranging
More informationjust a ((somewhat) safer) dialect.
Intro_to_C Page 1 Intro to C Tuesday, September 07, 2004 5:30 PM C was developed specifically for writing operating systems Low level of abstraction. "Just above machine language." Direct access to the
More information15-122: Principles of Imperative Computation
15-122: Principles of Imperative Computation Lab 0 Navigating your account in Linux Tom Cortina, Rob Simmons Unlike typical graphical interfaces for operating systems, here you are entering commands directly
More informationIII. Classes (Chap. 3)
III. Classes III-1 III. Classes (Chap. 3) As we have seen, C++ data types can be classified as: Fundamental (or simple or scalar): A data object of one of these types is a single object. int, double, char,
More informationMemory Management and Efficient Graph Processing in Rust
Memory Management and Efficient Graph Processing in Rust KEVIN CHEN and ELBERT LIN Stanford University 1. INTRODUCTION Graphs are a common data structure in most object-oriented programming languages due
More information[Course Overview] After completing this module you are ready to: Develop Desktop applications, Networking & Multi-threaded programs in java.
[Course Overview] The Core Java technologies and application programming interfaces (APIs) are the foundation of the Java Platform, Standard Edition (Java SE). They are used in all classes of Java programming,
More informationProgramming language design and analysis
Programming language design and analysis Introduction Marius Minea 25 September 2017 Why this course? Programming languages are fundamental and one of the oldest CS fields Language design is an important
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 informationCSE341: Programming Languages Lecture 11 Type Inference. Dan Grossman Spring 2016
CSE341: Programming Languages Lecture 11 Type Inference Dan Grossman Spring 2016 Type-checking (Static) type-checking can reject a program before it runs to prevent the possibility of some errors A feature
More informationCOMP 105 Assignment: Smalltalk
COMP 105 Assignment: Smalltalk Due Sunday, April 19, at 11:59 PM. The purpose of this assignment is to help you get acquainted with pure object-oriented programming. The assignment is divided into two
More informationFunctions, Scope & Arguments. HORT Lecture 12 Instructor: Kranthi Varala
Functions, Scope & Arguments HORT 59000 Lecture 12 Instructor: Kranthi Varala Functions Functions are logical groupings of statements to achieve a task. For example, a function to calculate the average
More informationA lot of people make repeated mistakes of not calling their functions and getting errors. Make sure you're calling your functions.
Handout 2 Functions, Lists, For Loops and Tuples [ ] Functions -- parameters/arguments, "calling" functions, return values, etc. Please make sure you understand this example: def square(x): return x *
More informationComputer Fundamentals: Operating Systems, Concurrency. Dr Robert Harle
Computer Fundamentals: Operating Systems, Concurrency Dr Robert Harle This Week The roles of the O/S (kernel, timeslicing, scheduling) The notion of threads Concurrency problems Multi-core processors Virtual
More information6. Pointers, Structs, and Arrays. March 14 & 15, 2011
March 14 & 15, 2011 Einführung in die Programmierung Introduction to C/C++, Tobias Weinzierl page 1 of 47 Outline Recapitulation Pointers Dynamic Memory Allocation Structs Arrays Bubble Sort Strings Einführung
More informationClasses Classes 2 / 35
Classes 1 / 35 Classes Classes 2 / 35 Anatomy of a Class By the end of next lecture, you ll understand everything in this class definition. package edu. gatech. cs1331. card ; import java. util. Arrays
More informationThread Safety. Review. Today o Confinement o Threadsafe datatypes Required reading. Concurrency Wrapper Collections
Thread Safety Today o Confinement o Threadsafe datatypes Required reading Concurrency Wrapper Collections Optional reading The material in this lecture and the next lecture is inspired by an excellent
More informationQUIZ. What is wrong with this code that uses default arguments?
QUIZ What is wrong with this code that uses default arguments? Solution The value of the default argument should be placed in either declaration or definition, not both! QUIZ What is wrong with this code
More informationHow Rust views tradeoffs. Steve Klabnik
How Rust views tradeoffs Steve Klabnik 03.04.2019 What is a tradeoff? Bending the Curve Overview Design is about values Case Studies BDFL vs Design By Committee Stability Without Stagnation Acceptable
More informationINDEX. 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
More informationGraphical Interface and Application (I3305) Semester: 1 Academic Year: 2017/2018 Dr Antoun Yaacoub
Lebanese University Faculty of Science Computer Science BS Degree Graphical Interface and Application (I3305) Semester: 1 Academic Year: 2017/2018 Dr Antoun Yaacoub 2 Crash Course in JAVA Classes A Java
More informationLecture Notes on Memory Layout
Lecture Notes on Memory Layout 15-122: Principles of Imperative Computation Frank Pfenning André Platzer Lecture 11 1 Introduction In order to understand how programs work, we can consider the functions,
More informationIt turns out that races can be eliminated without sacrificing much in terms of performance or expressive power.
The biggest two problems in multi-threaded programming are races and deadlocks. Races reached new levels with the introduction of relaxed memory processors. It turns out that races can be eliminated without
More informationSimulating Partial Specialization
Simulating Partial Specialization Mat Marcus mmarcus@adobe.com October 15, 2001 Overview The focus is on solving problems using generative template metaprogramming in a shrink wrap software development
More information6. Pointers, Structs, and Arrays. 1. Juli 2011
1. Juli 2011 Einführung in die Programmierung Introduction to C/C++, Tobias Weinzierl page 1 of 50 Outline Recapitulation Pointers Dynamic Memory Allocation Structs Arrays Bubble Sort Strings Einführung
More informationChapter 6 Introduction to Defining Classes
Introduction to Defining Classes Fundamentals of Java: AP Computer Science Essentials, 4th Edition 1 Objectives Design and implement a simple class from user requirements. Organize a program in terms of
More informationIntroduction to Programming in C Department of Computer Science and Engineering. Lecture No. #49. Structures in C -1
Introduction to Programming in C Department of Computer Science and Engineering Lecture No. #49 Structures in C -1 So, in this lecture will talk about structures and C, which is syntactic feature that
More informationPyCon Otto 6-9 April 2017 Florence. Rusty Python. Rust, a new language for our programmer tool belt. Matteo
PyCon Otto 6-9 April 2017 Florence Rusty Python Rust, a new language for our programmer tool belt Matteo Bertini @naufraghi 1 Rust Born as a personal project started in 2006 by Mozilla employee Graydon
More informationClasses Classes 2 / 36
Classes 1 / 36 Classes Classes 2 / 36 Anatomy of a Class By the end of next lecture, you ll understand everything in this class definition. package edu. gatech. cs1331. card ; import java. util. Arrays
More informationCS 326 Operating Systems C Programming. Greg Benson Department of Computer Science University of San Francisco
CS 326 Operating Systems C Programming Greg Benson Department of Computer Science University of San Francisco Why C? Fast (good optimizing compilers) Not too high-level (Java, Python, Lisp) Not too low-level
More informationFRP in ClojureScript with Javelin
FRP in ClojureScript with Javelin Alan Dipert @alandipert THE freshdiet Fresh, Gourmet, Delivered Daily nginx jetty syslog-ng redis postgres fn fn val val val (+ 1 (* 2 3)) + * 1 2 3 Applicative Evaluation
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 information1. true / false By a compiler we mean a program that translates to code that will run natively on some machine.
1. true / false By a compiler we mean a program that translates to code that will run natively on some machine. 2. true / false ML can be compiled. 3. true / false FORTRAN can reasonably be considered
More informationCMSC 132: Object-Oriented Programming II. Effective Java. Department of Computer Science University of Maryland, College Park
CMSC 132: Object-Oriented Programming II Effective Java Department of Computer Science University of Maryland, College Park Effective Java Textbook Title Effective Java, Second Edition Author Joshua Bloch
More informationMemory Management: The process by which memory is shared, allocated, and released. Not applicable to cache memory.
Memory Management Page 1 Memory Management Wednesday, October 27, 2004 4:54 AM Memory Management: The process by which memory is shared, allocated, and released. Not applicable to cache memory. Two kinds
More informationOverview. Rationale Division of labour between script and C++ Choice of language(s) Interfacing to C++
Scripting 1 Overview Rationale Division of labour between script and C++ Choice of language(s) Interfacing to C++ Rationale C++ isn't the best choice for all problems Complicated feature set, syntax Low-level,
More informationCanonical Form. No argument constructor Object Equality String representation Cloning Serialization Hashing. Software Engineering
CSC40232: SOFTWARE ENGINEERING Professor: Jane Cleland Huang Canonical Form sarec.nd.edu/courses/se2017 Department of Computer Science and Engineering Canonical Form Canonical form is a practice that conforms
More informationLet s Rust in Samba. Trying to use Samba with Rust libraries. Kai Blin Samba Team. SambaXP
Let s Rust in Samba Trying to use Samba with Rust libraries Kai Blin Samba Team SambaXP 2018 2017-06-06 Intro M.Sc. in Computational Biology Ph.D. in Microbiology Samba Team member 2/42 Overview Rust Intro
More informationCS-202 Introduction to Object Oriented Programming
CS-202 Introduction to Object Oriented Programming California State University, Los Angeles Computer Science Department Lecture III Inheritance and Polymorphism Introduction to Inheritance Introduction
More informationCSE 153 Design of Operating Systems
CSE 153 Design of Operating Systems Winter 19 Lecture 7/8: Synchronization (1) Administrivia How is Lab going? Be prepared with questions for this weeks Lab My impression from TAs is that you are on track
More informationMITOCW watch?v=rvrkt-jxvko
MITOCW watch?v=rvrkt-jxvko The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for free. To
More informationEncapsulation in C++
pm_jat@daiict.ac.in In abstract sense, it is all about information hiding Informally, you can call it as packaging of data and function together in a single entity called class such that you get implementation
More information