Publication View

QPL 2005 Preliminary Version An Algebra of Pure Quantum Programming Abstract (2008)

Abstract
We develop a sound and complete equational theory for the functional quantum programming language QML. The soundness and completeness of the theory are with respect to the previously developed denotational semantics of QML. The completeness proof also gives rise to a normalisation algorithm following the normalisationby-evaluation approach. The current work focuses on the pure fragment of QML, omitting measurements. Key words: denotational semantics, completeness, normalisation 1

Publication details
Download http://citeseerx.ist.psu.edu/viewdoc/summary?doi=?doi=10.1.1.117.8785
Source http://www.cs.nott.ac.uk/~txa/publ/qpl05.pdf
Contributors CiteSeerX
Repository CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Type text
Language English
Relation 10.1.1.120.4952, 10.1.1.108.6350, 10.1.1.118.8751