2019 Advanced Topics in Computing AO

Font size  SML

Register update notification mail Add to favorite lecture list
Academic unit or major
School of Computing
Instructor(s)
-
Course component(s)
Lecture
Day/Period(Room No.)
Undecided ()  
Group
-
Course number
XCO.T497
Credits
2
Academic year
2019
Offered quarter
1-2Q
Syllabus updated
2019/4/3
Lecture notes updated
-
Language used
English
Access Index

Course description and aims

This course provides lectures on stat-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 aptop computer where the proof assistant Isabelle is installed.

Student learning outcomes

Students should be able to understand the basic theory of interactive theorem proving and to formalize a simple theory in a proof assistant.

Keywords

proof assistant, type theory, dependent type, logical framework, automation in proof assistants

Competencies that will be developed

Intercultural skills Communication skills Specialist skills Critical thinking skills Practical and/or problem-solving skills

Class flow

Specified in the class

Course schedule/Required learning

  Course schedule Required learning
Class 1 Introduction to Proof Assistants Specified in the class
Class 2 Logic for Computable Functions Specified in the class
Class 3 Simple Type Theory Specified in the class
Class 4 Intuitionistic Logic and BHK Interpretation Specified in the class
Class 5 Dependent Types and Lambda P Specified in the class
Class 6 Full Polymorphism Specified in the class
Class 7 Introduction to Isabelle (Practical session 1) Specified in the class
Class 8 Proof Assistant Packages Specified in the class
Class 9 Paradoxes in formal theories Specified in the class
Class 10 Functions and Sets (Practical session 2) Specified in the class
Class 11 Set theory as a proof foundation Specified in the class
Class 12 Logical frameworks Specified in the class
Class 13 Code Generation (Practical session 3) Specified in the class
Class 14 Automation in Proof Assistants Specified in the class
Class 15 Wrap-up Specified in the class

Textbook(s)

None.

Reference books, course materials, etc.

Course materials will be specified in the lecture.

Assessment criteria and methods

Students' course scores are determined by reports.

Related courses

  • MCS.T416 : Logic and Computation

Prerequisites (i.e., required knowledge, skills, courses, etc.)

Completion of Course "Logic and Computation" is preferable.

Page Top