Sciweavers

36 search results - page 2 / 8
» A Lambda Calculus for Quantum Computation with Classical Con...
Sort
View
ENTCS
2006
136views more  ENTCS 2006»
13 years 5 months ago
Classically-controlled Quantum Computation
It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-control...
Simon Perdrix, Philippe Jorrand
FCT
2005
Springer
13 years 11 months ago
A Self-dependency Constraint in the Simply Typed Lambda Calculus
We consider terms of simply typed lambda calculus in which copy of a subterm may not be inserted to the argument of itself during the reduction. The terms form wide class which inc...
Aleksy Schubert
CCA
2005
Springer
13 years 11 months ago
A Lambda Calculus for Real Analysis
Abstract Stone Duality is a revolutionary theory that works directly with computable continuous functions, without using set theory, infinitary lattice theory or a prior theory o...
Paul Taylor 0002
ICFP
2010
ACM
13 years 5 months ago
Lolliproc: to concurrency from classical linear logic via curry-howard and control
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
Karl Mazurak, Steve Zdancewic
ENTCS
2007
174views more  ENTCS 2007»
13 years 5 months ago
Quantum Patterns and Types for Entanglement and Separability
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
Simon Perdrix