This course provides lectures on state-of-the-art topics by faculty members invited from overseas universities.
Interactive Theorem Proving:
This course is given by Prof. Cezary Kaliszyk from University of Innsbruck and covers the theory and practice of interactive theorem proving such as logic for computable functions, simple type theory, and dependent types. The lecture includes practical sessions using the proof assistant Isabelle.
The course is held at 15:05 - 16:35 on the following dates:
June 4, June 7, June 11, June 14, June 18, June 21, June 25, June 28, July, 2, July 16, July 19, July 23, July 26, July 30.
(Basically, every Tuesday and Friday, but with a break at the beginning of July.)
For practical sessions, you need to bring a laptop computer where the proof assistant Isabelle is installed.
Students should be able to understand the basic theory of interactive theorem proving and to formalize a simple theory in a proof assistant.
proof assistant, type theory, dependent type, logical framework, automation in proof assistants
Specified in the class
|第1回||Introduction to Proof Assistants||Specified in the class|
|第2回||Logic for Computable Functions||Specified in the class|
|第3回||Simple Type Theory||Specified in the class|
|第4回||Intuitionistic Logic and BHK Interpretation||Specified in the class|
|第5回||Dependent Types and Lambda P||Specified in the class|
|第6回||Full Polymorphism||Specified in the class|
|第7回||Introduction to Isabelle (Practical session 1)||Specified in the class|
|第8回||Proof Assistant Packages||Specified in the class|
|第9回||Paradoxes in formal theories||Specified in the class|
|第10回||Functions and Sets (Practical session 2)||Specified in the class|
|第11回||Set theory as a proof foundation||Specified in the class|
|第12回||Logical frameworks||Specified in the class|
|第13回||Code Generation (Practical session 3)||Specified in the class|
|第14回||Automation in Proof Assistants||Specified in the class|
|第15回||Wrap-up||Specified in the class|
Course materials will be specified in the lecture.
Students' course scores are determined by reports.
Completion of Course "Logic and Computation" is preferable.