University of Ottawa - Carleton University
Ottawa-Carleton Institute for Computer Science (OCICS) Presentation
|
October 19, 2012 @ 10:00a.m.
Modeling of Discrete Event Systems Using Lambda Calculus
|
Speaker: Luminita Suse
Location: LMX 360 (Lamoureux) |
ABSTRACT
Lambda calculus is a formal system in mathematical logic for expressing computation through variable binding and substitution. It was first formulated by Alonzo Church in 1936 as a way to formalize mathematics through the notion of functions. Since then, lambda calculus has been applied in many different areas of mathematics, philosophy and computer science. It has played an important role in the development of the theory of programming languages and it has influenced the design of the LISP programming language and functional programming languages in general.
This presentation describes the use of the lambda calculus in the modeling of logic systems described in a natural language such as English and the impact of such modeling in several areas of application such as: the representation of computations and the resulting functional programming languages; the representation of reasoning, all of the above converging towards the modeling, analysis and synthesis of discrete event system.
Therefore, the presentation focuses on the notion of computability formalized in terms of lambda definability which is conceptually the basis for the discipline of functional programming (an important progress in this area has been the construction of very efficient compilers for functional languages), the representation of proofs in mathematical logic as one of lambda calculus original goal to construct a formal system for the foundations of mathematics, and the applications of all the above to discrete systems.
A few examples of the application of the lambda calculus to the modeling of discrete event systems described through abstract requirements will be presented in order to better illustrate the supervisory control of the above.
|
| Return to Schedule |
|
