| 2009 | ||
|---|---|---|
| 7 | Tristan Crolard, Emmanuel Polonowski, Pierre Valarcher: Extending the loop language with higher-order procedural variables. ACM Trans. Comput. Log. 10(4): (2009) | |
| 2008 | ||
| 6 | Pierre Valarcher: A complete characterization of primitive recursive intensional behaviours. ITA 42(1): 69-82 (2008) | |
| 2006 | ||
| 5 | Tristan Crolard, Samuel Lacas, Pierre Valarcher: On the Expressive Power of the Loop Language. Nord. J. Comput. 13(1-2): 46-57 (2006) | |
| 2005 | ||
| 4 | Philippe Andary, Bruno Patrou, Pierre Valarcher: About Implementation of Primitive Recursive Algorithms. Abstract State Machines 2005: 77-90 | |
| 3 | Jean-Francis Michon, Jean-Baptiste Yunès, Pierre Valarcher: On maximal QROBDD's of Boolean functions. ITA 39(4): 677-686 (2005) | |
| 2000 | ||
| 2 | Pierre Valarcher: Intensional semantics of system T of Gödel. Electr. Notes Theor. Comput. Sci. 35: (2000) | |
| 1996 | ||
| 1 | Pierre Valarcher: Intensionality versus Extensionality and Primitive Recursion. ASIAN 1996: 142-151 | |
| 1 | Philippe Andary | [4] |
| 2 | Tristan Crolard | [5] [7] |
| 3 | Samuel Lacas | [5] |
| 4 | Jean-Francis Michon | [3] |
| 5 | Bruno Patrou | [4] |
| 6 | Emmanuel Polonowski | [7] |
| 7 | Jean-Baptiste Yunès | [3] |