A feasible and unitary quantum programming language
Fuente:
arXiv
Saved in:
| Main Authors: | Díaz-Caro, Alejandro, Hainry, Emmanuel, Péchoux, Romain, Silva, Mário |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A programming language characterizing quantum polynomial time
by: Hainry, Emmanuel, et al.
Published: (2022)
by: Hainry, Emmanuel, et al.
Published: (2022)
Quantum Programming in Polylogarithmic Time
by: Ferrari, Florent, et al.
Published: (2025)
by: Ferrari, Florent, et al.
Published: (2025)
Complete and tractable machine-independent characterizations of second-order polytime
by: Hainry, Emmanuel, et al.
Published: (2022)
by: Hainry, Emmanuel, et al.
Published: (2022)
A programming language combining quantum and classical control
by: Dave, Kinnari, et al.
Published: (2025)
by: Dave, Kinnari, et al.
Published: (2025)
Expectation-based Analysis of Higher-Order Quantum Programs
by: Avanzini, Martin, et al.
Published: (2025)
by: Avanzini, Martin, et al.
Published: (2025)
Branch Sequentialization in Quantum Polytime
by: Hainry, Emmanuel, et al.
Published: (2024)
by: Hainry, Emmanuel, et al.
Published: (2024)
Resource-Aware Quantum Programming with General Recursion and Quantum Control
by: Chardonnet, Kostia, et al.
Published: (2025)
by: Chardonnet, Kostia, et al.
Published: (2025)
Declassification Policy for Program Complexity Analysis
by: Hainry, Emmanuel, et al.
Published: (2024)
by: Hainry, Emmanuel, et al.
Published: (2024)
Extending Isabelle/HOL's Code Generator with support for the Go programming language
by: Stübinger, Terru, et al.
Published: (2023)
by: Stübinger, Terru, et al.
Published: (2023)
A denotationally-based program logic for higher-order store
by: Aagaard, Frederik Lerbjerg, et al.
Published: (2023)
by: Aagaard, Frederik Lerbjerg, et al.
Published: (2023)
Compositional theories for host-core languages
by: Trotta, Davide, et al.
Published: (2020)
by: Trotta, Davide, et al.
Published: (2020)
Checkpoint-based rollback recovery in session programming
by: Mezzina, Claudio Antares, et al.
Published: (2023)
by: Mezzina, Claudio Antares, et al.
Published: (2023)
Complete first-order reasoning for functional programs
by: Murali, Adithya, et al.
Published: (2026)
by: Murali, Adithya, et al.
Published: (2026)
DeLaM: A Dependent Layered Modal Type Theory for Meta-programming
by: Hu, Jason Z. S., et al.
Published: (2024)
by: Hu, Jason Z. S., et al.
Published: (2024)
S4 modal sequent calculus as intermediate logic and intermediate language
by: Caspar, Jean, et al.
Published: (2026)
by: Caspar, Jean, et al.
Published: (2026)
Typed compositional quantum computation with lenses
by: Garrigue, Jacques, et al.
Published: (2023)
by: Garrigue, Jacques, et al.
Published: (2023)
A linear proof language for second-order intuitionistic linear logic
by: Díaz-Caro, Alejandro, et al.
Published: (2023)
by: Díaz-Caro, Alejandro, et al.
Published: (2023)
Unfolding Iterators: Specification and Verification of Higher-Order Iterators, in OCaml
by: Chirica, Ion, et al.
Published: (2025)
by: Chirica, Ion, et al.
Published: (2025)
Probabilistic programming interfaces for random graphs: Markov categories, graphons, and nominal sets
by: Ackerman, Nathanael L., et al.
Published: (2023)
by: Ackerman, Nathanael L., et al.
Published: (2023)
Fair Asynchronous Session Subtyping
by: Bravetti, Mario, et al.
Published: (2021)
by: Bravetti, Mario, et al.
Published: (2021)
A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests
by: Kappé, Tobias, et al.
Published: (2023)
by: Kappé, Tobias, et al.
Published: (2023)
A Demonic Outcome Logic for Randomized Nondeterminism
by: Zilberstein, Noam, et al.
Published: (2024)
by: Zilberstein, Noam, et al.
Published: (2024)
Contextual Refinement of Higher-Order Concurrent Probabilistic Programs (Extended Version)
by: Li, Kwing Hei, et al.
Published: (2025)
by: Li, Kwing Hei, et al.
Published: (2025)
Quantum Control and General Recursion beyond the Unitary Case
by: Barsse, Kathleen, et al.
Published: (2025)
by: Barsse, Kathleen, et al.
Published: (2025)
Almost-Sure Termination by Guarded Refinement
by: Gregersen, Simon Oddershede, et al.
Published: (2024)
by: Gregersen, Simon Oddershede, et al.
Published: (2024)
Outcome Separation Logic: Local Reasoning for Correctness and Incorrectness with Computational Effects
by: Zilberstein, Noam, et al.
Published: (2023)
by: Zilberstein, Noam, et al.
Published: (2023)
A formal specification of the jq language
by: Färber, Michael
Published: (2024)
by: Färber, Michael
Published: (2024)
Denotational Semantics for Probabilistic and Concurrent Programs
by: Zilberstein, Noam, et al.
Published: (2025)
by: Zilberstein, Noam, et al.
Published: (2025)
Probabilistic Concurrent Reasoning in Outcome Logic: Independence, Conditioning, and Invariants
by: Zilberstein, Noam, et al.
Published: (2024)
by: Zilberstein, Noam, et al.
Published: (2024)
Modular Reasoning about Error Bounds for Concurrent Probabilistic Programs (Extended Version)
by: Li, Kwing Hei, et al.
Published: (2025)
by: Li, Kwing Hei, et al.
Published: (2025)
Approximate Relational Reasoning for Higher-Order Probabilistic Programs
by: Haselwarter, Philipp G., et al.
Published: (2024)
by: Haselwarter, Philipp G., et al.
Published: (2024)
Modular Verification of Differential Privacy in Probabilistic Higher-Order Separation Logic (Extended Version)
by: Haselwarter, Philipp G., et al.
Published: (2026)
by: Haselwarter, Philipp G., et al.
Published: (2026)
Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs
by: Aguirre, Alejandro, et al.
Published: (2024)
by: Aguirre, Alejandro, et al.
Published: (2024)
Tachis: Higher-Order Separation Logic with Credits for Expected Costs
by: Haselwarter, Philipp G., et al.
Published: (2024)
by: Haselwarter, Philipp G., et al.
Published: (2024)
Kleene algebra with commutativity conditions is undecidable
by: de Amorim, Arthur Azevedo, et al.
Published: (2024)
by: de Amorim, Arthur Azevedo, et al.
Published: (2024)
Outrunning Big KATs: Efficient Decision Procedures for Variants of GKAT
by: Zhang, Cheng, et al.
Published: (2026)
by: Zhang, Cheng, et al.
Published: (2026)
A concrete model for a typed linear algebraic lambda calculus
by: Díaz-Caro, Alejandro, et al.
Published: (2018)
by: Díaz-Caro, Alejandro, et al.
Published: (2018)
Syntactically and semantically regular languages of lambda-terms coincide through logical relations
by: Moreau, Vincent, et al.
Published: (2023)
by: Moreau, Vincent, et al.
Published: (2023)
A Probabilistic Choreography Language for PRISM
by: Carbone, Marco, et al.
Published: (2025)
by: Carbone, Marco, et al.
Published: (2025)
A Lazy, Concurrent Convertibility Checker
by: Courant, Nathanaëlle, et al.
Published: (2025)
by: Courant, Nathanaëlle, et al.
Published: (2025)
Similar Items
-
A programming language characterizing quantum polynomial time
by: Hainry, Emmanuel, et al.
Published: (2022) -
Quantum Programming in Polylogarithmic Time
by: Ferrari, Florent, et al.
Published: (2025) -
Complete and tractable machine-independent characterizations of second-order polytime
by: Hainry, Emmanuel, et al.
Published: (2022) -
A programming language combining quantum and classical control
by: Dave, Kinnari, et al.
Published: (2025) -
Expectation-based Analysis of Higher-Order Quantum Programs
by: Avanzini, Martin, et al.
Published: (2025)