Reversible computing and implicit computational complexity
Lars Bjørlykke Kristiansen · Science of Computer Programming · 2021
We argue that there is a link between implicit computational complexity theory and reversible computation. We introduce inherently reversible programming languages which capture the complexity classes etime and . Furthermore, we discuss and analyze higher-order versions of our reversible programming languages.