Results 1  10
of
17
A functional quantum programming language
 In: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
, 2005
"... This thesis introduces the language QML, a functional language for quantum computations on finite types. QML exhibits quantum data and control structures, and integrates reversible and irreversible quantum computations. The design of QML is guided by the categorical semantics: QML programs are inte ..."
Abstract

Cited by 46 (12 self)
 Add to MetaCart
This thesis introduces the language QML, a functional language for quantum computations on finite types. QML exhibits quantum data and control structures, and integrates reversible and irreversible quantum computations. The design of QML is guided by the categorical semantics: QML programs are interpreted by morphisms in the category FQC of finite quantum computations, which provides a constructive operational semantics of irreversible quantum computations, realisable as quantum circuits. The quantum circuit model is also given a formal categorical definition via the category FQC. QML integrates reversible and irreversible quantum computations in one language, using first order strict linear logic to make weakenings, which may lead to the collapse of the quantum wavefunction, explicit. Strict programs are free from measurement, and hence preserve superpositions and entanglement. A denotational semantics of QML programs is presented, which maps QML terms
Geometry of Synthesis  A structured approach . . .
, 2007
"... We propose a new technique for hardware synthesis from higherorder functional languages with imperative features based on Reynolds’s Syntactic Control of Interference. The restriction on contraction in the type system is useful for managing the thorny issue of sharing of physical circuits. We use a ..."
Abstract

Cited by 16 (8 self)
 Add to MetaCart
We propose a new technique for hardware synthesis from higherorder functional languages with imperative features based on Reynolds’s Syntactic Control of Interference. The restriction on contraction in the type system is useful for managing the thorny issue of sharing of physical circuits. We use a semantic model inspired by game semantics and the geometry of interaction, and express it directly as a certain class of digital circuits that form a
Reversing algebraic process calculi
 in: FOSSACS’06, LNCS 3921 (2006
, 2006
"... Abstract. Reversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languages for quantum computing. We formulate a procedure for converting operators of standard algebraic process calc ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
Abstract. Reversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languages for quantum computing. We formulate a procedure for converting operators of standard algebraic process calculi such as CCS, ACP and CSP into reversible operators, while preserving their operational semantics. 1
The Effects of
 Artificial Sources of Water on Rangeland Biodiversity. Environment Australia and CSIRO
, 1997
"... “Turing hoped that his abstractedpapertape model was so simple, so transparent and well defined, that it would not depend on any assumptions about physics that could conceivably be falsified, and therefore that it could become the basis of an abstract theory of computation that was independent of ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
“Turing hoped that his abstractedpapertape model was so simple, so transparent and well defined, that it would not depend on any assumptions about physics that could conceivably be falsified, and therefore that it could become the basis of an abstract theory of computation that was independent of the underlying physics. ‘He thought, ’ as Feynman once put it, ‘that he understood paper. ’ But he was mistaken. Real, quantummechanical paper is wildly different from the abstract stuff that the Turing machine uses. The Turing machine is entirely classical...”
Fully Complete Minimal PER Models for the Simply Typed λcalculus
 CSL'01, LNCS 2142
, 2001
"... We show how to build a fully complete model for the maximal theory of the simply typed λcalculus with k ground constants, k. This is obtained by linear realizability over an affine combinatory algebra of partial involutions from natural numbers into natural numbers. For simplicitly, we give the det ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We show how to build a fully complete model for the maximal theory of the simply typed λcalculus with k ground constants, k. This is obtained by linear realizability over an affine combinatory algebra of partial involutions from natural numbers into natural numbers. For simplicitly, we give the details of the construction of a fully complete model for k extended with ground permutations. The fully complete minimal model for k can be obtained by carrying out the previous construction over a suitable subalgebra of partial involutions. The full completeness result is then put to use in order to prove some simple results on the maximal theory.
From reversible to irreversible computations
 Proceedings of the 4th International Workshop on Quantum Programming Languages, Electronic Notes in Theoretical Computer Science. Elsevier Science
, 2006
"... ..."
Linear realizability and full completeness for typed lambda calculi
 Annals of Pure and Applied Logic
, 2005
"... We present the model construction technique called Linear Realizability. It consists in building a category of Partial Equivalence Relations over a Linear Combinatory Algebra. We illustrate how it can be used to provide models, which are fully complete for various typed λcalculi. In particular, we ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We present the model construction technique called Linear Realizability. It consists in building a category of Partial Equivalence Relations over a Linear Combinatory Algebra. We illustrate how it can be used to provide models, which are fully complete for various typed λcalculi. In particular, we focus on special Linear Combinatory Algebras of partial involutions, and we present PER models over them which are fully complete, inter alia, w.r.t. the following languages and theories: the fragment of System F consisting of MLtypes, the maximal theory on the simply typed λcalculus with finitely many ground constants, and the maximal theory on an infinitary version of this latter calculus. Key words: Typed lambdacalculi, MLpolymorphic types, linear logic, hyperdoctrines, PER models, Geometry of Interaction, (axiomatic) full completeness
Bidirectional Programming Languages
, 2010
"... The need to edit data through a view arises in a host of applications across many different areas of computing. Unfortunately, few existing systems provide support for updatable views. In practice, when they are needed, updatable views are usually implemented using two separate programs: one to comp ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The need to edit data through a view arises in a host of applications across many different areas of computing. Unfortunately, few existing systems provide support for updatable views. In practice, when they are needed, updatable views are usually implemented using two separate programs: one to compute the view from the source and another to handle updates. This rudimentary design is tedious for programmers, difficult to reason about, and a nightmare to maintain. This dissertation describes bidirectional programming languages, which provide an elegant mechanism for describing updatable views. Unlike programs written in an ordinary language, which only work in one direction, programs written in a bidirectional language can be run both forwards and backwards: from left to right, they describe functions that map sources to views, and from right to left, they describe functions that map updated views back to updated sources. Besides eliminating redundancy, these languages can be designed to ensure correctness, guaranteeing by construction that the two functions work well together. Starting from
Operational semantics of reversibility in process algebra
 Workshop on Algebraic Process Calculi: The First Twenty Five Years and Beyond (PA ’05), number NS053 in BRICS Notes Series
, 2005
"... Reversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languages for quantum computing. We discuss reversibility in major process algebras from the point of view of operational seman ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Reversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languages for quantum computing. We discuss reversibility in major process algebras from the point of view of operational semantics. The main difficulty seems to be with the definitions of forward and reverse computation for the dynamic operators, and we confine ourselves to these, leaving the static operators for further work. We consider a solution where predicates in SOS rules play a vital role. Key words: Reversible computation, process calculi, SOS rules 1