The course is also offered to the students of the fields other than those the course is directly associated with.
Fields of study the course is directly associated with
there are 7 fields of study the course is directly associated with, display
This course contains basic techniques and results of the theory of
sequential functions as described by the lambda-calculus and combibatoru
logic. The course contains the typed and untyped version of the
formalism, as well as basic results concerning models of lambda-calulus.
Lambda-calculus is important for understanding recursive constructs used
in programming as well in the corresponding semantics constructs, and it
provides a reference formalism useful for variaous applications.
Pure lambda-calculus: lambda-terms, structure of terms,
transformations, general reductions, beta-reduction.