Dr Cécilia Pradic

Uchafbwyntiau Ymchwil

1. Pradic, C., Benedikt, M., & Wernhard, C. (n.d.) Synthesizing Nested Relational Queries from Implicit Specifications. In 2023 ACM SIGMOD/PODS

   SU Repository: https://cronfa.swan.ac.uk/Record/cronfa61306

   https://arxiv.org/abs/2209.08299
2. 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
3. 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
4. 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
5. 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
6. 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
7. 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
8. 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/

Holl Ymchwil

• Formalisation of Nested Relational Calculus in Coq (cyfredol)

  MRes

• CS-205 Declarative Programming

  This module provides an introduction to the functional and logic programming paradigms and gives students the opportunity to gain practical experience in using both.

• CSCM12 Software Concepts and Efficiency

  This module provides a solid introduction to algorithm design, complexity analysis and data structure for efficient algorithm development. The module will involve students developing and evaluating their own algorithms. Java will be used as the main programming language.