Equipes atuais : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
Time anterior : | ACASA |
- S. Boulmé, G. Hamon : “Certifying Synchrony for free”, LPAR 2001 - 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol. 2250, Lecture Notes in Computer Science, La Havana, Cuba, pp. 495-506, (Springer-Verlag) [Boulmé 2001a]
- S. Boulmé, Th. Hardin, R. Rioboo : “Some Hints for polynomials in the Foc project”, Calculemus 2001, Siena, Italy, pp. 142-154 [Boulmé 2001b]
- P. Cuoq, M. Pouzet : “Modular Causality in a Synchronous Stream Language”, 10th European Symposium on Programming (ESOP'01), vol. 2028, Lecture Notes in Computer Science, Genova, Italy, pp. 237-251, (Springer) [Cuoq 2001]
- G. Dowek, Th. Hardin, C. Kirchner : “A Completeness theorem for an extension of first-order logic with binders”, Workshop Merlin, Mathematics and Computer Science, Leicester, United Kingdom, pp. 49-63 [Dowek 2001a]
- Th. Hardin : “An overview of the FoC project”, MKM 2001 - First International Workshop on Mathematical Knowledge Management, Linz, Austria [Hardin 2001]
- V. Prevosto : “Prototype d'interface utilisateur de la librairie Foc”, JFLA 2001 - 12èmes Journées Francophones des Langages Applicatifs, Pontarlier, France [Prevosto 2001]
- Ch. Queinnec, H. Giroire : “Pages dynamiques composées par filtrage Une mise en oeuvre sur CD-ROM”, EIAO'2001 - Environnements Interactifs d'Apprentissage avec Ordinateur, Sciences et Techniques Educatives, C. Desmoulins, M. Grandbastien, J.-M. Labat (Eds.), Paris, France, pp. 190-191, (Hermès) [Queinnec 2001c]