PPT-CSE341: Programming Languages

Lecture 17 Implementing Languages Including Closures Dan Grossman Autumn 2018 Typical workflow Autumn 2018 2 CSE341 Programming Languages fn x gt x x 4 Parsing Call Function. Lecture 11. Closures-. ish. Java & . C. Dan Grossman. Fall 2011. Higher-order programming. Higher-order programming, e.g., with . map. and . filter. , is great. Language support for closures makes it very pleasant. Lecture 27. Generics vs. Subtyping; Bounded Polymorphism. Dan Grossman. Fall 2011. Today. Compare . generics and . subtyping. What each is good for. Combine generics and subtyping to get even more . benefit. Classification of programming languages. “There are only two kinds of programming languages: those people always bitch about and those nobody uses.”. --. Bjarne. . Stroustrup. 1. . Generated using wordle.net from the text of this ppt file. Introduction To Ruby; Dynamic OOP; "Duck Typing". Alan Borning. Autumn 2012. (slides borrowed from Dan Grossman). The plan. Lecture materials may not recount every little language feature we use. Thomas book . CS 170b. Benjamin Gaska, much help from William Mitchell. What is a programming language. A simple definition:. A system for describing computation.. It is generally agreed that in order for a language to be . 1. A Type Is A Set. When you declare that a variable has a certain type, you are saying that the values the variable can have are elements of a certain set. A type is a set of values. plus a low-level representation. Classification of programming languages. “There are only two kinds of programming languages: those people always bitch about and those nobody uses.”. --. Bjarne. . Stroustrup. 1. . Generated using wordle.net from the text of this ppt file. Lecture . 9. Function-Closure Idioms. Zach Tatlock. Winter 2018. More idioms. We know the rule for lexical scope and function closures. Now what is it good for. A partial but wide-ranging list:. Pass functions with private data to iterators: Done. Lecture 14. Thunks. , Laziness, Streams, . Memoization. Dan Grossman. Winter 2013. Delayed evaluation. For each language construct, the semantics specifies when . subexpressions. get evaluated. In ML, Racket, Java, C:. Lecture 24. Subtyping . Dan Grossman. Autumn . 2018. Last major topic: Subtyping. Build up key ideas from first principles. In . pseudocode. because:. No time for another language. Simpler . to first show subtyping without objects. Lecture 12. Equivalence. Dan Grossman. Autumn 2018. Last Topic of Unit. More careful look at what “two pieces of code are . equivalent. ” means. Fundamental software-engineering idea. Made easier with . Lecture 7. First-Class Functions. Dan Grossman. Spring 2019. What is functional programming?. “. Functional programming. ” can mean a few different things:. Avoiding mutation in most/all cases (done and ongoing). Lecture . 22. OOP . vs. Functional Decomposition; Adding Operators & Variants; . Double-Dispatch . Dan Grossman. Winter 2013. Breaking things down. In functional (and procedural) programming, break programs down into . Lecture 26. Course Victory Lap. Dan Grossman. Winter 2013. Final Exam. As also indicated in class-list . email:. Next . Thursday. , . 8:30-10:20. Intention is . to focus primarily on material since the midterm.