• Aucun résultat trouvé

The Montagovian Generative Lexicon ΛT yn: a Type Theoretical Framework for Natural Language Semantics

N/A
N/A
Protected

Academic year: 2021

Partager "The Montagovian Generative Lexicon ΛT yn: a Type Theoretical Framework for Natural Language Semantics"

Copied!
29
0
0

Texte intégral

Loading

Figure

Figure 2 Polymorphic conjunction: P (f (x))&Q(g(x)) with x : ξ, f : ξ → α, g : ξ → β.
Figure 4 Rules for coercive subtyping in system F.

Références

Documents relatifs

Indeed, Theorem 4.2 is the analogous of point (i) of Theorem 2.1: the strong chain recurrent set of a continuous flow on a compact metric space coincides with the intersection of

Let us say here a remark on the predicate constants in the language. If a predicate constant, say Q is given with type u → t with u 6= e which sometimes is more natural there is

If one simply allows as many self-adaptation terms as there can be valid instances of qualia exploitation, type ac- commodation or grinding rules for the lexical item concerned, and

To cite this version : Retoré, Christian Type-theoretical natural language semantics: on the system F for meaning assembly.. Any correspondance concerning this service should be

The representation language it provides has been used to investigate various linguistic phenomena, in various languages (see for instance Proceedings of

One of the hyperbolic surfaces for which the systole is known, is the Bolza surface, the most symmetric hyperbolic surface of genus 2 to consider.. Here the regular hyperbolic

In particular, methods that use a finite element simulation to compute the inverse kinematics of deformable needle (denoted here as inverse finite element method I-FEM) have been

We study Neumann type boundary value problems for nonlocal equations related to L´ evy processes.. Since these equations are nonlocal, Neu- mann type problems can be obtained in