Teaching Semantics with a Proof Assistant or No more LSD trip proofs, Tobias Nipkow

Activity: Participating in or organising an eventOrganising a conference, workshop, ...

Description

The gulf between many computer science students and rigorous proofs is well known and much lamented. Teachers are frequently confronted with student ``proofs'' that look more like LSD trips than coherent chains of logic. In this talk I will present a new Programming Language Semantics course that bridges the gulf with the help of a proof assistant, Isabelle. During the first quarter of the semester the students are introduced to machine-checked proofs. The rest of the course covers a wide spectrum of topics centered around a simple imperative language: operational semantics, compilation, types, program analysis and Hoare logic. At the end of my talk I will give a (predictably positive) evaluation of the approach.
Period24 Jun 2013
Event typeGuest talk
LocationAustriaShow on map

Fields of science

  • 101002 Analysis
  • 101013 Mathematical logic
  • 101001 Algebra
  • 101012 Combinatorics
  • 101020 Technical mathematics
  • 102 Computer Sciences
  • 101 Mathematics
  • 101009 Geometry
  • 102011 Formal languages
  • 101006 Differential geometry
  • 101005 Computer algebra
  • 101025 Number theory
  • 101003 Applied geometry
  • 102025 Distributed systems

JKU Focus areas

  • Computation in Informatics and Mathematics