Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
From MaRDI portal
Publication:3522006
DOI10.1007/978-3-540-70590-1_2zbMath1146.68027OpenAlexW2114421037MaRDI QIDQ3522006
Publication date: 28 August 2008
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70590-1_2
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (17)
Unnamed Item ⋮ Quantum Control in the Unitary Sphere: Lambda-S1 and its Categorical Model ⋮ Call-by-Value Non-determinism in a Linear Logic Type Discipline ⋮ Unnamed Item ⋮ Semantics of quantum programming languages: Classical control, quantum control ⋮ Extensional proofs in a propositional logic modulo isomorphisms ⋮ Linear-algebraic λ-calculus: higher-order, encodings, and confluence. ⋮ Unnamed Item ⋮ $$\mathsf {qPCF}$$ : A Language for Quantum Circuit Computations ⋮ A typed, algebraic, computational lambda-calculus ⋮ Unnamed Item ⋮ On a measurement-free quantum lambda calculus with classical control ⋮ Measurements and Confluence in Quantum Lambda Calculi With Explicit Qubits ⋮ Scalar System F for Linear-Algebraic λ-Calculus: Towards a Quantum Physical Logic ⋮ Confluence Results for a Quantum Lambda Calculus with Measurements ⋮ QPCF: higher-order languages and quantum circuits ⋮ Algeo: an algebraic approach to reversibility
Cites Work
- A new universal and fault-tolerant quantum basis
- Linear logic
- Adding algebraic rewriting to the untyped lambda calculus
- Lambda-calculi for (strict) parallel functions
- Quantum computation by measurement and quantum memory
- The differential lambda-calculus
- On theories with a combinatorial definition of 'equivalence'
- An Algebra of Pure Quantum Programming
- Probabilistic -calculus and Quantitative Program Analysis
- Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
- Completion of a Set of Rules Modulo a Set of Equations
- Complete Sets of Reductions for Some Equational Theories
- Rapid solution of problems by quantum computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- The one-way quantum computer--a non-network model of quantum computation
- A Lambda Calculus for Quantum Computation
- Towards a quantum programming language
- A single quantum cannot be cloned
- On Linear Combinations of λ-Terms
- A lambda calculus for quantum computation with classical control
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Linear-algebraic λ-calculus: higher-order, encodings, and confluence.