Cécilia Pradic

Affiliations:
  • Swansea University, Department of Computer Science, UK
  • University of Lyon, France (PhD 2020)
  • University of Warsaw, Faculty of Mathematics, Informatics and Mechanics,, Poland
  • ENS Lyon, France


According to our database1, Cécilia Pradic authored at least 23 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory.
Log. Methods Comput. Sci., 2024

The equational theory of the Weihrauch lattice with (iterated) composition.
CoRR, 2024

Implicit automata in {\lambda}-calculi III: affine planar string-to-string functions.
CoRR, 2024

The equational theory of the Weihrauch lattice with multiplication.
CoRR, 2024

On the Weihrauch degree of the additive Ramsey theorem.
Comput., 2024

2023
Two-way automata and transducers with planar behaviours are aperiodic.
CoRR, 2023

Revisiting the growth of polyregular functions: output languages, weighted automata and unary inputs.
CoRR, 2023

Synthesizing Nested Relational Queries from Implicit Specifications.
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

2022
On the Weihrauch Degree of the Additive Ramsey Theorem over the Rationals.
Proceedings of the Revolutions and Revelations in Computability, 2022

2021
Generating collection transformations from proofs.
Proc. ACM Program. Lang., 2021

Comparison-Free Polyregular Functions.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Some proof-theoretical approaches to Monadic Second-Order logic. (Quelques liens entre logique Monadique du Second Ordre et théorie de la démonstration).
PhD thesis, 2020

Implicit automata in typed λ-calculi II: streaming transducers vs categorical semantics.
CoRR, 2020

Generating collection queries from proofs.
CoRR, 2020

Implicit Automata in Typed λ-Calculi I: Aperiodicity in a Non-Commutative Logic.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
A Curry-Howard Approach to Church's Synthesis.
Log. Methods Comput. Sci., 2019

The logical strength of Büchi's decidability theorem.
Log. Methods Comput. Sci., 2019

Cantor-Bernstein implies Excluded Middle.
CoRR, 2019

From Normal Functors to Logarithmic Space Queries.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

A Dialectica-Like Interpretation of a Linear MSO on Infinite Words.
Proceedings of the Foundations of Software Science and Computation Structures, 2019

Kleene Algebra with Hypotheses.
Proceedings of the Foundations of Software Science and Computation Structures, 2019

2018
LMSO: A Curry-Howard Approach to Church's Synthesis via Linear Logic.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2015
Integrating Linear and Dependent Types.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015


  Loading...