PPT-CSE341: Programming Languages

Lecture 18 Static vs Dynamic Typing Dan Grossman Autumn 2018 Key differences Racket and ML have much in common Key differences Syntax Patternmatching vs struct tests and accessor. Lecture 12. Modules. Dan Grossman. Fall 2011. Modules. For larger programs, one “top-level” sequence of bindings is poor. Especially because a binding can use . all. earlier (non-shadowed) bindings. 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. Lecture 9. Function-Closure Idioms. Dan Grossman. Fall 2011. 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. 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 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 . 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. Lecture 9. Function-Closure Idioms. Dan Grossman. Fall 2011. 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.