2. A lambda expression specifies the parameters and the mapping of a function
3. Atoms and lists
4. In a linked list structure
5. The necessity of QUOTE arises because of the fundamental nature of Scheme : data and code have the same form
6. Simpel lists are the lists which elements are restricted to atoms
7. read-evaluate-print loop
13. The origin of the name of CAR AND CDR lies in the first implementation of LISP, which was on an IBM 704 computer.
14. AB
18. Tail recursive function is a function whose recursive call is the last operation in the function. Regardless of how many recursive calls are requested, only one activation record instance is necessary, if we use the tail recursive function
20. Scheme is far smaller and semantically simpler, in part because of its exclusive use of static scoping, but also because it was designed to be used for teaching programming.
22. Reader macros or read macros are expanded during the reader phase of a LISP language processor
23. ML is a strongly typed language whereas Scheme is essentially typeless. ML uses a syntax that is more closely related to that of an imperative language than that of LISP
24. Evaluation environment stores the names of all implicitly and explicitly declared identifiers in a program, along with their types.
Problem Set
2. fun function_name (formal parameters) = expression;
4. Characteristics of Haskell
- functions in Haskell can be overloaded
- nonstrict semantics are used in Haskell
- Haskell is a pure functional programming language
7. F# has a full-featured IDE, an extensive library of utilities that supports imperative, object-oriented, and functional programming, and has interoperability with a collection of nonfunctional languages.
No comments:
Post a Comment