An improved method to retrieve a library function via its Hindley/Milner type is described. Previous retrieval systems have identiied types that are isomorphic in any Cartesian closed category (CCC), and have retrieved library functions of types that are either isomorphic to the query, or have instances that are. Sometimes it is useful to instantiate the query too, which requires uniication mod...

Although Attribute Grammars were introduced thirty years ago, their lack of expressiveness has resulted in limited use outside the domain of static language processing. In this paper we show that it is possible to extend this expressiveness. We claim that Attribute Grammars can be used to describe computations on structures that are not just trees, but also on abstractions allowing for innnite ...

au titre de l'´ ecole doctorale de mathématiques et d'informatique fondamentale de Lyon Présentée et soutenue publiquement le 2 octobre 2008 par Remerciements Le train bouge, les réverbèresà deux têtes qui séparent le quai s'alignent et s'´ eloignent, ¸ ca doitêtre signe que c'est fini... Pourtant, j'aimerais faire le voyage enarrì ere, en accéléré. Je suis assis dans le sens inverse de la marc...

It is now well-known that multiclass networks may be unstable even under the \usual conditions" of stability (when the loads are less than one at all queues), but the proofs of transience (in the Markovian case) generally require a complex work based on the dynamics of an associated \\uid model". Here we develop a sample-path argument introduced in a previous paper, which provides new ergodicit...

Stochastic modelling has been successfully used in computer graphics to model a wide array of natural phenomena. In modelling three-dimensional fuzzy or partially translucent phenomena, however, many approaches are hampered by high memory and computation requirements , and by a general lack of user control. We will present a general stochastic modelling primitive that operates on two or more sc...

Cet article constitue une mise a jour d'un travail sur la complexite qui se precise, complete peu (1999, 2003 2018b notamment). L'une des idees de base etant que modelisation du fonctionnement d'une societe par le schema en trois moments (theorie l'institution), condition boucler troisieme moment premier, decrit dynamique systeme autopoietique (cf. Varela). Des lors, les boucles autopoietiques ...

Performances of product-form multi-class queuing networks can be determined from normalization constants. For large models, the evaluation of these performance metrics is not possible because of the involved amount of computer resources (either by using normaliza-tion constants or by using MVA approaches). Such large models can be evaluated with Monte Carlo methods. For a particular type of net...

Amnesics reveal savings in their objective performance of a task even though they are not aware of remembering. Experiments that are described reveal a dissociation of memory and awareness for normals as well as amnesics. The episodic-semanitc memory distinction has been employed by others as an account of the dissociation of memory and awareness. An account of this sort leads one to expect rem...

Acknowledgements are too important to be expressed in a language that is not well mastered. For this reason, I choose to mostly write them in French. On perçoit souvent le chercheur comme une entité isolée, déconnectée du réel et du monde des vivants. Ce n'est pas mon cas. Si j'ai choisi de travailler sur les langages de programmation, c'est qu'` a mon sens le verbe est essentieì a la construct...

We present a new type of search trees, called Skip trees, which are a generalization of Skip lists. To be precise, there is a one-to-one mapping between the two data types which commutes with the sequential update algorithms. A Skip list is a data structure used to manage data bases which stores values in a sorted way and in which it is insured that the form of the Skip list is independent of t...