activity
20102024
most citedInteractive Learning-Based Realizability for Heyting Arithmetic with EM1

43 citations · 72 across the 14 of their papers we have counts for

collaborators
Showing 2024Show all

1 paper · 1 filter

cs.LO2024

Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem

Adriano Barile, Stefano Berardi, Luca Roversi

Reversible Boolean Circuits are an interesting computational model under many aspects and in different fields, ranging from Reversible Computing to Quantum Computing. Our contribut…