PPT-CSE341: Programming Languages

Lecture 14 Thunks Laziness Streams Memoization Dan Grossman Spring 2017 Delayed evaluation For each language construct the semantics specifies when subexpressions get evaluated In ML Racket Java C. 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 18. Static vs. Dynamic Typing. Dan Grossman. Fall 2011. Static vs. dynamic typing. A big, juicy, essential, topic about how to think about PLs. Conversation usually overrun with half-informed opinions . Lecture 14. Introduction to Racket. Dan Grossman. Fall 2011. Racket. Next 2+ weeks will use the Racket language (not ML) and the . DrRacket. programming environment (not . emacs. ). Installation / basic usage instructions on course website. 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 . 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. 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 . 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. 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 . Lecture 17. Implementing Languages Including Closures. Dan Grossman. Autumn . 2018. Typical workflow. Autumn 2018. 2. CSE341: Programming Languages. "(. fn. x => x x) 4". Parsing. Call. Function. Lecture 19. Introduction to Ruby and OOP. Dan Grossman. Autumn . 2018. Ruby logistics. Next two sections use the Ruby language. http://. www.ruby-lang.org/. Installation / basic usage instructions on course website. Lecture . 6. Tail Recursion, Accumulators, Exceptions. Dan Grossman. Fall 2011. Two unrelated topics. Tail recursion. Exceptions. Fall 2011. 2. CSE341: Programming Languages. Recursion. Should now be comfortable with recursion:. Lecture 17. Implementing Languages Including Closures. Dan Grossman. Spring 2013. Typical workflow. Spring 2013. 2. CSE341: Programming Languages. "(. fn. x => x + x) 4". Parsing. Call. Function. Lecture . 6. Nested Patterns. Exceptions. Tail Recursion. Dan Grossman. Spring . 2013. Nested patterns. We can nest patterns as deep as we want. Just like we can nest expressions as deep as we want. Often avoids hard-to-read, wordy nested case expressions. 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 .