Miranda Perea, Favio Ezequiel (2004): On Extensions of AF2 with Monotone and Clausular (Co)inductive Definitions. Dissertation, LMU München: Faculty of Mathematics, Computer Science and Statistics |

Preview |
PDF
Miranda-Perea_Favio.pdf 999kB |

**DOI**: 10.5282/edoc.2855

### Abstract

This thesis discusses some extensions of second-order logic AF2 with primitive constructors representing least and greatest fixed points of monotone operators, which allow to define predicates by induction and coinduction. Though the expressive power of second-order logic has been well-known for a long time and suffices to define (co)inductive predicates by means of its (co)induction principles, it is more user-friendly to have a direct way of defining predicates inductively. Moreover recent applications in computer science oblige to consider also coinductive definitions useful for handling infinite objects, the most prominent example being the data type of streams or infinite lists. Main features of our approach are the use clauses in the (co)inductive definition mechanism, concept which simplifies the syntactic shape of the predicates, as well as the inclusion of not only (co)iteration but also primitive (co)recursion principles and in the case of coinductive definitions an inversion principle. For sake of generality we consider full monotone, and not only positive definitions, after all positivity is only used to ensure monotonicity. Working towards practical use of our systems we give them realizability interpretations where the systems of realizers are strongly normalizing extensions of the second-order polymorphic lambda calculus, system F in Curry-style, with (co)inductive types corresponding directly to the logical systems via the Curry-Howard correspondence. Such realizability interpretations are therefore not reductive: the definition of realizability for a (co)inductive definition is again a (co)inductive definition. As main application of realizability we extend the so-called programming-with-proofs paradigm of Krivine and Parigot to our logics, by means of which a correct program of the lambda calculus can be extracted from a proof in the logic.

Item Type: | Theses (Dissertation, LMU Munich) |
---|---|

Keywords: | second-order logic AF2, system F, inductive types, coinductive types, realizability, inductive definitions, coinductive definitions, programming-with-proofs |

Subjects: | 500 Natural sciences and mathematics 500 Natural sciences and mathematics > 510 Mathematics |

Faculties: | Faculty of Mathematics, Computer Science and Statistics |

Language: | English |

Date of oral examination: | 12. November 2004 |

1. Referee: | Schwichtenberg, Helmut |

MD5 Checksum of the PDF-file: | 09669c05d17983bac4671ff743c6ee55 |

Signature of the printed copy: | 0001/UMC 14150 |

ID Code: | 2855 |

Deposited On: | 25. Nov 2004 |

Last Modified: | 24. Oct 2020 11:06 |