ACM Transactions on Computational Logic (TOCL)
A New Characterization of Lambda Definability
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Towards a quantum programming language
Mathematical Structures in Computer Science
On a Fully Abstract Model for a Quantum Linear Functional Language
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
In this paper we give a fully complete model for a linear probabilistic lambda-calculus. The model is a Kripke semantics based on the category of stochastic relations. We sketch how this relates to quantum computation.