• Aucun résultat trouvé

Incrementality and effect simulation in the simply typed lambda calculus

N/A
N/A
Protected

Academic year: 2021

Partager "Incrementality and effect simulation in the simply typed lambda calculus"

Copied!
135
0
0

Texte intégral

Loading

Figure

Figure 1.2 – Simply Typed Lambda Calculus
Figure 1.3 – Dynamic Semantics for a call-by-value strategy.
Figure 1.4 – Monads
Figure 2.1 – Two styles of Proof by reflection: original and certified.
+7

Références

Documents relatifs

Delia KESNER IRIF, CNRS et Universit ´e Paris kesner@irif.fr www.irif.fr/˜kesner.. Typed

For the sake of completeness, Figure 6 sketches the ordinary CBV translation from λ -terms (possibly with iterated applications) to proof nets (including the case for

The (search) rule asserts that the type of the extracted method body of n is a func- tion that accept as input argument an object, which will contains the methods m, n, together

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

The strong normalization theorem of second order classical natural deduction [20] is based on a lemma known as the correctness result, which stipulates that each term is in

Since the proofs in the implicative propositional classical logic can be coded by Parigot’s λµ-terms and the cut elimination corresponds to the λµ-reduction, the result can be seen as

Stop considering anything can be applied to anything A function and its argument have different

Stop considering anything can be applied to anything A function and its argument have different behaviors.. Demaille Simply Typed λ-Calculus 12