A Curry-Howard Correspondence for Linear, Reversible Computation - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2022

A Curry-Howard Correspondence for Linear, Reversible Computation

Abstract

In this paper, we present a linear and reversible programming language with inductives types and recursion. The semantics of the languages is based on pattern-matching; we show how ensuring syntactical exhaustivity and non-overlapping of clauses is enough to ensure reversibility. The language allows to represent any Primitive Recursive Function. We then give a Curry-Howard correspondence with the logic µMALL: linear logic extended with least xed points allowing inductive statements. The critical part of our work is to show how primitive recursion yields circular proofs that satisfy µMALL validity criterion and how the language simulates the cut-elimination procedure of µMALL.
Fichier principal
Vignette du fichier
main.pdf (862.51 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03747425 , version 1 (08-08-2022)

Identifiers

  • HAL Id : hal-03747425 , version 1

Cite

Kostia Chardonnet, Alexis Saurin, Benoît Valiron. A Curry-Howard Correspondence for Linear, Reversible Computation. 2022. ⟨hal-03747425⟩
117 View
101 Download

Share

Gmail Mastodon Facebook X LinkedIn More