We argue that there is a link between implicit computational complexity theory and the theory of reversible computation. We show that the complexity classes ETIME and P can be captured by inherently reversible programming languages
this paper a series of languages adequate for expressing exactly those properties checkable in a ser...
. Structural complexity theory is one of the branches of computer science. In this survey we will s...
We establish a close connection between a reversible programming language based on type isomorphisms...
We argue that there is a link between implicit computational complexity theory and reversible comput...
none1noReverse Complexity is a long term research program aiming at discovering the abstract, logica...
We study in this paper the cost of making a concurrent programming language reversible. More specifi...
We study in this paper the cost of making a concurrent programming language reversible. More specifi...
Reversible computing is a paradigm where computing models are defined so that they reflect physical ...
We define a complexity class $\mathsf{IB}$ as the class of functional problems reducible to computin...
We investigate an imperative and a functional programming language. The computational power of fragm...
Implicit computational complexity (ICC) studies machine-independent approaches to computational comp...
International audienceImplicit Computational Complexity makes two aspects implicit, by manipulating ...
In this note we propose a model for unbounded nondeterministic computation which provides a very nat...
Abstract. We consider a language which allows bounded non-determinism, stand-alone guarded commands ...
AbstractReversible computing is a paradigm where computing models are defined so that they reflect p...
this paper a series of languages adequate for expressing exactly those properties checkable in a ser...
. Structural complexity theory is one of the branches of computer science. In this survey we will s...
We establish a close connection between a reversible programming language based on type isomorphisms...
We argue that there is a link between implicit computational complexity theory and reversible comput...
none1noReverse Complexity is a long term research program aiming at discovering the abstract, logica...
We study in this paper the cost of making a concurrent programming language reversible. More specifi...
We study in this paper the cost of making a concurrent programming language reversible. More specifi...
Reversible computing is a paradigm where computing models are defined so that they reflect physical ...
We define a complexity class $\mathsf{IB}$ as the class of functional problems reducible to computin...
We investigate an imperative and a functional programming language. The computational power of fragm...
Implicit computational complexity (ICC) studies machine-independent approaches to computational comp...
International audienceImplicit Computational Complexity makes two aspects implicit, by manipulating ...
In this note we propose a model for unbounded nondeterministic computation which provides a very nat...
Abstract. We consider a language which allows bounded non-determinism, stand-alone guarded commands ...
AbstractReversible computing is a paradigm where computing models are defined so that they reflect p...
this paper a series of languages adequate for expressing exactly those properties checkable in a ser...
. Structural complexity theory is one of the branches of computer science. In this survey we will s...
We establish a close connection between a reversible programming language based on type isomorphisms...
DOI
Add to ORKG