7 citations · 28 across the 17 of their papers we have counts for
18 papers
Certifying algorithms and relevant properties of Reversible Primitive Permutations with Lean
Giacomo Maletto, Luca Roversi
Reversible Primitive Permutations (RPP) are recursively defined functions designed to model Reversible Computation. We illustrate a proof, fully developed with the proof-assistant…
Splitting recursion schemes into reversible and classical interacting threads
Armando B. Matos, Luca Paolini, Luca Roversi
Given a simple recursive function, we show how to extract from it a reversible and an classical iterative part. Those parts can synchronously cooperate under a Producer/Consumer pa…
Interleaving classical and reversible
Armando B. Matos, Luca Paolini, Luca Roversi
Given a simple recursive function, we show how to extract two interacting processes from it. The two processes can be described by means of iterative programs, one of which is intr…
Probabilistic Soft Type Assignment
Gianluca Curzi, Luca Roversi
We model randomized complexity classes in the style of Implicit Computational Complexity. We introduce PSTA, a probabilistic version of STA, the type-theoretical counterpart of Sof…
A type-assignment of linear erasure and duplication
Gianluca Curzi, Luca Roversi
We introduce , a type-assignment system for the linear -calculus that extends second-order , i.e., intuitionistic multiplicative Linear Logic, by…
Introducing Yet Another REversible Language
Claudio Grandi, Dariush Moshiri, Luca Roversi
Yarel is a core reversible programming language that implements a class of permutations, defined recursively, which are primitive recursive complete. The current release of Yarel s…