About Primitive Recursive Algorithms. - Loïc Colson (Theor. Comput. Sci., 1991)

On List Primitive Recursion and the Complexity of Computing inf. - Loïc Colson (BIT, 1992)

On Strong Stability and Higher-Order Sequentiality - Loïc Colson; Thomas Ehrhard (LICS, 1994)

A Unary Representation Result for System T. - Loïc Colson (Ann. Math. Artif. Intell., 1996)

The Logic in Computer Science Column Functions versus Algorithms. - Loïc Colson (Bull. EATCS, 1998)

System T, Call-by-Value and the Minimum Problem. - Loïc Colson; Daniel Fredholm (Theor. Comput. Sci., 1998)

On Diagonal Fixed Points of Increasing Functions. - Loïc Colson (Theor. Comput. Sci., 1999)

Functions Versus Algorithms. - Loïc Colson (Current Trends in Theoretical Computer Science, 2001)

Syntactical Truth Predicates For Second Order Arithmetic. - Loïc Colson; Serge Grigorieff (J. Symb. Log., 2001)

Syntactical Truth Predicates for Formulas with Atomic Negation. - Loïc Colson (Math. Struct. Comput. Sci., 2002)

lambda-P Systems and Typed lambda-Calculus. - Loïc Colson; Natasa Jonoska; Maurice Margenstern (Workshop on Membrane Computing, 2004)

Pedagogical Natural Deduction Systems: the Propositional Case. - Loïc Colson; David Michel 001 (J. Univers. Comput. Sci., 2007)

Another Paradox In Naive Set-Theory. - Loïc Colson (Stud Logica, 2007)

Preface. - Christian Choffrut; Loïc Colson (RAIRO Theor. Informatics Appl., 2008)

Pedagogical Second-order Propositional Calculi. - Loïc Colson; David Michel 001 (J. Log. Comput., 2008)

Pedagogical second-order lambda-calculus. - Loïc Colson; David Michel 001 (Theor. Comput. Sci., 2009)

Investigations on a Pedagogical Calculus of Constructions. - Loïc Colson; Vincent Demange (J. Univers. Comput. Sci., 2013)