Modeling Simply-Typed Lambda Calculi in the Category of Finite Vector Spaces
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 vec...
Main Authors: | B. Valiron, S. Zdancewic |
---|---|
Format: | Article |
Language: | English |
Published: |
Alexandru Ioan Cuza University of Iasi
2014-12-01
|
Series: | Scientific Annals of Computer Science |
Online Access: | http://www.info.uaic.ro/bin/download/Annals/XXIV2/XXIV2_5.pdf |
Similar Items
-
Logical relation categories and lambda calculi.
by: Yang, Liqun.
Published: (2009) -
Semantics of a Typed Algebraic Lambda-Calculus
by: Benoît Valiron
Published: (2010-06-01) -
Nominal Henkin Semantics: simply-typed lambda-calculus models in nominal sets
by: Murdoch J. Gabbay, et al.
Published: (2011-10-01) -
Labelled Lambda-calculi with Explicit Copy and Erase
by: Maribel Fernández, et al.
Published: (2010-03-01) -
Wave-Style Token Machines and Quantum Lambda Calculi
by: Ugo Dal Lago, et al.
Published: (2015-02-01)