Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras

Minlog is an interactive system which implements proof-theoretic methods and applies them to verification and program extraction. We give an overview of Minlog and demonstrate how it can be used to exploit the computational content in (co)algebraic proofs and to develop correct and efficient programs. We illustrate this by means of two examples: one about parsing, the other about exact real numbers in signed digit representation.

[1]  J. R. Marcial-Romero,et al.  Semantics of a sequential language for exact real-number computation , 2004, LICS 2004.

[2]  Ulrich Berger,et al.  Proofs, Programs, Processes , 2010, CiE.

[3]  Ulrich Berger,et al.  Term rewriting for normalization by evaluation , 2003, Inf. Comput..

[4]  Helmut Schwichtenberg,et al.  Proofs and Computations , 2012, Perspectives in logic.

[5]  Ulrich Berger,et al.  An inverse of the evaluation functional for typed lambda -calculus , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[6]  Maribel Fernández,et al.  Curry-Style Types for Nominal Terms , 2006, TYPES.

[7]  Dale Miller,et al.  A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification , 1991, J. Log. Comput..

[8]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[9]  Andrej Bauer,et al.  RZ: a Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice , 2007, J. Log. Comput..

[10]  Herman Geuvers,et al.  Constructive analysis, types and exact real numbers , 2007, Mathematical Structures in Computer Science.

[11]  Helmut Schwichtenberg.  Proof Search in Minimal Logic , 2004, AISC.

[12]  Pierre Letouzey,et al.  A New Extraction for Coq , 2002, TYPES.

[13]  Ulrich Berger,et al.  Coinduction for Exact Real Number Computation , 2007, Theory of Computing Systems.

[14]  Zuber,et al.  Proof Theory at Work: Program Development in the Minlog System , 1998 .

[15]  Ulrich Berger,et al.  From Coinductive Proofs to Exact Real Arithmetic , 2009, CSL.

[16]  Fernando Ferreira,et al.  Programs, Proofs, Processes , 2012, Theory of Computing Systems.

[17]  Luigi Acerbi,et al.  Shifting and Lifting of Cellular Automata , 2007 .

[18]  Alberto Ciaffaglione,et al.  A certified, corecursive implementation of exact real numbers , 2006, Theor. Comput. Sci..

[19]  D. Dalen.  Review: Georg Kreisel, Godel's Intepretation of Heyting's Arithmetic; G. Kreisel, Relations Between Classes of Constructive Functionals; Georg Kreisel, A. Heyting, Interpretation of Analysis by Means of Constructive Functionals of Finite Types , 1971 .

[20]  Ulrich Berger,et al.  REVIEWS-Refined program extraction from classical proofs , 2003 .

[21]  Ulrich Berger,et al.  Program Extraction from Normalization Proofs , 2006, Stud Logica.

[22]  Chi Ming Chuang,et al.  Extraction of Programs for Exact Real Number Computation Using Agda , 2011 .