Generating reversible circuits from higher-order functional programs

Benoît Valiron (1, 2)

1 MODHEL - LRI - Modélisation hétérogène (LRI)
2 CentraleSupélec

Boolean reversible circuits are boolean circuits made of reversible elementary gates. Despite their constrained form, they can simulate any boolean function. The synthesis and validation of a reversible circuit simulating a given function is a difficult problem. In 1985, Bennett proposed to generate reversible circuits from traces of execution of Turing machines. In this paper, we propose a novel presentation of this approach, adapted to higher-order programs. Starting with a PCF-like language, we use a monadic representation of the trace of execution to turn a regular boolean program into a circuit-generating code. We show that a circuit traced out of a program computes the same boolean function as the original program.

Domaines: Logique en informatique [cs.LO]; Informatique et langage [cs.CL]; Physique Quantique [quant-ph]

Benoît Valiron. Generating reversible circuits from higher-order functional programs. 8th International Conference on Reversible Computation (RC 2016), Jul 2016, Bologne, Italy. pp.289-306, ⟨10.1007/978-3-319-40578-0_21⟩. ⟨hal-01474621⟩