PPT-CSE341: Programming Languages

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 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. 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. Chapter One. Modern Programming Languages, 2nd ed. . 1. Outline. What makes programming languages an interesting subject? . The amazing variety. The odd controversies. The intriguing evolution. The connection to programming practice. 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. 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 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 18. Static vs. Dynamic Typing. Dan Grossman. Autumn . 2018. Key differences. Racket and ML have . much. . . in common. Key differences. Syntax. Pattern-matching vs. . struct. -tests and . accessor. 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 . 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.