Trosolwg
Mae Dr Cécilia Pradic yn aelod o staff yn Adran Cyfrifiadureg Prifysgol Abertawe.
Dr Cécilia Pradic
Darlithydd mewn Cyfrifiadureg
Computer Science
410
Pedwerydd Llawr
Y Ffowndri Gyfrifiadol
Campws y Bae
Pedwerydd Llawr
Y Ffowndri Gyfrifiadol
Campws y Bae
Dolenni Ymchwil
Cyhoeddiadau
Uchafbwyntiau Ymchwil
-
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.
-
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.
-
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.
-
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.
-
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.
-
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.
-
Benedikt, M. & Pradic, C. (2021). Generating collection transformations from proofs. Proceedings of the ACM on Programming Languages, 5(POPL), 1-28.
-
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.
-
Pauly, A., Pradic, C., & Solda, G. (2024). On the Weihrauch degree of the additive Ramsey theorem. Computability, 0, 1-25.
Holl Ymchwil
Erthyglau Cylchgronau
-
Pauly, A., Pradic, C., & Solda, G. (2024). On the Weihrauch degree of the additive Ramsey theorem. Computability, 0, 1-25.
-
Benedikt, M. & Pradic, C. (2021). Generating collection transformations from proofs. Proceedings of the ACM on Programming Languages, 5(POPL), 1-28.
Cyfraniadau Cynadleddau
-
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.
-
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.
-
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.
-
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.
-
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.
-
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.
-
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.
Goruchwyliaeth
-
Comparing the Expressiveness of Transducers and Simply-Typed Linear λ-Calculi (cyfredol)
PhDGoruchwyliwr arall: Dr Arno Pauly -
MECHANICAL FORMALISATION OF NESTED RELATIONAL CALCULUS QUERY SYNTAX AND SEMANTICS (dyfarnwyd 2024)
MRes
Modiwlau a Addysgir
-
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.
-
CSCM712 Problem Solving & Software Efficiency
This module provides a solid introduction to problem solving and algorithm design, complexity analysis, and data structures for the development of efficient algorithms. The module will involve students developing and evaluating their own algorithms. Python will be used as the main programming language.