A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
In this paper, we present a linear and reversible language with inductive and coinductive types, together with a Curry-Howard correspondence with the logic : linear logic extended with least and greatest fixed points allowing inductive and coinductive statements. Linear, reversible computation makes an important sub-class of quantum computation without measurement. In the latter, the notion of purely quantum recursive type is not yet well understood. Moreover, models for reasoning about quantumdoi:10.1007/978-3-030-52482-1_8 fatcat:t6un5bqp4zhtbpwcdr2c5orqxu