CSE 341: Programming Languages Section 1

Slides:



Advertisements
Similar presentations
Programming Languages Section 1 1 Programming Languages Section 1. SML Fundamentals Xiaojuan Cai Spring 2015.
Advertisements

CSE341: Programming Languages Lecture 16 Datatype-Style Programming With Lists or Structs Dan Grossman Winter 2013.
OCaml The PL for the discerning hacker.. Hello. I’m Zach, one of Sorin’s students.
Today’s Agenda ML Development Workflow –Emacs –Using use –The REPL More ML –Shadowing Variables –Debugging Tips –Boolean Operations –Comparison Operations.
JavaScript: Conditionals contd.
CSE341: Programming Languages Lecture 21 Dynamic Dispatch Precisely, and Manually in Racket Dan Grossman Spring 2016.
CSE341: Programming Languages Lecture 3 Local Bindings; Options; Benefits of No Mutation Dan Grossman Winter 2013.
CSE 341 Section 1 (9/28) With thanks to Dan Grossman, et. al. from previous versions of these slides.
CSE341: Programming Languages Lecture 21 Dynamic Dispatch Precisely, and Manually in Racket Dan Grossman Winter 2013.
CSE341: Programming Languages Lecture 7 First-Class Functions
CSE 341 Section 1 (9/28) With thanks to Dan Grossman, et. al. from previous versions of these slides.
CSE341: Programming Languages Lecture 4 Records, Datatypes, Case Expressions Dan Grossman Autumn 2017.
More important details More fun Part 3
CS161 Introduction to Computer Science
CSE341: Programming Languages Lecture 21 Dynamic Dispatch Precisely, and Manually in Racket Dan Grossman Spring 2017.
CSE341: Programming Languages Lecture 15 Macros
CSE341: Programming Languages Lecture 3 Local Bindings; Options; Benefits of No Mutation Dan Grossman Spring 2017.
EGR 2261 Unit 4 Control Structures I: Selection
CSE341: Programming Languages Lecture 4 Records, Datatypes, Case Expressions Dan Grossman Winter 2013.
CSE341: Programming Languages Lecture 21 Dynamic Dispatch Precisely, and Manually in Racket Dan Grossman Autumn 2017.
CSE341: Programming Languages Lecture 4 Records, Datatypes, Case Expressions Dan Grossman Spring 2017.
CSE341: Programming Languages Lecture 16 Datatype-Style Programming With Lists or Structs Dan Grossman Spring 2013.
Nicholas Shahan Spring 2016
Sentinel logic, flags, break Taken from notes by Dr. Neil Moore
CSE341: Programming Languages Lecture 15 Macros
CSE 341: Programming Langs
CSE341: Programming Languages Section 1
Sentinel logic, flags, break Taken from notes by Dr. Neil Moore
CSE341: Programming Languages Lecture 8 Lexical Scope and Function Closures Dan Grossman Winter 2013.
CSE341: Programming Languages Lecture 21 Dynamic Dispatch Precisely, and Manually in Racket Dan Grossman Autumn 2018.
CSE 341 Section 1 Nick Mooney Spring 2017
CSE341: Programming Languages Section 1
CSE341: Programming Languages Lecture 8 Lexical Scope and Function Closures Dan Grossman Spring 2013.
CSE341: Programming Languages Lecture 3 Local Bindings; Options; Benefits of No Mutation Dan Grossman Spring 2013.
CSE341: Programming Languages Lecture 7 First-Class Functions
CSE341: Programming Languages Lecture 3 Local Bindings; Options; Benefits of No Mutation Dan Grossman Spring 2016.
CSE341: Programming Languages Lecture 4 Records, Datatypes, Case Expressions Dan Grossman Winter 2018.
CSE341: Programming Languages Lecture 8 Lexical Scope and Function Closures Dan Grossman Spring 2016.
CSE341: Programming Languages Lecture 7 First-Class Functions
CSE 341 Section 2 Winter 2018 Adapted from slides by Nick Mooney, Nicholas Shahan, Patrick Larson, and Dan Grossman.
Coding Concepts (Basics)
CSE 341: Programming Languages Section 1
CSE341: Programming Languages Lecture 15 Macros
CSE 341 Section 5 Winter 2018.
CSE341: Programming Languages Lecture 8 Lexical Scope and Function Closures Dan Grossman Autumn 2018.
CSE341: Programming Languages Lecture 4 Records, Datatypes, Case Expressions Dan Grossman Autumn 2018.
CSE341: Programming Languages Lecture 3 Local Bindings; Options; Benefits of No Mutation Dan Grossman Autumn 2018.
Winter 2018 With thanks to: Dan Grossman / Eric Mullen
CSE341: Programming Languages Lecture 3 Local Bindings; Options; Benefits of No Mutation Dan Grossman Winter 2018.
CSE341: Programming Languages Lecture 8 Lexical Scope and Function Closures Zach Tatlock Winter 2018.
CSE341: Programming Languages Lecture 4 Records, Datatypes, Case Expressions Dan Grossman Spring 2016.
CSE341: Programming Languages Lecture 15 Macros
Dan Grossman / Eric Mullen Autumn 2017
CSE341: Programming Languages Lecture 7 First-Class Functions
CSE341: Programming Languages Lecture 15 Macros
CSE341: Programming Languages Lecture 7 First-Class Functions
CSE341: Programming Languages Lecture 8 Lexical Scope and Function Closures Dan Grossman Autumn 2017.
CSE341: Programming Languages Lecture 7 First-Class Functions
CSE341: Programming Languages Lecture 3 Local Bindings; Options; Benefits of No Mutation Dan Grossman Spring 2019.
CSE341: Programming Languages Lecture 3 Local Bindings; Options; Benefits of No Mutation Dan Grossman Autumn 2017.
CSE341: Programming Languages Lecture 4 Records, Datatypes, Case Expressions Dan Grossman Spring 2019.
Programming Languages Dan Grossman 2013
CSE341: Programming Languages Lecture 8 Lexical Scope and Function Closures Dan Grossman Spring 2019.
CSE341: Programming Languages Section 1
Brett Wortzman Summer 2019 Slides originally created by Dan Grossman
Brett Wortzman Summer 2019 Slides originally created by Dan Grossman
CSE341: Programming Languages Lecture 7 First-Class Functions
CSE341: Programming Languages Lecture 15 Macros
CSE341: Programming Languages Lecture 21 Dynamic Dispatch Precisely, and Manually in Racket Dan Grossman Spring 2019.
CSE341: Programming Languages Lecture 15 Macros
Presentation transcript:

CSE 341: Programming Languages Section 1 Konstantin Weitz Thanks to Dan Grossman, Josiah Adams, and Cody A. Schroeder for the substantial majority of this content

Hi, I’m Konstantin

Hi, I’m Konstantin ( , )

Hi, I’m Konstantin

Hi, I’m Konstantin

Hi, I’m Konstantin

Hi, I’m Konstantin

Hi, I’m Konstantin

Today’s Agenda ML Development Workflow Emacs Using use The REPL (Read–Eval–Print Loop) More ML Shadowing Variables Debugging Tips Boolean Operations Comparison Operations

Emacs Demo Recommended (not required) editor for this course Powerful, but the learning curve can at first be intimidating Demo Topics Note: Installation instructions & guide found on course website Control and Meta keys Buffers SML Open / Save / Close Cut / Copy / Paste

Using use use "foo.sml"; Enters bindings from the file foo.sml Like typing the variable bindings one at a time in sequential order into the REPL (more on this in a moment) Result is () bound to variable it Ignorable

The REPL Read-Eval-Print-Loop is well named Conveniently run programs Useful to quickly try something out Save code for reuse by moving it into a persistent .sml file Expects semicolons For reasons discussed later, it’s dangerous to reuse use without restarting the REPL session (short REPL demo)

Debugging Errors Your mistake could be: Syntax: What you wrote means nothing or not the construct you intended Type-checking: What you wrote does not type-check Evaluation: It runs but produces wrong answer, or an exception, or an infinite loop Keep these straight when debugging even if sometimes one kind of mistake appears to be another The error messages you get is just ML’s best guess at the problem. It’s up to you to ultimately diagnose and fix. ML’s error messages leave something to be desired.

Play around Best way to learn something: Try lots of things and don’t be afraid of errors Work on developing resilience to mistakes Slow down Don’t panic Read what you wrote very carefully Maybe watching me make a few mistakes will help… (interactively correct all mistakes in errors.sml)

Shadowing of Variable Bindings val a = 1; (* a -> 1 *) val b = a; (* a -> 1, b -> 1 *) val a = 2; (* a -> 2, b -> 1 *) Expressions in variable bindings are evaluated “eagerly” Before the variable binding “finishes” Afterwards, the expression producing the value is irrelevant Multiple variable bindings to the same variable name, or “shadowing”, is allowed When looking up a variable, ML uses the latest binding by that name in the current environment Remember, there is no way to “assign to” a variable in ML Can only shadow it in a later environment After binding, a variable’s value is an immutable constant NOTE: relationship between variable bindings and the environment (Emphasize this now to lay the foundation for first-class functions)

Try to Avoid Shadowing val x = "Hello World"; val x = 2; (* is this a type error? *) val res = x * 2; (* is this 4 or a type error? *) Shadowing can be confusing and is often poor style Why? Reintroducing variable bindings in the same REPL session may.. make it seem like wrong code is correct; or make it seem like correct code is wrong.

Using a Shadowed Variable Is it ever possible to use a shadowed variable? Yes! And no… It can be possible to uncover a shadowed variable when the latest binding goes out of scope val x = "Hello World"; fun add1(x : int) = x + 1; (* shadow x in func body *) val y = add1 2; val z = x^"!!"; (* "Hello World!!" *)

Use use Wisely Warning: Variable shadowing makes it dangerous to call use more than once without restarting the REPL session. It may be fine to repeatedly call use in the same REPL session, but unless you know what you’re doing, be safe! Ex: loading multiple distinct files (with independent variable bindings) at the beginning of a session use’s behavior is well-defined, but even expert programmers can get confused Restart your REPL session before repeated calls to use

Boolean Operations andalso e1 andalso e2 orelse e1 orelse e2 not Syntax Type-checking Evaluation andalso e1 andalso e2 e1 and e2 must have type bool Same as Java’s e1 && e2 orelse e1 orelse e2 Same as Java’s e1 || e2 not not e1 e1 must have type bool Same as Java’s !e1 not is just a pre-defined function, but andalso and orelse must be built-in operations since they cannot be implemented as a function in ML. Why? Because andalso and orelse “short-circuit” their evaluation and may not evaluate both e1 and e2. Be careful to always use andalso instead of and. and is completely different. We will get back to it later.

Style with Booleans Language does not need andalso , orelse , or not Using more concise forms generally much better style And definitely please do not do this: (* e1 andalso e2 *) if e1 then e2 else false (* e1 orelse e2 *) if e1 then true else e2 (* not e1 *) if e1 then false else true (* just say e (!!!) *) if e then true else false

= <> > < >= <= Comparisons For comparing int values: = <> > < >= <= You might see weird error messages because comparators can be used with some other types too: > < >= <= can be used with real, but not 1 int and 1 real = <> can be used with any “equality type” but not with real Let’s not discuss equality types yet