Calcul de la distance par les sous-mots
Calcul du centralisateur d'un groupe de permutations
Calculation des valeurs numcute{e}riques des polynomes au moyen des spectres mathematiques
Calculi of net structures and sets are similar
Three basic operations on labelled net structures are proposed: synchronised union, synchronised intersection and synchronised difference. The first of them is a version of known parallel composition with synchronised actions identically labelled. The operations work analogously to the ordinary union, intersection and difference on sets. It is shown that the universe of net structures with these operations is a distributive lattice and – if infinite pre/post sets of transitions are allowed – even...
Calculi of net structures and sets are similar
Three basic operations on labelled net structures are proposed: synchronised union, synchronised intersection and synchronised difference. The first of them is a version of known parallel composition with synchronised actions identically labelled. The operations work analogously to the ordinary union, intersection and difference on sets. It is shown that the universe of net structures with these operations is a distributive lattice and – if infinite pre/post sets of transitions are allowed – even...
Calculs approchés de la borne inférieure de valeurs réparties
Call-by-value solvability
Call-by-value Solvability
The notion of solvability in the call-by-value λ-calculus is defined and completely characterized, both from an operational and a logical point of view. The operational characterization is given through a reduction machine, performing the classical β-reduction, according to an innermost strategy. In fact, it turns out that the call-by-value reduction rule is too weak for capturing the solvability property of terms. The logical characterization is given through an intersection type assignment system,...
Can Adaption Help on the Average.
Can Visibility Graphs Be Represented Compactly?.
Can we transform logic programs into attribute grammars ?
Cancer cell invasion of brain tissue: guided by a prepattern?
Canonical decomposition of catenation of factorial languages.
Caractérisation results about codes
Categorical abstract data type (CADT)
Catégories et langages de dot-depth un
Catégories lax-localement-cartésiennes et catégories localement cartésiennes : un exemple de suffisante complétude connexe de sémantiques initiales
Categories of partial morphisms and the relation between type structures. Partial variations on a theme of Friedman and Statman
Category of extended fuzzy automata
Category-theoretic models of linear Abadi & Plotkin logic.