Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
DOI10.1007/978-3-540-70590-1_2zbMATH Open1146.68027OpenAlexW2114421037MaRDI QIDQ3522006FDOQ3522006
Authors: Pablo Arrighi, Gilles Dowek 
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
Recommendations
Quantum computation (81P68) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18)
Cites Work
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- A single quantum cannot be cloned
- Quantum computation by measurement and quantum memory
- A new universal and fault-tolerant quantum basis
- Towards a quantum programming language
- A lambda calculus for quantum computation with classical control
- Linear logic
- Rapid solution of problems by quantum computation
- The differential lambda-calculus
- On theories with a combinatorial definition of 'equivalence'
- Complete Sets of Reductions for Some Equational Theories
- A Lambda Calculus for Quantum Computation
- Lambda-calculi for (strict) parallel functions
- Adding algebraic rewriting to the untyped lambda calculus
- A computational definition of the notion of vectorial space
- An algebra of pure quantum programming
- Title not available (Why is that?)
- Probabilistic -calculus and Quantitative Program Analysis
- Completion of a Set of Rules Modulo a Set of Equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Linear Combinations of λ-Terms
- The one-way quantum computer--a non-network model of quantum computation
- Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
Cited In (20)
- Title not available (Why is that?)
- On Linear Combinations of λ-Terms
- QPCF: higher-order languages and quantum circuits
- Title not available (Why is that?)
- Confluence results for a quantum lambda calculus with measurements
- Semantics of quantum programming languages: Classical control, quantum control
- On a measurement-free quantum lambda calculus with classical control
- Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
- Call-by-value, call-by-name and the vectorial behaviour of the algebraic \(\lambda \)-calculus
- Call-by-value non-determinism in a linear logic type discipline
- Extensional proofs in a propositional logic modulo isomorphisms
- Title not available (Why is that?)
- Scalar System F for linear-algebraic \(\lambda\)-calculus: towards a quantum physical logic
- A quick overview on the quantum control approach to the lambda calculus
- Quantum Control in the Unitary Sphere: Lambda-S1 and its Categorical Model
- A typed, algebraic, computational lambda-calculus
- Title not available (Why is that?)
- \textsc{qPCF}: a language for quantum circuit computations
- Measurements and confluence in quantum lambda calculi with explicit qubits
- Algeo: an algebraic approach to reversibility
This page was built for publication: Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522006)
