/
Chapter 3.6,  10, 13  Reading Discussion Chapter 3.6,  10, 13  Reading Discussion

Chapter 3.6, 10, 13 Reading Discussion - PowerPoint Presentation

jane-oiler
jane-oiler . @jane-oiler
Follow
366 views
Uploaded On 2018-03-23

Chapter 3.6, 10, 13 Reading Discussion - PPT Presentation

Functional languages Work in small groups Dont 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 ID: 661571

scheme features language functional features scheme functional language order languages list recall lists functions evaluation normal currying class necessarily based

Share:

Link:

Embed:

Download Presentation from below link

Download Presentation The PPT/PDF document "Chapter 3.6, 10, 13 Reading Discussion" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.


Presentation Transcript

Slide1

Chapter 3.6, 10, 13 Reading DiscussionSlide2

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.Slide3

Features

What features make a language functional

What features are not necessarily functional but are found more often in functional languagesSlide4

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

)

recursionSlide5

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?Slide6

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)Slide7

Normal order evaluation

What is normal order evaluation?

What are other choices?

How do they compare with normal order evaluation?Slide8

Currying

What

is currying?