Disciplinary Commons – Portfolio on the course Introduction to Computing (2009)
This is a portfolio on the course Introduction to Computing I, II taught at the
(Affiliated to the British Mathematical Colloquium 2007) (2008)
Arnold Beckmann, Ulrich Berger, Birgit Elbl, Reinhard Kahle, Karl-heinz Niggl, Oliver Kullmann, ...
"Proof, Computation, Complexity " (PCC) is a series of annual workshops that aims to stimulate research in proof theory, computation, and complexity, focusing on issues which...
Applications of inductive definitions and choice principles to program synthesis (2008)
Ulrich Berger, Monika Seisenberger
Abstract. We describe two methods of extracting constructive content from classical proofs, focusing on theorems involving infinite sequences and nonconstructive choice principles. The first method...
an der Fakultät für Mathematik und Informatik der Ludwig–Maximilians–Universität München (2008)
Monika Seisenberger, Monika Seisenberger, Monika Seisenberger, Erstgutachter Prof, Dr. H. Schwichtenberg, Zweitgutachter Prof, ...
This thesis aims at exploring the scopes and limits of techniques for extracting programs from proofs. We focus on constructive theories of inductive definitions and classical systems allowing choice...
The Warshall algorithm and Dickson’s lemma: Two examples of realistic program extraction (2007)
Ulrich Berger, Helmut Schwichtenberg, Monika Seisenberger
Abstract. By means of two well-known examples it is demonstrated that the method of extracting programs from proofs is manageable in practice and may yield efficient programs. The Warshall algorithm...
Abstracts for Presentations Edited by (2007)
Magne Haveraaen, John Power, Monika Seisenberger, John Power, Monika Seisenberger
CALCO brings together researchers and practitioners to exchange new results related to foundational aspects and both traditional and emerging uses of algebras and coalgebras in computer science. The...
Magne Haveraaen, John Power, Magne Haveraaen, John Power, Monika Seisenberger
The CALCO Young Researchers Workshop, CALCO-jnr, was a satellite event for 2nd Conference on Algebra and Coalgebra in Computer Science, August 20-24, 2007, Bergen, Norway (CALCO’07). CALCO-jnr was...
Peter Mosses, John Power, Monika Seisenberger, John Power, Monika Seisenberger
and WADT – the Workshop on Algebraic Development Techniques, have joined their forces and reputations into a new high-level bi-annual conference. Starting in 2005, CALCO brings together researchers...
On the Constructive Content of Proofs (2003)
This thesis aims at exploring the scopes and limits of techniques for extracting programs from proofs. We focus on constructive theories of inductive definitions and classical systems allowing choice...
On the Constructive Content of Proofs (2003)
This thesis aims at exploring the scopes and limits of techniques for extracting programs from proofs. We focus on constructive theories of inductive definitions and classical systems allowing choice...
On the constructive content of proofs / (2003)
München, University, Diss., 2003.
The Warshall Algorithm and Dickson's Lemma: Two Examples of realistic program extraction (1999)
Ulrich Berger, Helmut Schwichtenberg, Monika Seisenberger
. By means of two well-known examples it is demonstrated that the method of extracting programs from proofs is manageable in practice and may yield efficient programs. The Warshall algorithm...
The Warshall Algorithm and Dickson's Lemma: Two Examples of realistic program extraction (1999)
Ulrich Berger Helmut, Helmut Schwichtenberg, Monika Seisenberger
. By means of two well-known examples it is demonstrated that the method of extracting programs from proofs is manageable in practise and may yield efficient and sometimes unexpected programs. The...
From Proofs to Programs in the Minlog System - The Warshall Algorithm and Higman's Lemma (1997)
Ulrich Berger, Helmut Schwichtenberg, Monika Seisenberger
. The Warshall algorithm computing the transitive closure of a relation is extracted from a constructive proof that repetitions in a path can always be avoided. Secondly a nonconstructive proof of a...