컨텐츠 시작
학술대회/행사
초록검색
| 제출번호(No.) | 0271 |
|---|---|
| 분류(Section) | Special Session |
| 분과(Session) | (SS-04) Mathematical Logic and Its Applications (SS-04) |
| 발표시간(Time) | 19th-A-10:00 -- 10:30 |
| 영문제목 (Title(Eng.)) |
Why so many proof assistants? |
| 저자(Author(s)) |
Ki Yung Ahn1 Hannam University1 |
| 초록본문(Abstract) | Proof assistants (or, interactive theorem provers) is a research area that lies at the intersection of mathematics and computer science. Many proof assistants have been developed, and still are being developed, based on several different logical foundations. In this talk, we discuss practical implications of such different foundations for proof assistants, hoping to provide insights when choosing among various proof assistants for your purpose. |
| 분류기호 (MSC number(s)) |
03-04 |
| 키워드(Keyword(s)) | Formal proof, mechanized reasoning, interactive theorem proving, proof assistants |
| 강연 형태 (Language of Session (Talk)) |
Korean |