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.

中文翻译：

---

可逆计算和隐式计算复杂度

我们认为隐式计算复杂性理论和可逆计算之间存在联系。我们引入了固有的可逆编程语言，它捕获了复杂性类etime和

. 此外，我们讨论和分析了我们的可逆编程语言的高阶版本。