The categorical semantics of reversible computing must be a category which combines the concepts of partiality and the ability to reverse any map in the category. Inverse cate-gories, restriction categories in which each map is a partial isomorphism, provide exactly this structure. This thesis explores inverse categories and relates them to both quantum computing and standard non-reversible computing. The former is achieved by showing tha
The first and the second author introduced reversible ccs (rccs) in order to model concurrent comput...
International audienceIn this paper, we present a linear and reversible language with inductive and ...
This dissertation has two main parts. The first part deals with questions relating to Haghverdi and ...
The lambda-calculus is destructive: its main computational mechanism, beta reduction, destroys the r...
AbstractThe λ-calculus is destructive: its main computational mechanism – beta reduction – destroys ...
Written by one of the few top internationally recognized experts in the field, this book concentrate...
We extend categorical semantics of monadic programming to reversible computing, by considering monoi...
Reversible logic circuits of certain logic width form a group, isomorphic to a symmetric group. Its ...
The Pi family of reversible programming languages for boolean circuits is presented as a syntax of c...
Reversible computing is a paradigm where computing models are defined so that they reflect physical ...
Reversible logic circuits are beneficial to both classical and quantum computer design. Present-day ...
AbstractReversible computing is a paradigm where computing models are defined so that they reflect p...
Reversible computation allows computation to proceed not only in the standard, forward direction, bu...
Reversible computation allows computation to proceed not only in the standard, forward direction, bu...
International audienceIn this paper, we present a linear and reversible language with inductive and ...
The first and the second author introduced reversible ccs (rccs) in order to model concurrent comput...
International audienceIn this paper, we present a linear and reversible language with inductive and ...
This dissertation has two main parts. The first part deals with questions relating to Haghverdi and ...
The lambda-calculus is destructive: its main computational mechanism, beta reduction, destroys the r...
AbstractThe λ-calculus is destructive: its main computational mechanism – beta reduction – destroys ...
Written by one of the few top internationally recognized experts in the field, this book concentrate...
We extend categorical semantics of monadic programming to reversible computing, by considering monoi...
Reversible logic circuits of certain logic width form a group, isomorphic to a symmetric group. Its ...
The Pi family of reversible programming languages for boolean circuits is presented as a syntax of c...
Reversible computing is a paradigm where computing models are defined so that they reflect physical ...
Reversible logic circuits are beneficial to both classical and quantum computer design. Present-day ...
AbstractReversible computing is a paradigm where computing models are defined so that they reflect p...
Reversible computation allows computation to proceed not only in the standard, forward direction, bu...
Reversible computation allows computation to proceed not only in the standard, forward direction, bu...
International audienceIn this paper, we present a linear and reversible language with inductive and ...
The first and the second author introduced reversible ccs (rccs) in order to model concurrent comput...
International audienceIn this paper, we present a linear and reversible language with inductive and ...
This dissertation has two main parts. The first part deals with questions relating to Haghverdi and ...