Colin Riba

According to our database, Colin Riba authored at least 23 papers between 2006 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Liveness Properties in Geometric Logic for Domain-Theoretic Streams.

Colin Riba, Solal Stern

CoRR, 2023

Finitely accessible arboreal adjunctions and Hintikka formulae.

Luca Reggio, Colin Riba

CoRR, 2023

2021

Temporal Refinements for Guarded Recursive Types.

Guilhem Jaber, Colin Riba

Proceedings of the Programming Languages and Systems, 2021

2020

Monoidal-closed categories of tree automata.

Colin Riba

Math. Struct. Comput. Sci., 2020

A Functional (Monadic) Second-Order Theory of Infinite Trees.

Anupam Das, Colin Riba

Log. Methods Comput. Sci., 2020

2019

A Curry-Howard Approach to Church's Synthesis.

Cécilia Pradic, Colin Riba

Log. Methods Comput. Sci., 2019

A Dialectica-Like Interpretation of a Linear MSO on Infinite Words.

Cécilia Pradic, Colin Riba

Proceedings of the Foundations of Software Science and Computation Structures, 2019

2018

LMSO: A Curry-Howard Approach to Church's Synthesis via Linear Logic.

Cécilia Pradic, Colin Riba

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2015

Fibrations of Tree Automata.

Colin Riba

Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications, 2015

A Complete Axiomatization of MSO on Infinite Trees.

Anupam Das, Colin Riba

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2013

Forcing MSO on Infinite Words in Weak MSO.

Colin Riba

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

On Bar Recursion and Choice in a Classical Setting.

Valentin Blot, Colin Riba

Proceedings of the Programming Languages and Systems - 11th Asian Symposium, 2013

2012

A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Infinite Words.

Colin Riba

Proceedings of the Theoretical Computer Science, 2012

2010

On the confluence of lambda-calculus with conditional rewriting.

Frédéric Blanqui, Claude Kirchner, Colin Riba

Theor. Comput. Sci., 2010

2009

On the Values of Reducibility Candidates.

Colin Riba

Proceedings of the Typed Lambda Calculi and Applications, 9th International Conference, 2009

2008

A Tutorial on Type-Based Termination.

Gilles Barthe, Benjamin Grégoire, Colin Riba

Proceedings of the Language Engineering and Rigorous Software Development, International LerNet ALFA Summer School 2008, Piriapolis, Uruguay, February 24, 2008

Type-Based Termination with Sized Products.

Gilles Barthe, Benjamin Grégoire, Colin Riba

Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

Union of Reducibility Candidates for Orthogonal Constructor Rewriting.

Colin Riba

Proceedings of the Logic and Theory of Algorithms, 2008

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

PhD thesis, 2007

Strong Normalization as Safe Interaction.

Colin Riba

Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

On the Stability by Union of Reducibility Candidates.

Colin Riba

Proceedings of the Foundations of Software Science and Computational Structures, 2007

2006

Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems.

Frédéric Blanqui, Colin Riba

Proceedings of the Logic for Programming, 2006

On the Confluence of <i>lambda</i>-Calculus with Conditional Rewriting.

Frédéric Blanqui, Claude Kirchner, Colin Riba

Proceedings of the Foundations of Software Science and Computation Structures, 2006