Theoretical Foundations of Lambda Functions

Question

I'm just wondering where I can find some language study guides, for what lambda functions, their use and crude equivalents in languages ​​that don't support them.

I would especially like information on general notation.

Thank! Please let me know if I can elaborate on this.

EDIT: Oh, I forgot something.

In terms of terminology, what's the difference between an expression or lambda function, anonymous / delegate function, and closure?

Answer 1

In terms of terminology, what's the difference between an expression or lambda function, anonymous / delegate function, and closure?

Regarding terminology:

• - - , . : .

  - LISP (lambda (arguments ...) body), "". . Haskell \ arguments ... -> body, , Haskell , . ML, : fn args => body. -, . Haskell ; Lisp, ML Scheme body .

• - , , - . , . ( LISP , Haskell ML .)

• . , Smalltalk "block" , , , .

, " "; - .

Answer 2

. :

• A . , -.

  /li >

• A Prakash Panangden , -.

, , . ML/Hope/Miranda/Haskell -

• . , , .

Answer 3

, , .

- LISP.

" " - , , , , .

, , McCarthy " , " .

Answer 4

Lisp ( ). " " Lisp .

Lisp , . , , ( - , , ). , Lisp , . , Lisp - ( ) ( , ).

Lisp "" , , . Lisp. , Lisp - , , , .

Answer 5

-, SKI, . " " - , , , . , . .

- SKI calc. Unlambda :

```s``s``sii`ki
  `k.*``s``s`ks
 ``s`k`s`ks``s``s`ks``s`k`s`kr``s`k`sikk
  `k``s`ksk

, . .

Things got even weirder when it was shown that Perl regex could implement SKI calculus , and therefore Perl regex in a loop is complete. Creation is complete.

Answer 6

You have not yet viewed the Wikipedia page for lambda calculus ? This is heavier than mathematical theory, but it eventually becomes more practical when you hit first-class functions .