Formal Semantics of a Classical-Quantum Language

07/02/2021
by   Yuxin Deng, et al.
0

We investigate the formal semantics of a simple imperative language that has both classical and quantum constructs. More specifically, we provide an operational semantics, a denotational semantics and two Hoare-style proof systems: an abstract one and a concrete one. The two proof systems are satisfaction-based, as inspired by the program logics of Barthe et al for probabilistic programs. The abstract proof system turns out to be sound and relatively complete, while the concrete one is sound only.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/06/2021

Concrete Categorical Model of a Quantum Circuit Description Language with Measurement

In this paper, we introduce dynamic lifting to a quantum circuit-descrip...
research
09/11/2022

Formal Semantics of the Kconfig Language

The Kconfig language defines a set of symbols that are assigned a value ...
research
02/16/2022

Mechanization of LAGC Semantics in Isabelle

Formal programming language semantics are imperative when trying to veri...
research
08/20/2018

Concrete Semantics with Coq and CoqHammer

The "Concrete Semantics" book gives an introduction to imperative progra...
research
03/19/2020

Abstraction, Up-to Techniques and Games for Systems of Fixpoint Equations

Systems of fixpoint equations over complete lattices, consisting of (mix...
research
09/25/2018

Skeletal Semantics and their Interpretations

Many meta-languages have been proposed for writing rule-based operationa...
research
10/27/2020

Abstracting Gradual Typing Moving Forward: Precise and Space-Efficient (Technical Report)

Abstracting Gradual Typing (AGT) is a systematic approach to designing g...

Please sign up or login with your details

Forgot password? Click here to reset