Semantics of quantum programming languages: Classical control, quantum control
From MaRDI portal
Publication:2168785
DOI10.1016/j.jlamp.2022.100790OpenAlexW4285498936WikidataQ114159202 ScholiaQ114159202MaRDI QIDQ2168785
Publication date: 26 August 2022
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2022.100790
Cites Work
- Probabilistic coherence spaces as a model of higher-order probabilistic computation
- Linear logic
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Dcpo-completion of posets
- The system \({\mathcal F}\) of variable types, fifteen years later
- Normal functors, power series and \(\lambda\)-calculus
- Completely positive linear maps on complex matrices
- Coherent Banach spaces: A continuous denotational semantics
- From symmetric pattern-matching to quantum control
- Quantum programming with inductive datatypes: causality and affine type theory
- Nondeterministic extensions of untyped \(\lambda\)-calculus
- On Quantum and Probabilistic Linear Lambda-calculi (Extended Abstract)
- Dagger Compact Closed Categories and Completely Positive Maps
- On a Fully Abstract Model for a Quantum Linear Functional Language
- Around the Physical Church-Turing Thesis: Cellular Automata, Formal Languages, and the Principles of Quantum Theory
- Probabilistic operational semantics for the lambda calculus
- Quantum coherent spaces and linear logic
- Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
- A Natural Axiomatization of Computability and Proof of Church's Thesis
- An Explicit Formula for the Free Exponential Modality of Linear Logic
- The algebraic lambda calculus
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Thunks and the λ-calculus
- A Lambda Calculus for Quantum Computation
- A Theory of Positive Integers in Formal Logic. Part II
- A Theory of Positive Integers in Formal Logic. Part I
- Continuous Lattices and Domains
- On Köthe sequence spaces and linear logic
- Towards a quantum programming language
- Hopf algebras and linear logic
- THE PHYSICAL CHURCH-TURING THESIS AND THE PRINCIPLES OF QUANTUM THEORY
- Theoretical framework for quantum networks
- Presheaf Models of Quantum Computation: An Outline
- Quantum Programs as Kleisli Maps
- Linear Dependent Type Theory for Quantum Programming Languages
- Enriching a Linear/Non-linear Lambda Calculus
- Weighted Relational Models of Typed Lambda-Calculi
- A single quantum cannot be cloned
- Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
- Probabilistic coherence spaces are fully abstract for probabilistic PCF
- Applying quantitative semantics to higher-order quantum computing
- A lambda calculus for quantum computation with classical control
- Finiteness spaces
- Systems of Logic Based on Ordinals†
- Holomorphic models of exponential types in linear logic
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Semantics of quantum programming languages: Classical control, quantum control
