Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, April 23, 2013, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Thilo Weghorn
There are many proof assistants like Isabelle, Coq, Agda, which help to prove mathematical theorems in an interactive setting. In addition to that some of these proof assistants, e.g. MINLOG, provide program extraction from constructive proofs which are represented by lambda-terms. After eliminating the parts without computational content, the extracted lambda term can be interpreted by a functional programming language, for example HASKELL. By extracting a program from a proof, its correctness with regard to the specifications given by the corresponding theorem is guaranteed. Hence correct algorithms for numerics can be extracted out of proofs which were done in constructive analysis. In my thesis I try to extract a program from a constructive version of Picard-Lindelöf's Theorem, that provides exact solutions for ordinary differential equations.
Automatic MiSe System Software Version 1.4803M | admin login