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

Carte non disponible

Date/heure
Date(s) - 28/03/2014
14 h 00 min - 15 h 00 min

Catégories Pas de Catégories


In this paper we use finite vector spaces (finite dimension, over finite fields) as a non-standard computational model 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 finite lambda calculus that recovers completeness. The relationship between the two semantics is described, and several examples based on Church numerals are presented.

http://www.monoidal.net“>http://www.monoidal.netBenoît Valiron

Olivier CHABROL
Posts created 14

Articles similaires

Commencez à saisir votre recherche ci-dessus et pressez Entrée pour rechercher. ESC pour annuler.

Retour en haut
Secured By miniOrange