Call-by-value non-determinism in a linear logic type discipline

Note that this extension cannot be defined in the standard way, by defining an open term being potentially valuable if its closure is valuable, since the secd machine évaluâtes terms

For example, he proved independently that two completely regular spaces X and Y have homeomorphic realcompactifications νX and νY whenever there is a biseparating linear maps from

The structure rec binding does not lend itself directly to separate compilation (the definitions of all mutually recursive modules must reside in the same source file), although

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

Typing a term and defining the underlying equational program at the same time, leaving some of the index terms unspecified, is a way to alleviate this problem, and is actually the

De Groote (2001) introduced the typed λµ ∧∨ -calculus to code the classical natural deduction system, and showed that it enjoys the main important properties: the strong

It is expected that the result is not true with = 0 as soon as the degree of α is ≥ 3, which means that it is expected no real algebraic number of degree at least 3 is

We prove that in the value-substitution calculus solvable terms can be char- acterised internally as the terms having normal form with respect to a sub- reduction of the calculus