default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDColin Riba
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i7]Luca Reggio, Colin Riba:
Finitely accessible arboreal adjunctions and Hintikka formulae. CoRR abs/2304.12709 (2023)- [i6]Colin Riba, Solal Stern:
Liveness Properties in Geometric Logic for Domain-Theoretic Streams. CoRR abs/2310.12763 (2023) - 2021
- [c17]Guilhem Jaber, Colin Riba:
Temporal Refinements for Guarded Recursive Types. ESOP 2021: 548-578 - 2020
- [j4]Anupam Das, Colin Riba:
A Functional (Monadic) Second-Order Theory of Infinite Trees. Log. Methods Comput. Sci. 16(4) (2020) - [j3]Colin Riba:
Monoidal-closed categories of tree automata. Math. Struct. Comput. Sci. 30(1): 62-117 (2020)
2010 – 2019
- 2019
- [j2]Cécilia Pradic, Colin Riba:
A Curry-Howard Approach to Church's Synthesis. Log. Methods Comput. Sci. 15(4) (2019) - [c16]Cécilia Pradic, Colin Riba:
A Dialectica-Like Interpretation of a Linear MSO on Infinite Words. FoSSaCS 2019: 470-487 - [i5]Anupam Das, Colin Riba:
A Functional (Monadic) Second-Order Theory of Infinite Trees. CoRR abs/1903.05878 (2019) - 2018
- [c15]Cécilia Pradic, Colin Riba:
LMSO: A Curry-Howard Approach to Church's Synthesis via Linear Logic. LICS 2018: 849-858 - [i4]Cécilia Pradic, Colin Riba:
A Curry-Howard Approach to Church's Synthesis. CoRR abs/1803.08958 (2018) - 2017
- [c14]Cécilia Pradic, Colin Riba:
A Curry-Howard Approach to Church's Synthesis. FSCD 2017: 30:1-30:16 - 2015
- [c13]Anupam Das
, Colin Riba:
A Complete Axiomatization of MSO on Infinite Trees. LICS 2015: 390-401 - [c12]Colin Riba:
Fibrations of Tree Automata. TLCA 2015: 302-316 - 2013
- [c11]Valentin Blot, Colin Riba:
On Bar Recursion and Choice in a Classical Setting. APLAS 2013: 349-364 - [c10]Colin Riba:
Forcing MSO on Infinite Words in Weak MSO. LICS 2013: 448-457 - 2012
- [c9]Colin Riba:
A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Infinite Words. IFIP TCS 2012: 310-324 - 2011
- [i3]Frédéric Blanqui, Claude Kirchner, Colin Riba:
On the confluence of lambda-calculus with conditional rewriting. CoRR abs/1109.4353 (2011) - 2010
- [j1]Frédéric Blanqui, Claude Kirchner, Colin Riba:
On the confluence of lambda-calculus with conditional rewriting. Theor. Comput. Sci. 411(37): 3301-3327 (2010)
2000 – 2009
- 2009
- [c8]Colin Riba:
On the Values of Reducibility Candidates. TLCA 2009: 264-278 - 2008
- [c7]Colin Riba:
Union of Reducibility Candidates for Orthogonal Constructor Rewriting. CiE 2008: 498-510 - [c6]Gilles Barthe, Benjamin Grégoire, Colin Riba:
Type-Based Termination with Sized Products. CSL 2008: 493-507 - [c5]Gilles Barthe, Benjamin Grégoire, Colin Riba:
A Tutorial on Type-Based Termination. LerNet ALFA Summer School 2008: 100-152 - 2007
- [b1]Colin Riba:
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). National Polytechnic Institute of Lorraine, Nancy, France, 2007 - [c4]Colin Riba:
On the Stability by Union of Reducibility Candidates. FoSSaCS 2007: 317-331 - [c3]Colin Riba:
Strong Normalization as Safe Interaction. LICS 2007: 13-22 - 2006
- [c2]Frédéric Blanqui, Claude Kirchner, Colin Riba:
On the Confluence of lambda-Calculus with Conditional Rewriting. FoSSaCS 2006: 382-397 - [c1]Frédéric Blanqui, Colin Riba:
Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems. LPAR 2006: 105-119 - [i2]Frédéric Blanqui, Claude Kirchner, Colin Riba:
On the confluence of lambda-calculus with conditional rewriting. CoRR abs/cs/0609002 (2006) - [i1]Frédéric Blanqui, Colin Riba:
Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems. CoRR abs/cs/0609013 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
