Intensionality versus Extensionality and Primitive Recursion. - Pierre Valarcher (ASIAN, 1996)

Intensional semantics of system T of Gödel. - Pierre Valarcher (Workshop on Domains, 1998)

About Implementation of Primitive Recursive Algorithms. - Philippe Andary; Bruno Patrou; Pierre Valarcher (Abstract State Machines, 2005)

On maximal QROBDD's of Boolean functions. - Jean-Francis Michon; Jean-Baptiste Yunès; Pierre Valarcher (RAIRO Theor. Informatics Appl., 2005)

On the Expressive Power of the Loop Language. - Tristan Crolard; Samuel Lacas; Pierre Valarcher (Nord. J. Comput., 2006)

A complete characterization of primitive recursive intensional behaviours. - Pierre Valarcher (RAIRO Theor. Informatics Appl., 2008)

Extending the loop language with higher-order procedural variables. - Tristan Crolard; Emmanuel Polonowski; Pierre Valarcher (ACM Trans. Comput. Log., 2009)

B-ASM: Specification of ASM à la B. - David Michel 001; Frédéric Gervais; Pierre Valarcher (ASM, 2010)

Evolving Multialgebras Unify All Usual Sequential Computation Models. - Serge Grigorieff; Pierre Valarcher (STACS, 2010)

A Representation Theorem for Primitive Recursive Algorithms. - Philippe Andary; Bruno Patrou; Pierre Valarcher (Fundam. Informaticae, 2011)

Functionals Using Bounded Information and the Dynamics of Algorithms. - Serge Grigorieff; Pierre Valarcher (LICS, 2012)

Classes of Algorithms: Formalization and Comparison. - Serge Grigorieff; Pierre Valarcher (Bull. EATCS, 2012)