1 / 8

Chapter 3.6, 10, 13 Reading Discussion

Chapter 3.6, 10, 13 Reading Discussion. Functional languages. Work in small groups Don’t look at the text or your notes List as many functional languages as you can recall For each language list some features that that language is known for. Features.

abiba
Download Presentation

Chapter 3.6, 10, 13 Reading Discussion

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Chapter 3.6, 10, 13 Reading Discussion

  2. Functional languages • Work in small groups • Don’t look at the text or your notes • List as many functional languages as you can recall • For each language list some features that that language is known for.

  3. Features • What features make a language functional • What features are not necessarily functional but are found more often in functional languages

  4. Features • What features make a language functional • First class functions • Higher order functions • What features are not necessarily functional but are found more often in functional languages • Types and polymorphism • Algebraic datatypes (lists, trees) • Garbage collection • Pure features (no side effects) • recursion

  5. E3 and Scheme • The language E3 is based upon Scheme • List as many features as you can recall from Scheme found in E3 • What features found in Scheme are not in E3?

  6. E3 and Scheme • The language E3 is based upon Scheme • List as many features as you can recall from Scheme found in E3 • Dynamic typing and predicates (like: char? = ischar, number? = isint, pair? = ispair) • Lists as pairs • prefix notation and parentheses • What features found in Scheme are not in E3? • First class functions • Programs as lists (self representing)

  7. Normal order evaluation • What is normal order evaluation? • What are other choices? • How do they compare with normal order evaluation?

  8. Currying • What is currying?

More Related