On the Confluence of lambda-Calculus with Conditional Rewriting. - Frédéric Blanqui; Claude Kirchner; Colin Riba (FoSSaCS, 2006)

Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems. - Frédéric Blanqui; Colin Riba (LPAR, 2006)

On the Stability by Union of Reducibility Candidates. - Colin Riba (FoSSaCS, 2007)

Strong Normalization as Safe Interaction. - Colin Riba (LICS, 2007)

Définitions par réécriture dans le lambda-calcul : confluence, réductibilité et typage. (Definitions by rewriting in the lambda-calculus : confluence, reducibility and typing). - Colin Riba (2007)

Union of Reducibility Candidates for Orthogonal Constructor Rewriting. - Colin Riba (CiE, 2008)

Type-Based Termination with Sized Products. - Gilles Barthe; Benjamin Grégoire; Colin Riba (CSL, 2008)

A Tutorial on Type-Based Termination. - Gilles Barthe; Benjamin Grégoire; Colin Riba (LerNet ALFA Summer School, 2008)

On the Values of Reducibility Candidates. - Colin Riba (TLCA, 2009)

On the confluence of lambda-calculus with conditional rewriting. - Frédéric Blanqui; Claude Kirchner; Colin Riba (Theor. Comput. Sci., 2010)

A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Infinite Words. - Colin Riba (IFIP TCS, 2012)

On Bar Recursion and Choice in a Classical Setting. - Valentin Blot; Colin Riba (APLAS, 2013)

Forcing MSO on Infinite Words in Weak MSO. - Colin Riba (LICS, 2013)

A Complete Axiomatization of MSO on Infinite Trees. - Anupam Das 002; Colin Riba (LICS, 2015)

Fibrations of Tree Automata. - Colin Riba (TLCA, 2015)

LMSO: A Curry-Howard Approach to Church's Synthesis via Linear Logic. - Cécilia Pradic; Colin Riba (LICS, 2018)

Toward Curry-Howard Approaches to MSO and Automata on Infinite Words and Trees. - Colin Riba (2019)

A Dialectica-Like Interpretation of a Linear MSO on Infinite Words. - Cécilia Pradic; Colin Riba (FoSSaCS, 2019)

A Curry-Howard Approach to Church's Synthesis. - Cécilia Pradic; Colin Riba (Log. Methods Comput. Sci., 2019)

A Functional (Monadic) Second-Order Theory of Infinite Trees. - Anupam Das 002; Colin Riba (Log. Methods Comput. Sci., 2020)

Monoidal-closed categories of tree automata. - Colin Riba (Math. Struct. Comput. Sci., 2020)

Temporal Refinements for Guarded Recursive Types. - Guilhem Jaber; Colin Riba (ESOP, 2021)

Finitely accessible arboreal adjunctions and Hintikka formulae. - Luca Reggio; Colin Riba (CoRR, 2023)

Liveness Properties in Geometric Logic for Domain-Theoretic Streams. - Colin Riba; Solal Stern (CoRR, 2023)

Infinitary Refinement Types for Temporal Properties in Scott Domains. - Colin Riba; Alexandre Kejikian (WoLLIC, 2025)