Lect 3.1 Functional Model

# Lect 3.1 Functional Model - Lecture 3.1 Functional Model...

This preview shows pages 1–5. Sign up to view the full content.

Lecture 3.1 Functional Model MAIN TOPICS Functional Languages Function Definition and Lambda Expressions Available functional languages References: Louden, Ch. 11

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Functional Model 2 Topics Functional Languages Function Definition and Lambda Expressions Available functional languages
Functional Model 3 Functional Languages Also called applicative language Application of functions on known values Makes use of mathematical properties of functions Are referentially transparent Defined functionally rather than procedurally

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Functional Model 4 Mathematical Functions A mathematical function is a mapping of members of one set ( domain set ) to another set ( range set ) The evaluation order of the mapping expression is controlled by recursion and conditional expression Unlike imperative languages where the evaluation order depends on sequencing and iterative repetition Mathematical functions have no side effect as they always define the same value given the same set of arguments Side effects in programming languages are connected to variables that model memory locations
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 17

Lect 3.1 Functional Model - Lecture 3.1 Functional Model...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online