Cover Image

A programming language characterizing quantum polynomial time

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hainry, Emmanuel, Péchoux, Romain, Silva, Mário
Format:	Preprint
Published:	2022
Subjects:	Logic in Computer Science Programming Languages
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A feasible and unitary quantum programming language
by: Díaz-Caro, Alejandro, et al.
Published: (2023)

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)

Branch Sequentialization in Quantum Polytime
by: Hainry, Emmanuel, et al.
Published: (2024)

Resource-Aware Quantum Programming with General Recursion and Quantum Control
by: Chardonnet, Kostia, et al.
Published: (2025)

Expectation-based Analysis of Higher-Order Quantum Programs
by: Avanzini, Martin, et al.
Published: (2025)

Declassification Policy for Program Complexity Analysis
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)

A denotationally-based program logic for higher-order store
by: Aagaard, Frederik Lerbjerg, et al.
Published: (2023)

Compositional theories for host-core languages
by: Trotta, Davide, et al.
Published: (2020)

Complete first-order reasoning for functional programs
by: Murali, Adithya, et al.
Published: (2026)

Checkpoint-based rollback recovery in session programming
by: Mezzina, Claudio Antares, et al.
Published: (2023)

DeLaM: A Dependent Layered Modal Type Theory for Meta-programming
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)

Typed compositional quantum computation with lenses
by: Garrigue, Jacques, et al.
Published: (2023)

Unfolding Iterators: Specification and Verification of Higher-Order Iterators, in OCaml
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)

Fair Asynchronous Session Subtyping
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)

A Demonic Outcome Logic for Randomized Nondeterminism
by: Zilberstein, Noam, et al.
Published: (2024)

Quantum Control and General Recursion beyond the Unitary Case
by: Barsse, Kathleen, et al.
Published: (2025)

A formal specification of the jq language
by: Färber, Michael
Published: (2024)

Denotational Semantics for Probabilistic and Concurrent Programs
by: Zilberstein, Noam, et al.
Published: (2025)

Outcome Separation Logic: Local Reasoning for Correctness and Incorrectness with Computational Effects
by: Zilberstein, Noam, et al.
Published: (2023)

Probabilistic Concurrent Reasoning in Outcome Logic: Independence, Conditioning, and Invariants
by: Zilberstein, Noam, et al.
Published: (2024)

Kleene algebra with commutativity conditions is undecidable
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)

Syntactically and semantically regular languages of lambda-terms coincide through logical relations
by: Moreau, Vincent, et al.
Published: (2023)

A Probabilistic Choreography Language for PRISM
by: Carbone, Marco, et al.
Published: (2025)

A Lazy, Concurrent Convertibility Checker
by: Courant, Nathanaëlle, et al.
Published: (2025)

A Nominal Approach to Probabilistic Separation Logic
by: Li, John M., et al.
Published: (2024)

A Program Logic for Abstract (Hyper)Properties
by: Baldan, Paolo, et al.
Published: (2026)

A formalization of System I with type Top in Agda
by: Séttimo, Agustín, et al.
Published: (2026)

PolyQEnt: A Polynomial Quantified Entailment Solver
by: Chatterjee, Krishnendu, et al.
Published: (2024)

A Formal Semantics of the GraalVM Intermediate Representation
by: Webb, Brae J., et al.
Published: (2021)

A Coq Library of Sets for Teaching Denotational Semantics
by: Cao, Qinxiang, et al.
Published: (2024)

A Formally Verified Procedure for Width Inference in FIRRTL
by: Wang, Keyin, et al.
Published: (2026)

A beginner guide to Iris, Coq and separation logic
by: Dietrich, Elizabeth
Published: (2021)

A uniform characterisation of the (a)synchronous must-preorder
by: Bernardi, Giovanni, et al.
Published: (2026)