Pierre Valarcher

13 papers A* 1A 1Journal 7Unranked 4
YearRankTypeTitle / Venue / Authors
2012 J jnl
Classes of Algorithms: Formalization and Comparison.
Bull. EATCS
Serge Grigorieff, Pierre Valarcher
2012 A* conf
Functionals Using Bounded Information and the Dynamics of Algorithms.
LICS
Serge Grigorieff, Pierre Valarcher
2011 J jnl
A Representation Theorem for Primitive Recursive Algorithms.
Fundam. Informaticae
Philippe Andary, Bruno Patrou, Pierre Valarcher
2010 — conf
B-ASM: Specification of ASM à la B.
ASM
David Michel, Frédéric Gervais, Pierre Valarcher
2010 J jnl
Evolving MultiAlgebras unify all usual sequential computation models
CoRR
Serge Grigorieff, Pierre Valarcher
2010 A conf
Evolving Multialgebras Unify All Usual Sequential Computation Models.
STACS
Serge Grigorieff, Pierre Valarcher
2009 J jnl
Extending the loop language with higher-order procedural variables.
ACM Trans. Comput. Log.
Tristan Crolard, Emmanuel Polonowski, Pierre Valarcher
2008 J jnl
A complete characterization of primitive recursive intensional behaviours.
RAIRO Theor. Informatics Appl.
Pierre Valarcher
2006 J jnl
On the Expressive Power of the Loop Language.
Nord. J. Comput.
Tristan Crolard, Samuel Lacas, Pierre Valarcher
2005 — conf
About Implementation of Primitive Recursive Algorithms.
Abstract State Machines
Philippe Andary, Bruno Patrou, Pierre Valarcher
2005 J jnl
On maximal QROBDD's of Boolean functions.
RAIRO Theor. Informatics Appl.
Jean-Francis Michon, Jean-Baptiste Yunès, Pierre Valarcher
1998 — conf
Intensional semantics of system T of Gödel.
Workshop on Domains
Pierre Valarcher
1996 — conf
Intensionality versus Extensionality and Primitive Recursion.
ASIAN
Pierre Valarcher