Pierre Valarcher

According to our database, Pierre Valarcher authored at least 12 papers between 1996 and 2012.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2012

Classes of Algorithms: Formalization and Comparison.

Serge Grigorieff, Pierre Valarcher

Bull. EATCS, 2012

Functionals Using Bounded Information and the Dynamics of Algorithms.

Serge Grigorieff, Pierre Valarcher

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2011

A Representation Theorem for Primitive Recursive Algorithms.

Philippe Andary, Bruno Patrou, Pierre Valarcher

Fundam. Informaticae, 2011

2010

Evolving Multialgebras Unify All Usual Sequential Computation Models.

Serge Grigorieff, Pierre Valarcher

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

B-ASM: Specification of ASM à la B.

David Michel, Frédéric Gervais, Pierre Valarcher

Proceedings of the Abstract State Machines, 2010

2009

Extending the loop language with higher-order procedural variables.

Tristan Crolard, Emmanuel Polonowski, Pierre Valarcher

ACM Trans. Comput. Log., 2009

2008

A complete characterization of primitive recursive intensional behaviours.

Pierre Valarcher

RAIRO Theor. Informatics Appl., 2008

2006

On the Expressive Power of the Loop Language.

Tristan Crolard, Samuel Lacas, Pierre Valarcher

Nord. J. Comput., 2006

2005

On maximal QROBDD's of Boolean functions.

Jean-Francis Michon, Jean-Baptiste Yunès, Pierre Valarcher

RAIRO Theor. Informatics Appl., 2005

About Implementation of Primitive Recursive Algorithms.

Philippe Andary, Bruno Patrou, Pierre Valarcher

Proceedings of the 12th International Workshop on Abstract State Machines, 2005

1998

Intensional semantics of system T of Gödel.

Pierre Valarcher

Proceedings of the Workshop on Domains IV 1998, 1998

1996

Intensionality versus Extensionality and Primitive Recursion.

Pierre Valarcher

Proceedings of the Concurrency and Parallelism, 1996