Search results
- ...ated project::Vaucanson]] OR [[Category:Publications]] [[Publication type::article]] [[Related project::Vcsn]] ...[[Related project::Vaucanson]] OR [[Category:Publications]] [[Publication type::inproceedings]] [[Related project::Vcsn]]2 KB (171 words) - 11:56, 26 July 2018
- {{#ask: [[Category:Publications]] [[Publication type::article]]350 bytes (37 words) - 11:14, 26 July 2018
- {{Publication | type = article1 KB (137 words) - 18:56, 4 January 2018
- {{Publication | type = article1 KB (117 words) - 12:14, 26 April 2016
- {{Publication | type = article2 KB (205 words) - 09:48, 21 December 2022
- {{#ask: [[Category:Publications]] [[Publication type::article]] [[Related project::Olena]] {{#ask: [[Category:Publications]] [[Publication type::inproceedings]] [[Related project::Olena]]1 KB (158 words) - 11:47, 26 July 2018
- {{#ask: [[Category:Publications]] [[Publication type::article]] [[Related project::Spot]] {{#ask: [[Category:Publications]] [[Publication type::inproceedings]] [[Related project::Spot]]1 KB (156 words) - 14:55, 6 April 2016
- {{Publication | type = article2 KB (214 words) - 15:57, 14 December 2022
- {{Publication | title = Programmatic Manipulation of Common Lisp Type Specifiers3 KB (405 words) - 16:21, 5 February 2018
- {{Publication ...ive solutions. We further provide some proofs that might be missing in his article and some early efficiency results. We have not released any code yet but we3 KB (484 words) - 19:08, 7 April 2023
- {{Publication ...we explain how to tune Lisp code for performance by introducing the proper type declarations, using the appropriate data structures and compiler informatio2 KB (269 words) - 17:26, 29 January 2019
- {{Publication ...the hell in question would have been even greater, hadn't I done so. This article is both a nervous breakdown and a laughter, and I am seeking for the reader2 KB (297 words) - 10:40, 22 April 2023
- {{Publication ...by an analysis of these motions: speedregularity, frequency, etc. In this article, we propose a methodology called "area-of-motion characterization" suitable3 KB (461 words) - 17:01, 27 May 2021
- {{Publication | abstract = In this article we demonstrate 4 algorithms for calculating the maximal disjoint decomposit2 KB (229 words) - 19:08, 7 April 2023
- {{Publication ...sous une forme généraleindépendante aussi bien du type des données que du type des structures de données sur lesquelles il peut s'appliquer. Une réutili3 KB (353 words) - 18:57, 4 January 2018
- {{Publication | abstract = In this article we explain monads so they can be understood to the Lisp programmer. We base2 KB (265 words) - 12:22, 3 December 2022
- {{Publication | lrdekeywords = finite automata, infinite alphabets, type systems, Common Lisp, meta programming3 KB (405 words) - 19:08, 7 April 2023
- {{#ask: [[Category:Publications]] [[Publication type::inproceedings]] [[Has author::R Dehak || Reda Dehak || Réda Dehak]] {{#ask: [[Category:Publications]] [[Publication type::article]] [[Has author::R Dehak || Reda Dehak || Réda Dehak]]2 KB (295 words) - 18:16, 18 March 2016
- {{Publication | type = article2 KB (275 words) - 18:56, 4 January 2018
- {{Publication ...is d'analyser ces mouvements : vitesse, régularitéfréquence, etc. Dans cet article, nous proposons une méthode appropriée pour détecter et caractériser si4 KB (503 words) - 19:08, 7 April 2023