Categorical Semantics of Reversible Pattern-Matching

A Curry-Howard Correspondence for Linear, Reversible Computation

“…The Curry-Howard correspondence formalizes the fact that the proof s of A → B can be regarded as a function -parametrized by an argument Reversible computation is a paradigm of computation which emerged as an energy-preserving model of computation in which data is never erased [8] that makes sure that, given some process f , there always exists an inverse process f −1 such that f • f −1 = Id = f −1 • f . Many aspects of reversible computation have been considered, such as the development of reversible Turing Machines [16], reversible programming languages [11] and their semantics [6,13]. However, the formal relationship between a logical system and a computational model have not been developed yet.…”