1 / 5

Fundamentals of Functional Programming Languages

Fundamentals of Functional Programming Languages. The objective of the design of a FPL is to mimic mathematical functions to the greatest extent possible The basic process of computation is fundamentally different in a FPL than in an imperative language

floydreeves
Télécharger la présentation

Fundamentals of Functional Programming Languages

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. Fundamentals of Functional Programming Languages • The objective of the design of a FPL is to mimic mathematical functions to the greatest extent possible • The basic process of computation is fundamentally different in a FPL than in an imperative language • In an imperative language, operations are done and the results are stored in variables for later use • Management of variables is a constant concern and source of complexity for imperative programming • In an FPL, variables are not necessary, as is the case in mathematics

  2. Fundamentals of Functional Programming Languages (cont.) A purely functional programming language does not use variables or assignment statement, thus freeing the programmer from concerns about the memory Repetition must be done by recursion rather than by iteration. Programs are function definitions and function application specifications, and execution consists of evaluating the function applications.

  3. Fundamentals of Functional Programming Languages (cont.) • A functional language provides: • a set of primitive functions, • a set of functional forms to construct complex functions, • a function application operation, and • some structure or structure for data representation • These structs are used to represent the parameters and values computed by functions.

  4. LISP Data Types and Structures • Data object types: originally only atoms and lists • List form: parenthesized collections of sublists and/or atoms e.g., (A B (C D) E) • Originally, LISP was a typeless language • LISP lists are stored internally as single-linked lists (page 672)

  5. LISP Interpretation • Lambda notation is used to specify functions and function definitions. Function applications and data have the same form. e.g., If the list (A B C) is interpreted as data it is a simple list of three atoms, A, B, and C If it is interpreted as a function application, it means that the function named A is applied to the two parameters, B and C • The first LISP interpreter appeared only as a demonstration of the universality of the computational capabilities of the notation

More Related