• Aucun résultat trouvé

Probabilistic Termination by Monadic Affine Sized Typing

N/A
N/A
Protected

Academic year: 2021

Partager "Probabilistic Termination by Monadic Affine Sized Typing"

Copied!
28
0
0

Texte intégral

Loading

Figure

Fig. 1. A Tree of Recursive Calls.
Fig. 2. Call-by-value reduction relation → v on distributions.
Fig. 3. Affine simple types for λ ⊕ .
Fig. 4. Affine distribution types for λ ⊕ .

Références

Documents relatifs

Figures 7b and 7c show that better surface contact is achieved between the fibers and the matrix for the treated flax fiber epoxy composites.. And, this seems much

The typical continuous behaviour of hybrid systems suggests the category T op of topological spaces and continuous functions as a suitable working environment for developing

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

Seed catch – a property of seed traps that refers to its ability to trap seeds from the seed rain. The final number of seeds captured by a seed trap is affected by both seed

This minimal value of E Cd is only available for the trench shape of this study (70 µm width). In fact, the maximal electric field in the edge is located at the end of the

More precisely, Van Benthem first shows that the bisimulation invariant fragment of first order logic (FO, the 0th level of the monadic hierarchy) equals modal logic (the 0th level

This paper combines two classic results from two di↵erent fields: the result by Lauritzen and Spiegelhalter [21] that the probabilis- tic inference problem on probabilistic networks