Handbook of logic in computer science (vol. 2)
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Quantum computation and quantum information
Quantum computation and quantum information
The Definition of Standard ML
Information flow inference for ML
ACM Transactions on Programming Languages and Systems (TOPLAS)
Operational Semantics and Program Equivalence
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
A Fully Abstract Game Semantics for General References
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
A Static Calculus of Dependencies for the -Cube
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A Lambda Calculus for Quantum Computation
SIAM Journal on Computing
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
A Functional Quantum Programming Language
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
A logical analysis of aliasing in imperative higher-order functions
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
A lambda calculus for quantum computation with classical control
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Reasoning about Entanglement and Separability in Quantum Higher-Order Functions
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Measurements and Confluence in Quantum Lambda Calculi With Explicit Qubits
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We propose an extension of the traditional Λ-calculus in which terms are used to control an outside computing device (quantum computer, DNA computer...). We introduce two new binders: v and ρ. In v x.M, x denotes an abstract resource of the outside computing device, whereas in ρx.M, x denotes a concrete resource. These two binders have different properties (in terms of a-conversion, scope extrusion, convertibility) than the ones of standard Λ-binder. We illustrate the potential benefits of our approach with a study of a quantum computing language in which these new binders prove meaningful. We introduce a typing system for this quantum computing framework in which linearity is only required for concrete quantum bits offering a greater expressiveness than previous propositions.