Une généralisation de la théorie des types en $\lambda $-calcul
نویسندگان
چکیده
منابع مشابه
Une généralisation automorphe des nombres de Stirling
Let [n] be theset {1,2, *.. , n> and CT a given permutation in S,, the symmetric group on [n]. The (unsigned) Stirling numbers of the first kind enumerate the permutations on En] with k cycles and those of the second kind give the number partitions of [n] having k blocks. In this paper we compute the number of permutations on [n] with k cycles and the number of partitions on [n] having k blocks...
متن کاملUne optimisation en temps de calcul pour la prédiction de zones de couverture radioélectriques
This article presents a method which optimises the computation time for the prediction of a radio coverage, whatever the propagation model used. The principle consists in reducing the number of application points of the propagation model in relation to a classical technique. The proposed method is based on a multi resolution analysis of measured signals carried out around 2 GHz, and on an elect...
متن کاملUn peu de théorie des nombres et de calcul formel au service de l'arithmétique des ordinateurs
متن کامل
Une approche pour la simulation de comportements émotionnels fondée sur la théorie de la conservation des ressources
The simulation of believable behaviours for virtual agents requires to take human factors such as emotions into account. Most computational models dealing with this subject include emotion categories in their architecture. However, determining the number of categories to use and their influence on behaviour is a difficult task. In this paper, we present a model without emotion categories, cente...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO. Informatique théorique
سال: 1980
ISSN: 0399-0540
DOI: 10.1051/ita/1980140201431