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 Image 1. Furthermore, we discuss and analyze higher-order versions of our reversible programming languages
Implicit computational complexity, which aims at characterizing complexity classes by machine-indepe...
none1noReverse Complexity is a long term research program aiming at discovering the abstract, logica...
AbstractReversibility is a key issue in the interface between computation and physics, and of growin...
We argue that there is a link between implicit computational complexity theory and the theory of rev...
Reversible computing is a paradigm where computing models are defined so that they reflect physical ...
AbstractReversible computing is a paradigm where computing models are defined so that they reflect p...
AbstractWe provide machine-independent characterizations of some complexity classes, over an arbitra...
International audiencePolynomial interpretations and their generalizations like quasi-interpretation...
Implicit computational complexity (ICC) studies machine-independent approaches to computational comp...
We provide machine-independent characterizations of some complexity classes, over an arbitrary struc...
A computable economist's view of the world of computational complexity theory is described. This mea...
During the last decade Cook, Bellantoni, Leivant and others have developed the theory of implicit co...
Polynomial interpretations and their generalizations like quasi-interpretations have been used in th...
International audienceImplicit Computational Complexity makes two aspects implicit, by manipulating ...
We extend categorical semantics of monadic programming to reversible computing, by considering monoi...
Implicit computational complexity, which aims at characterizing complexity classes by machine-indepe...
none1noReverse Complexity is a long term research program aiming at discovering the abstract, logica...
AbstractReversibility is a key issue in the interface between computation and physics, and of growin...
We argue that there is a link between implicit computational complexity theory and the theory of rev...
Reversible computing is a paradigm where computing models are defined so that they reflect physical ...
AbstractReversible computing is a paradigm where computing models are defined so that they reflect p...
AbstractWe provide machine-independent characterizations of some complexity classes, over an arbitra...
International audiencePolynomial interpretations and their generalizations like quasi-interpretation...
Implicit computational complexity (ICC) studies machine-independent approaches to computational comp...
We provide machine-independent characterizations of some complexity classes, over an arbitrary struc...
A computable economist's view of the world of computational complexity theory is described. This mea...
During the last decade Cook, Bellantoni, Leivant and others have developed the theory of implicit co...
Polynomial interpretations and their generalizations like quasi-interpretations have been used in th...
International audienceImplicit Computational Complexity makes two aspects implicit, by manipulating ...
We extend categorical semantics of monadic programming to reversible computing, by considering monoi...
Implicit computational complexity, which aims at characterizing complexity classes by machine-indepe...
none1noReverse Complexity is a long term research program aiming at discovering the abstract, logica...
AbstractReversibility is a key issue in the interface between computation and physics, and of growin...
DOI
Add to ORKG