From reversible programming languages to reversible metalanguages

Glück, Robert; Kaarsgaard, Robin; Yokoyama, T.

doi:10.1016/j.tcs.2022.02.024

Cited by 5 publications

(2 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is interesting since FinPInj is the setting for (finite) reversible classical computing (see e.g. [18,6,7]), in particular reversible (classical) flowcharts [32,5] (with a finite state space). This suggests that Contraction may be similarly considered as a setting for reversible quantum flowcharts, a kind of quantum flowcharts (see also [26]) which eschew measurements in favour of quantum control.…”

Section: Discussionmentioning

confidence: 99%

Universal Properties of Partial Quantum Maps

Andrés-Martínez,

Heunen,

Kaarsgaard

2023

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

We provide a universal construction of the category of finite-dimensional C*-algebras and completely positive trace-nonincreasing maps from the rig category of finite-dimensional Hilbert spaces and unitaries. This construction, which can be applied to any dagger rig category, is described in three steps, each associated with their own universal property, and draws on results from dilation theory in finite dimension. In this way, we explicitly construct the category that captures hybrid quantum/classical computation with possible nontermination from the category of its reversible foundations. We discuss how this construction can be used in the design and semantics of quantum programming languages.

show abstract

Section: Discussionmentioning

confidence: 99%

Universal Properties of Partial Quantum Maps

Andrés-Martínez,

Heunen,

Kaarsgaard

2023

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…One reason for putting recursive functions on a tail recursive form is for efficiency, as tail recursive programs can be easily compiled to iterative loopconstructs, eliminating the overhead of function calls. We sketch here how the transformed programs can be translated to a reversible loop-construct from flowchart languages [23] (see also [3,4]), which can be implemented in Janus [12,25] and later be compiled [2] to reversible abstract machines such as PISA [22] or BobISA [21].…”

Section: Translation To Flowchart Languagesmentioning

confidence: 99%

Tail recursion transformation for invertible functions

Kristensen¹,

Kaarsgaard²,

Thomsen³

2023

Preprint

View full text Add to dashboard Cite

Tail recursive functions allow for a wider range of optimisations than general recursive functions. For this reason, much research has gone into the transformation and optimisation of this family of functions, in particular those written in continuation passing style (CPS).Though the CPS transformation, capable of transforming any recursive function to an equivalent tail recursive one, is deeply problematic in the context of reversible programming (as it relies on troublesome features such as higher-order functions), we argue that relaxing (local) reversibility to (global) invertibility drastically improves the situation. On this basis, we present an algorithm for tail recursion conversion specifically for invertible functions. The key insight is that functions introduced by program transformations that preserve invertibility, need only be invertible in the context in which the functions subject of transformation calls them. We show how a bespoke data type, corresponding to such a context, can be used to transform invertible recursive functions into a pair of tail recursive function acting on this context, in a way where calls are highlighted, and from which a tail recursive inverse can be straightforwardly extracted.

show abstract