Finite Vector Spaces as Model of Simply-Typed Lambda-Calculi

@article{Valiron2014FiniteVS,
  title={Finite Vector Spaces as Model of Simply-Typed Lambda-Calculi},
  author={Beno{\^i}t Valiron and Steve Zdancewic},
  journal={ArXiv},
  year={2014},
  volume={abs/1406.1310}
}
  • Benoît Valiron, Steve Zdancewic
  • Published 2014
  • Computer Science
  • ArXiv
  • In this paper we use finite vector spaces (finite dimension, over finite fields) as a non-standard computational model of linear logic. We first define a simple, finite PCF-like lambda-calculus with booleans, and then we discuss two finite models, one based on finite sets and the other on finite vector spaces. The first model is shown to be fully complete with respect to the operational semantics of the language. The second model is not complete, but we develop an algebraic extension of the… CONTINUE READING

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-4 OF 4 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 59 REFERENCES

    A typed, algebraic, computational lambda-calculus

    VIEW 2 EXCERPTS

    Order-incompleteness and finite lambda reduction models

    VIEW 1 EXCERPT

    Finiteness spaces

    • Thomas Ehrhard
    • Mathematics, Computer Science
    • Math. Struct. Comput. Sci.
    • 2005
    VIEW 3 EXCERPTS

    The algebraic lambda calculus

    • Lionel Vaux
    • Computer Science, Mathematics
    • Math. Struct. Comput. Sci.
    • 2009

    Linear-algebraic lambda-calculus: higher-order, encodings, and confluence

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL