Coinductive Graph Representation : the Problem of Embedded Lists
In : Electronic Communications of the EASST (ECEASST), Electronic Communications of the EASST, Berlin – Germany, Special issue Selected Revised Papers from the Third International Workshop on Graph Computation Models (GCM 2010), Vol. 39, (on line), September 2011.
Verification of redecoration for infinite triangular matrices using coinduction (regular paper)
In : International Workshop on Types and Proofs for Programs (TYPES 2011), Bergen, Norvège, 08/09/11-11/09/11, Vol. 19, Nils Anders Danielsson, Bengt Nordström (Eds.), Schloss Dagstuhl Leibniz-Zentrum fur Informatik, LIPIcsLeibniz International Proceedings in Informatics, pp. 55-69, January 2013.
Permutations in Coinductive Graph Representation (regular paper)
In : Coalgebraic Methods in Computer Science, Tallinn, Estonie, 31/03/12-01/04/12, Vol. 7399, Dirk Pattinson, Lutz Schröder (Eds.), Springer, LNCS, pp. 218-237, 2012.
Coinductive graph representation: the problem of embedded lists
In : Graph Computation Models, Enschede – The Netherlands, 02/10/10, Rachid Echahed, Annegret Habel, Mohamed Mosbah (Eds.).