>>> >>> >>>

. :

. .
ISBN 5-89158-102-7
2002. 96 c. 721
 32.97
 004
.
1
99
2
288
21.03.2023
1
2   .




.




..
. 2-.

.

, . - . , , . . , , , , .

This book contains the basics for computation models in Computer Science. The core topics both of lambda-calculus and combinatory calculi are covered.

The main goals are to provide formal tools to assess meaning of programming constructs in both a language-independent and a machine independent way including the code compiling and generation, its optimization and runtime considerations. This is done using the categorical abstract machine - relatively new direction in studying and understanding the programs and computations. The material is equipped with serial examples of growing up complexity.

This book is recommended to the undergraduate and postgraduate students in Computer Science, Programming Languages, Information Technologies, and Discrete Mathematics.

.

- (, )

1. 11

  • 1.1 11
  • 1.2 13
  • 1.3 20
  • 1.4 23
    • 24
    • 25
    • 27
    • 29
31
  • 1.5 - 32
    36
  • 1.6 37
    38

    2 39

    • 2.1 39
    • 2.2 47
    • 2.3 48
    • 2.4 48
    • 2.5 49
    • 2.6 50
    • 2.7 ... 54
    • 2.8 54
    56

    3 65

    • 3.1 - 65
    • 3.2 - 66
    • 3.3 67

    69

    • 4.1 69
    • 4.2 73
    • 4.3 mkloop 80
    • 4.4 83

    5 89

    93

    95