On June 20-21, 2005 the third workshop on Computational Logic and Applications took place in Chambéry after the ones in Lyon (June 2004) and in Krakow (June 2002). This workshop, funded by the French Rhone-Alpes region, brings together in a friendly atmosphere researchers from Poland and France around two main topics: analysis of algorithms and lambda calculus with type theory. These two topics, that at first look may seem disjoint, have a meeting point in research on the analysis of densities of lambda terms.
The proceedings of the former workshops have been published in Schedae Informaticae (for the Krakow meeting) and by ENTCS (for the Lyon meeting).
After their presentation at the workshop in Chambéry, some papers were submitted to the editors. The refereeing process (by two anonymous referees from all over the world) has been the usual one. This volume also includes the notes of the course given by Danièle Gardy on random boolean expressions.
We are happy to present these updated papers as a proceedings volume of DMTCS.
The editors: René David Danièle Gardy Pierre Lescanne Marek Zaionc