• Aucun résultat trouvé

Normalization by evaluation for sized dependent types

N/A
N/A
Protected

Academic year: 2021

Partager "Normalization by evaluation for sized dependent types"

Copied!
31
0
0

Texte intégral

Loading

Figure

Fig. 1. Syntax.
Fig. 2. Judgements.
Fig. 4. Definitional equality Γ ⊢ t = t ′ : T (implies Γ ⊕ ⊢ T and Γ ⊢ t , t ′ : T [and Γ ⊕ ⊢ t = t ′ : T ]).
Fig. 5. Rules for case distinction and recursion.
+7

Références

Documents relatifs

A small core type language with intersection types in which a partial equivalence rela- tion on closed terms is a type is enough to build the non-inductive types of Nuprl ,

Moreover, the (× i ) and (+ i ) rules require some terms to be weakly normal to learn the positivity of certain syntactic ordinals. Furthermore, the system now includes circular

We can see that programming in the Calculus of Con- structions is quite verbose: programs have arguments that are indeed only static information (type decorations, proof

Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting. Pattern matching with

Our Theorem 2 tells us that Hurewicz actions as defined in the present paper correspond to a very well known concept in category theory, but we still do not know what weak

- les électrons d’une paire de Cooper sont de spins opposés dans le calcul BCS (supraconductivité singulet de spin), mais ils pourraient être de même signe (supra-

Figure 1 Regional tectonic map of the Tibetan plateau and station distribution of this study showing major su- ture zones, terranes, fault systems, the dip and plunge of the

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des