On the public citation graph

Proto-Quipper with Dynamic Lifting

https://doi.org/10.1145/3571204
0 signed · 36 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-030-52482-1_9openalex-snapshot
A Tutorial Introduction to Quantum Circuit Programming in Dependently Typed Proto-Quipper
inferredcites →https://doi.org/10.1007/978-3-642-38986-3_10openalex-snapshot
An Introduction to Quantum Programming in Quipper
inferredcites →https://doi.org/10.1007/bfb0022251openalex-snapshot
A mixed linear and non-linear logic: Proofs, terms and models
inferredcites →https://doi.org/10.1016/0890-5401(91)90052-4openalex-snapshot
Notions of computation and monads
inferredcites →https://doi.org/10.1016/s0304-3975(00)00053-0openalex-snapshot
MetaML and multi-stage programming with explicit annotations
inferredcites →https://doi.org/10.1017/cbo9781139193313openalex-snapshot
Semantic Techniques in Quantum Computation
inferredcites →https://doi.org/10.1017/s0960129504004256openalex-snapshot
Towards a quantum programming language
inferredcites →https://doi.org/10.1103/physreva.71.022316openalex-snapshot
Universal quantum computation with ideal Clifford gates and noisy ancillas
inferredcites →https://doi.org/10.1145/2499370.2462177openalex-snapshot
Quipper
inferredcites →https://doi.org/10.1145/3009837.3009894openalex-snapshot
QWIRE: a core language for quantum circuits
inferredcites →https://doi.org/10.1145/3209108.3209196openalex-snapshot
Enriching a Linear/Non-linear Lambda Calculus
inferredcites →https://doi.org/10.1145/3373718.3394765openalex-snapshot
Linear Dependent Type Theory for Quantum Programming Languages
inferredcites →https://doi.org/10.1145/3385412.3386007openalex-snapshot
Silq: a high-level quantum language with safe uncomputation and intuitive semantics
inferredcites →https://doi.org/10.1145/345099.345100openalex-snapshot
Local type inference
inferredcites →https://doi.org/10.23638/lmcs-16(1:30)2020openalex-snapshot
Classical Control, Quantum Circuits and Linear Logic in Enriched Category Theory
inferredcites →https://doi.org/10.26421/qic14.15-16-2openalex-snapshot
Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries
inferredcites →https://doi.org/10.4204/eptcs.266.11openalex-snapshot
A Categorical Model for a Quantum Circuit Description Language (Extended Abstract)
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2021.51openalex-snapshot
A Practical Quantum Instruction Set Architecture

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4250911openalex-extracted
Software Science View on Quantum Circuit Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8_1openalex-snapshot
Circuit Width Estimation via Effect Typing and Linear Dependency
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8_2openalex-snapshot
On the Hardness of Analyzing Quantum Programs Quantitatively
inferred← citeshttps://doi.org/10.1007/s40509-025-00368-5openalex-snapshot
The quantum monadology
inferred← citeshttps://doi.org/10.1109/jetcas.2022.3205174openalex-snapshot
Advances in Quantum Computation and Quantum Technologies: A Design Automation Perspective
inferred← citeshttps://doi.org/10.1109/tqe.2024.3501683openalex-snapshot
Grover's Oracle for the Shortest Vector Problem and Its Application in Hybrid Classical–Quantum Solvers
inferred← citeshttps://doi.org/10.1145/3624483openalex-snapshot
Formal Verification of Quantum Programs: Theory, Tools, and Challenges
inferred← citeshttps://doi.org/10.1145/3661814.3662091openalex-snapshot
The Relational Machine Calculus
inferred← citeshttps://doi.org/10.1145/3704883openalex-snapshot
Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages
inferred← citeshttps://doi.org/10.1145/3737282openalex-snapshot
Circuit Width Estimation via Effect Typing and Linear Dependency
inferred← citeshttps://doi.org/10.1145/3747521openalex-snapshot
A Haskell Adiabatic DSL: Solving Classical Optimization Problems on Quantum Hardware
inferred← citeshttps://doi.org/10.1145/3776731openalex-snapshot
Quantum Circuits Are Just a Phase
inferred← citeshttps://doi.org/10.1145/3801119.3801120openalex-snapshot
A Logical Foundation for Type-Safe Cross-Language Interoperability (Keynote)
inferred← citeshttps://doi.org/10.1145/3837062.3839078openalex-snapshot
Toward Declarative Platform-Independent Modeling of Hybrid Quantum--Classical Software
inferred← citeshttps://doi.org/10.4204/eptcs.394.16openalex-snapshot
A Biset-Enriched Categorical Model for Proto-Quipper with Dynamic Lifting
inferred← citeshttps://doi.org/10.4204/eptcs.426.1openalex-snapshot
Proto-Quipper with Reversing and Control
inferred← citeshttps://doi.org/10.46298/lmcs-18(3:28)2022openalex-snapshot
Linear Dependent Type Theory for Quantum Programming Languages
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.