# Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

__Mittagsseminar Talk Information__ | |

**Date and Time**: Tuesday, April 23, 2013, 12:15 pm

**Duration**: 30 minutes

**Location**: OAT S15/S16/S17

**Speaker**: Thilo Weghorn

## Program Extraction in Constructive Analysis with the Proof Assistant MINLOG

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.

Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)

Previous talks by year: 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M | admin login