Dr Cécilia Pradic

Lecturer in Computer Science

Computer Science

+44 (0) 1792 295146

c.pradic@swansea.ac.uk

Research Links

https://orcid.org/0000-0002-1600-8846

About

Personal webpage: https://cpradic.web.deuxfleurs.fr

Publications

Research Highlights

All Research

Journal Articles

Pradic, C. & Price, I. (2024). Implicit Automata in λ-calculi III: Affine Planar String-to-string Functions. Electronic Notes in Theoretical Informatics and Computer Science, Volume 4 - Proceedings of MFPS XL
https://doi.org/10.46298/entics.14804, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa68303
Pauly, A., Pradic, C., & Solda, G. (2024). On the Weihrauch degree of the additive Ramsey theorem. Computability, 13(3-4), 459-483.
https://doi.org/10.3233/com-230437, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa65433
Benedikt, M., Pradic, C., & Wernhard, C. (2024). Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory. Logical Methods in Computer Science, 20(3)
https://doi.org/10.46298/lmcs-20(3:7)2024, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa69247
Benedikt, M. & Pradic, C. (2021). Generating collection transformations from proofs. Proceedings of the ACM on Programming Languages, 5(POPL), 1-28.
https://doi.org/10.1145/3434295, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa57933

Conference Contributions

Pradic, C. & Price, I. (2026). Problems with Fixpoints of Polynomials of Polynomials. In Claudia Faggian and Joost-Pieter Katoen (Ed.), 41st Annual Symposium on Logic in Computer Science (LICS 2026) (pp. 77:1-77:27). Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.LICS.2026.77, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa71916
Franklin, J., Neumann, E., Pauly, A., Pradic, C., & Valenti, M. (2025). Represented Spaces of Represented Spaces. In Lecture Notes in Computer Science (pp. 47-61). Springer Nature Switzerland.
https://doi.org/10.1007/978-3-031-95908-0_4, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa69812
Neumann, E., Pauly, A., Pradic, C., & Valenti, M. (2025). Computably Discrete Represented Spaces. In Lecture Notes in Computer Science (pp. 349-364). Springer Nature Switzerland.
https://doi.org/10.1007/978-3-031-95908-0_25, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa69811
Pradic, C. & Price, I. (2025). Weihrauch Problems as Containers. In Arnold Beckmann, Isabel Oitavem, Florin Manea (Ed.), Lecture Notes in Computer Science (pp. 395-409). Springer Nature Switzerland.
https://doi.org/10.1007/978-3-031-95908-0_28, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa69283
Benedikt, M., Pradic, C., & Wernhard, C. (2023). Synthesizing Nested Relational Queries from Implicit Specifications. In Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsACM.
https://doi.org/10.1145/3584372.3588653, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa61306
http://dx.doi.org/10.1145/3584372.3588653
Nguyễn, L., Noûs, C., & Pradic, C. (2021). Comparison-Free Polyregular Functions.. In Nikhil Bansal, Emanuela Merelli, James Worrell (Ed.), 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) (pp. 139:1-139:20). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.ICALP.2021.139, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa57932
https://drops.dagstuhl.de/opus/volltexte/2021/14208/
Nguyên, L. & Pradic, C. (2020). Implicit Automata in Typed λ-Calculi I: Aperiodicity in a Non-Commutative Logic. In 47th International Colloquium on Automata, Languages and Programming (ICALP 2020) (pp. 135:1-135:20). Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik.
https://doi.org/10.4230/LIPIcs.ICALP.2020.135, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa58111
Pradic, C. & Riba, C. (2019). A Dialectica-Like Interpretation of a Linear MSO on Infinite Words. In Lecture Notes in Computer Science (pp. 470-487). Springer International Publishing.
https://doi.org/10.1007/978-3-030-17127-8_27, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa58114
Doumane, A., Kuperberg, D., Pous, D., & Pradic, C. (2019). Kleene Algebra with Hypotheses. In Lecture Notes in Computer Science (pp. 207-223). Springer International Publishing.
https://doi.org/10.1007/978-3-030-17127-8_12, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa58113
Pradic, C. & Riba, C. (2018). LMSO: A Curry-Howard Approach to Church's Synthesis via Linear Logic. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer ScienceACM.
https://doi.org/10.1145/3209108.3209195, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa58115
Kolodziejczyk, L., Michalewski, H., Pradic, C., & Skrzypczak, M. (2016). The logical strength of Büchi's decidability theorem. In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016) (pp. 36:1-36:16). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.
https://doi.org/10.4230/LIPIcs.CSL.2016.36, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa58112
http://drops.dagstuhl.de/opus/volltexte/2016/6576
Krishnaswami, N., Pradic, C., & Benton, N. (2015). Integrating Linear and Dependent Types. In POPL '15: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (pp. 17-30). Association for Computing Machinery (ACM).
https://doi.org/10.1145/2676726.2676969, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa58116

Supervision

MECHANICAL FORMALISATION OF NESTED RELATIONAL CALCULUS QUERY SYNTAX AND SEMANTICS (awarded 2024)

MRes

Dr Cécilia Pradic

Telephone number

Email address

Research Links

About

Publications

Research Highlights

All Research

Journal Articles

Conference Contributions

Supervision

MECHANICAL FORMALISATION OF NESTED RELATIONAL CALCULUS QUERY SYNTAX AND SEMANTICS (awarded 2024)