default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCécilia Pradic
Person information
- affiliation: Swansea University, Department of Computer Science, UK
- affiliation (PhD 2020): University of Lyon, France
- affiliation: University of Warsaw, Faculty of Mathematics, Informatics and Mechanics,, Poland
- affiliation: ENS Lyon, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Arno Pauly, Cécilia Pradic, Giovanni Soldà:
On the Weihrauch degree of the additive Ramsey theorem. Comput. 13(3-4): 459-483 (2024)- [j4]Michael Benedikt, Cécilia Pradic, Christoph Wernhard:
Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory. Log. Methods Comput. Sci. 20(3) (2024) - [i14]Eike Neumann, Arno Pauly, Cécilia Pradic:
The equational theory of the Weihrauch lattice with multiplication. CoRR abs/2403.13975 (2024) - [i13]Cécilia Pradic, Ian Price:
Implicit automata in {\lambda}-calculi III: affine planar string-to-string functions. CoRR abs/2404.03985 (2024) - [i12]Cécilia Pradic:
The equational theory of the Weihrauch lattice with (iterated) composition. CoRR abs/2408.14999 (2024) - 2023
- [c11]Michael Benedikt, Cécilia Pradic, Christoph Wernhard:
Synthesizing Nested Relational Queries from Implicit Specifications. PODS 2023: 33-45 - [i11]Arno Pauly, Cécilia Pradic, Giovanni Soldà:
On the Weihrauch degree of the additive Ramsey theorem. CoRR abs/2301.02833 (2023) - [i10]Sandra Kiefer, Lê Thành Dung Nguyên, Cécilia Pradic:
Revisiting the growth of polyregular functions: output languages, weighted automata and unary inputs. CoRR abs/2301.09234 (2023) - [i9]Lê Thành Dung Nguyên, Camille Noûs, Cécilia Pradic:
Two-way automata and transducers with planar behaviours are aperiodic. CoRR abs/2307.11057 (2023) - 2022
- [c10]Cécilia Pradic, Giovanni Soldà:
On the Weihrauch Degree of the Additive Ramsey Theorem over the Rationals. CiE 2022: 259-271 - [i8]Michael Benedikt, Cécilia Pradic, Christoph Wernhard:
Synthesizing Nested Relational Queries from Implicit Specifications. CoRR abs/2209.08299 (2022) - [i7]Michael Benedikt, Cécilia Pradic, Christoph Wernhard:
Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory. CoRR abs/2212.03085 (2022) - 2021
- [j3]Michael Benedikt, Cécilia Pradic:
Generating collection transformations from proofs. Proc. ACM Program. Lang. 5(POPL): 1-28 (2021) - [c9]Lê Thành Dung Nguyên
, Camille Noûs, Cécilia Pradic:
Comparison-Free Polyregular Functions. ICALP 2021: 139:1-139:20 - [i6]Lê Thành Dung Nguyên, Camille Noûs, Cécilia Pradic:
Comparison-free polyregular functions. CoRR abs/2105.08358 (2021) - 2020
- [b1]Cécilia Pradic:
Some proof-theoretical approaches to Monadic Second-Order logic. (Quelques liens entre logique Monadique du Second Ordre et théorie de la démonstration). University of Lyon, France, 2020 - [c8]Lê Thành Dung Nguyên, Cécilia Pradic:
Implicit Automata in Typed λ-Calculi I: Aperiodicity in a Non-Commutative Logic. ICALP 2020: 135:1-135:20 - [i5]Michael Benedikt, Cécilia Pradic:
Generating collection queries from proofs. CoRR abs/2005.06503 (2020) - [i4]Lê Thành Dung Nguyên, Camille Noûs, Cécilia Pradic:
Implicit automata in typed λ-calculi II: streaming transducers vs categorical semantics. CoRR abs/2008.01050 (2020)
2010 – 2019
- 2019
- [j2]Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Cécilia Pradic, Michal Skrzypczak:
The logical strength of Büchi's decidability theorem. Log. Methods Comput. Sci. 15(2) (2019) - [j1]Cécilia Pradic, Colin Riba:
A Curry-Howard Approach to Church's Synthesis. Log. Methods Comput. Sci. 15(4) (2019) - [c7]Amina Doumane, Denis Kuperberg, Damien Pous, Cécilia Pradic:
Kleene Algebra with Hypotheses. FoSSaCS 2019: 207-223 - [c6]Cécilia Pradic, Colin Riba:
A Dialectica-Like Interpretation of a Linear MSO on Infinite Words. FoSSaCS 2019: 470-487 - [c5]Lê Thành Dung Nguyên, Cécilia Pradic:
From Normal Functors to Logarithmic Space Queries. ICALP 2019: 123:1-123:15 - [i3]Cécilia Pradic, Chad E. Brown:
Cantor-Bernstein implies Excluded Middle. CoRR abs/1904.09193 (2019) - 2018
- [c4]Cécilia Pradic, Colin Riba:
LMSO: A Curry-Howard Approach to Church's Synthesis via Linear Logic. LICS 2018: 849-858 - [i2]Cécilia Pradic, Colin Riba:
A Curry-Howard Approach to Church's Synthesis. CoRR abs/1803.08958 (2018) - 2017
- [c3]Cécilia Pradic, Colin Riba:
A Curry-Howard Approach to Church's Synthesis. FSCD 2017: 30:1-30:16 - 2016
- [c2]Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Cécilia Pradic, Michal Skrzypczak:
The Logical Strength of Büchi's Decidability Theorem. CSL 2016: 36:1-36:16 - [i1]Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Cécilia Pradic, Michal Skrzypczak:
The logical strength of Büchi's decidability theorem. CoRR abs/1608.07514 (2016) - 2015
- [c1]Neelakantan R. Krishnaswami, Cécilia Pradic, Nick Benton:
Integrating Linear and Dependent Types. POPL 2015: 17-30
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-12-16 23:22 CET 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:
