A linear-non-linear model for a computational call-by-value lambda calculus (extended abstract)

@article{Selinger2008ALM,
  title={A linear-non-linear model for a computational call-by-value lambda calculus (extended abstract)},
  author={P. Selinger and B. Valiron},
  journal={ArXiv},
  year={2008},
  volume={abs/0801.0813}
}
  • P. Selinger, B. Valiron
  • Published 2008
  • Computer Science, Mathematics
  • ArXiv
  • We give a categorical semantics for a call-by-value linear lambda calculus. Such a lambda calculus was used by Selinger and Valiron as the backbone of a functional programming language for quantum computation. One feature of this lambda calculus is its linear type system, which includes a duplicability operator “!” as in linear logic. Another main feature is its call-by-value reduction strategy, together with a side-effect to model probabilistic measurements. The “!” operator gives rise to a… CONTINUE READING
    The dagger lambda calculus
    1 Quantum Lambda Calculus
    4
    Quantum lambda calculus
    62
    Computational Adequacy for Substructural Lambda Calculi
    Quantum games as quantum types
    1
    Presheaf Models of Quantum Computation: An Outline
    19

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 28 REFERENCES
    Linear logic, monads and the lambda calculus
    102
    Linear Lambda-Calculus and Categorial Models Revisited
    55
    A Lambda Calculus for Quantum Computation
    182
    On a Fully Abstract Model for a Quantum Linear Functional Language: (Extended Abstract)
    43
    Computational Interpretations of Linear Logic
    475
    A Lambda Calculus for Quantum Computation with Classical Control
    146
    Notions of Computation and Monads
    • E. Moggi
    • Mathematics, Computer Science
    • 1991
    1701
    A Term Calculus for Intuitionistic Linear Logic
    180
    A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models (Extended Abstract)
    217
    Towards a quantum programming language
    391