Representing Agda and coinduction in the λΠ-calculus modulo rewriting - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Master Thesis Year : 2021

Representing Agda and coinduction in the λΠ-calculus modulo rewriting

Abstract

Coinduction is a principle, or a proof technique, dual to induction and which allows to handle possibly infinite objects in a natural way, such as infinite lists, infinite trees, formal languages, non well-founded sets, etc. Because of its usefulness, it is increasingly being added to proof assistants, such as Coq, Isabelle, PVS and Agda. In order to be able to translate proofs by coinduction coming from multiple proof assistants it is thus important to first understand how to encode coinduction in Dedukti, a problem that had never been addressed before. During this internship, we studied the representation of Agda and coinduction in Dedukti. Among the techniques of implementing coinduction in proof assistants, Agda features two presentations: musical coinduction and copattern coinduction. Based on their internal syntax representation in Agda, we proposed an encoding of both presentations in Dedukti. We resumed the development of the Agda2Dedukti translator and extended it with the proposed encoding, allowing it to translate automatically proofs by coinduction into Dedukti.
Fichier principal
Vignette du fichier
memoire_stage.pdf (691 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03343699 , version 1 (14-09-2021)

Identifiers

  • HAL Id : hal-03343699 , version 1

Cite

Thiago Felicissimo. Representing Agda and coinduction in the λΠ-calculus modulo rewriting. Logic in Computer Science [cs.LO]. 2021. ⟨hal-03343699⟩
143 View
166 Download

Share

Gmail Mastodon Facebook X LinkedIn More