Colin Riba

33 papers A* 4A 1B 7C 2Journal 13Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
A Complete Finitary Refinement Type System for Scott-Open Properties.
CoRR
Colin Riba, Adam Donadille
2025 C conf
Infinitary Refinement Types for Temporal Properties in Scott Domains.
WoLLIC
Colin Riba, Alexandre Kejikian
2025 J jnl
Infinitary Refinement Types for Temporal Properties in Scott Domains.
CoRR
Colin Riba, Alexandre Kejikian
2023 J jnl
Finitely accessible arboreal adjunctions and Hintikka formulae.
CoRR
Luca Reggio, Colin Riba
2023 J jnl
Liveness Properties in Geometric Logic for Domain-Theoretic Streams.
CoRR
Colin Riba, Solal Stern
2021 A conf
Temporal Refinements for Guarded Recursive Types.
ESOP
Guilhem Jaber, Colin Riba
2020 J jnl
A Functional (Monadic) Second-Order Theory of Infinite Trees.
Log. Methods Comput. Sci.
Anupam Das, Colin Riba
2020 J jnl
Monoidal-closed categories of tree automata.
Math. Struct. Comput. Sci.
Colin Riba
2019 J jnl
A Curry-Howard Approach to Church's Synthesis.
Log. Methods Comput. Sci.
Cécilia Pradic, Colin Riba
2019 B conf
A Dialectica-Like Interpretation of a Linear MSO on Infinite Words.
FoSSaCS
Cécilia Pradic, Colin Riba
2019 J jnl
A Functional (Monadic) Second-Order Theory of Infinite Trees.
CoRR
Anupam Das, Colin Riba
2019 — book
Toward Curry-Howard Approaches to MSO and Automata on Infinite Words and Trees.
Colin Riba
2018 J jnl
A Curry-Howard Approach to Church's Synthesis.
CoRR
Cécilia Pradic, Colin Riba
2018 A* conf
LMSO: A Curry-Howard Approach to Church's Synthesis via Linear Logic.
LICS
Cécilia Pradic, Colin Riba
2017 B conf
A Curry-Howard Approach to Church's Synthesis.
FSCD
Cécilia Pradic, Colin Riba
2015 A* conf
A Complete Axiomatization of MSO on Infinite Trees.
LICS
Anupam Das, Colin Riba
2015 — conf
Fibrations of Tree Automata.
TLCA
Colin Riba
2013 A* conf
Forcing MSO on Infinite Words in Weak MSO.
LICS
Colin Riba
2013 B conf
On Bar Recursion and Choice in a Classical Setting.
APLAS
Valentin Blot, Colin Riba
2012 — conf
A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Infinite Words.
IFIP TCS
Colin Riba
2011 J jnl
On the confluence of lambda-calculus with conditional rewriting
CoRR
Frédéric Blanqui, Claude Kirchner, Colin Riba
2010 J jnl
On the confluence of lambda-calculus with conditional rewriting.
Theor. Comput. Sci.
Frédéric Blanqui, Claude Kirchner, Colin Riba
2009 — conf
On the Values of Reducibility Candidates.
TLCA
Colin Riba
2008 — conf
A Tutorial on Type-Based Termination.
LerNet ALFA Summer School
Gilles Barthe, Benjamin Grégoire, Colin Riba
2008 B conf
Type-Based Termination with Sized Products.
CSL
Gilles Barthe, Benjamin Grégoire, Colin Riba
2008 C conf
Union of Reducibility Candidates for Orthogonal Constructor Rewriting.
CiE
Colin Riba
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 B conf
On the Stability by Union of Reducibility Candidates.
FoSSaCS
Colin Riba
2007 A* conf
Strong Normalization as Safe Interaction.
LICS
Colin Riba
2006 B conf
Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems.
LPAR
Frédéric Blanqui, Colin Riba
2006 J jnl
Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems
CoRR
Frédéric Blanqui, Colin Riba
2006 B conf
On the Confluence of
FoSSaCS
Frédéric Blanqui, Claude Kirchner, Colin Riba
2006 J jnl
On the confluence of lambda-calculus with conditional rewriting
CoRR
Frédéric Blanqui, Claude Kirchner, Colin Riba