From f5ffcc09b782d286e658a5599443bbe711df6281 Mon Sep 17 00:00:00 2001 From: "quentin@aristote.fr" Date: Tue, 22 Aug 2023 17:08:42 +0200 Subject: i am now a phd student --- basics/default.nix | 35 +++++++++++++++++++++++------------ experience/2023-03_irif.nix | 8 +++++++- experience/2023-09_irif.nix | 28 ++++++++++++++++++++++++++++ experience/default.nix | 1 + publications/publications.json | 1 + 5 files changed, 60 insertions(+), 13 deletions(-) create mode 100644 experience/2023-09_irif.nix diff --git a/basics/default.nix b/basics/default.nix index a646369..8769314 100644 --- a/basics/default.nix +++ b/basics/default.nix @@ -2,9 +2,9 @@ let institution = { - position = "Theoretical Computer Science student"; - name = "École Normale Supérieure"; - url = "https://www.ens.psl.eu/en"; + position = "PhD student in Theoretical Computer Science"; + name = "IRIF"; + url = "https://www.irif.fr/en/index"; }; in { inherit institution; @@ -29,14 +29,15 @@ in { icon = "github"; url = "https://github.com/qaristote"; }; - ENS = { - icon = "gitlab"; - url = "https://git.eleves.ens.fr/qaristote"; - }; IRIF = { icon = "gitlab"; url = "https://gitlab.math.univ-paris-diderot.fr/aristote"; }; + + ENS = { + icon = "gitlab"; + url = "https://git.eleves.ens.fr/qaristote"; + }; }; }; LinkedIn = { @@ -58,12 +59,22 @@ in { }; url = "https://quentin.aristote.fr/"; description = '' - I am a student at the ${ - href "https://www.di.ens.fr/" "Computer Science Department (DI)" - } of the ${with institution; href url name}, an institution part of ${ - href "https://psl.eu/en" "PSL University" + I am a PhD student in Theoretical Computer Science at ${ + href "https://www.irif.fr/en/index" "IRIF" + }, under the supervision of ${ + href "https://www.irif.fr/~petrisan/" "Daniela Petrişan" + }. My PhD involves studying the compositionality of ${ + href "https://en.wikipedia.org/wiki/Monad_(category_theory)" "monads" + } through ${ + href "https://ncatlab.org/nlab/show/weak+distributive+law" + "weak distributive laws" + }, and its applications to ${ + href "https://en.wikipedia.org/wiki/Side-effect_(computer_science)" + "effectful programming" + }, in particular within ${ + href "https://en.wikipedia.org/wiki/Automata_theory" "automata theory" }. - I am mainly interested in applying abstract mathematical theories (e.g. category theory) to computer science in order to get new results for free. I am also interested in practical computer science and enjoy programming using functional languages as well as tinkering with systems. + More generally, I am mainly interested in applying abstract mathematical theories (e.g. category theory) to computer science in order to get new results for free. I am also interested in practical computer science and enjoy programming using functional languages as well as tinkering with systems. ''; } diff --git a/experience/2023-03_irif.nix b/experience/2023-03_irif.nix index a1159af..0a92d17 100644 --- a/experience/2023-03_irif.nix +++ b/experience/2023-03_irif.nix @@ -23,5 +23,11 @@ name = "Daniela Petrişan"; url = "https:/www.irif.fr/~petrisan/"; }]; - description = "Ongoing. Pre-PhD internship."; + assets = [{ + type = "Publications"; + id = "aristoteFunctorialApproachMinimizing2023"; + name = "paper"; + }]; + description = + "Follow-up to my M2's internship: wrote a paper and further explored some open questions as a preparation for my PhD."; } diff --git a/experience/2023-09_irif.nix b/experience/2023-09_irif.nix new file mode 100644 index 0000000..c9a6235 --- /dev/null +++ b/experience/2023-09_irif.nix @@ -0,0 +1,28 @@ +{ ... }: + +{ + date = { + start = { + year = 2023; + month = 9; + day = 1; + }; + end = { + year = 2026; + month = 8; + day = 31; + }; + }; + institution = { + position = "PhD student in Theoretical Computer Science"; + name = "IRIF (UMR 8243), CNRS"; + url = "https://www.irif.fr/en/index"; + location = "Paris, France"; + }; + supervisors = [{ + name = "Daniela Petrişan"; + url = "https:/www.irif.fr/~petrisan/"; + }]; + description = + "Ongoing. Studying compositionality of monads and its application to effectful programming, in particular within automata theory."; +} diff --git a/experience/default.nix b/experience/default.nix index b472b45..9f2cfae 100644 --- a/experience/default.nix +++ b/experience/default.nix @@ -6,4 +6,5 @@ builtins.map (path: make path { }) [ ./2022-03_irif.nix ./2022-09_tweag.nix ./2023-03_irif.nix + ./2023-09_irif.nix ] diff --git a/publications/publications.json b/publications/publications.json index 53103c3..a757718 100644 --- a/publications/publications.json +++ b/publications/publications.json @@ -2,6 +2,7 @@ {"id":"aristoteApplicationsCategoricalFramework2022","abstract":"M2 internship report. We extend Petrişan and Colcombet's categorical framework for automata minimization and learning with new categorical algorithms and apply it to various families of automata for which minimization and learning had not been studied previously. We focus on transducers whose output lie in arbitrary monoids, weighted automata on Dedekind domains and automata whose states are quasi-ordered. This last example links automata learning together with the Valk-Jantzen lemma, widely used in the theory of well-structured transition systems.","author":[{"family":"Aristote","given":"Quentin"}],"citation-key":"aristoteApplicationsCategoricalFramework2022","issued":{"date-parts":[[2022,8,20]]},"language":"en","license":"All rights reserved","title":"Applications of a categorical framework for minimization and active learning of transition systems","type":"report","URL":"https://git.eleves.ens.fr/qaristote/m2-internship-report/uploads/2594114883f26d77c2b4f3731656351a/report.pdf"}, {"id":"aristoteDynamicalTriangulationInduced2020","abstract":"We present the single-particle sector of a quantum cellular automaton, namely a quantum walk, on a simple dynamical triangulated 2-manifold. The triangulation is changed through Pachner moves, induced by the walker density itself, allowing the surface to transform into any topologically equivalent one. This model extends the quantum walk over triangular grid, introduced in a previous work, by one of the authors, whose space-time limit recovers the Dirac equation in (2+1)-dimensions. Numerical simulations show that the number of triangles and the local curvature grow as exp(a log(t) - bt²), where a and b parametrize the way geometry changes upon the local density of the walker, and that, in the long run, flatness emerges. Finally, we also prove that the global behavior of the walker, remains the same under spacetime random fluctuations.","accessed":{"date-parts":[[2020,8,17]]},"author":[{"family":"Aristote","given":"Quentin"},{"family":"Eon","given":"Nathanaël"},{"family":"Di Molfetta","given":"Giuseppe"}],"citation-key":"aristoteDynamicalTriangulationInduced2020","container-title":"Symmetry","DOI":"10.3390/sym12010128","ISSN":"2073-8994","issue":"1:128","issued":{"date-parts":[[2020,1]]},"language":"en","license":"http://creativecommons.org/licenses/by/3.0/","number":"1","publisher":"Multidisciplinary Digital Publishing Institute","source":"www.mdpi.com","title":"Dynamical Triangulation Induced by Quantum Walk","type":"article-journal","URL":"https://www.mdpi.com/2073-8994/12/1/128","volume":"12"}, {"id":"aristoteFibrationalFrameworkNested2020","abstract":"M1 internship report. We extend a previous fibration- and coalgebra-based categorical framework for characterizing greatest fixed-points, e.g. bisimilarity-like notions, as winning positions in safety games. Our new framework thus characterizes nested alternating greatest and smallest fixed-points of a fibration- and coalgebra-based categorical operator as winning positions in parity games. This provides a new kind of parity games for the model checking of coalgebraic modal logic, but unfortunately we did not manage to instantiate more general notions of bisimulations such as fair and delayed bisimulations.","author":[{"family":"Aristote","given":"Quentin"}],"citation-key":"aristoteFibrationalFrameworkNested2020","issued":{"date-parts":[[2020,8,28]]},"language":"en","license":"All rights reserved","title":"Fibrational Framework for Nested Alternating Fixed Points and (Bi)Simulation Notions for Büchi Automata","type":"report","URL":"https://git.eleves.ens.fr/qaristote/m1-internship-report/uploads/3431548a277eb5fc297d8e7d93d1e3ce/aristote_quentin_m1_internship_report.pdf"}, + {"id":"aristoteFunctorialApproachMinimizing2023","abstract":"We study monoidal transducers, transition systems arising as deterministic automata whose transitions also produce outputs in an arbitrary monoid, for instance allowing outputs to commute or to cancel out. We use the categorical framework for minimization and learning of Colcombet, Petrişan and Stabile to recover the notion of minimal transducer recognizing a language, and give necessary and sufficient conditions on the output monoid for this minimal transducer to exist and be unique (up to isomorphism). The categorical framework then provides an abstract algorithm for learning it using membership and equivalence queries, and we discuss practical aspects of this algorithm's implementation. We also extend the framework with a categorical algorithm for minimizing transition systems, whose instantiation retrieves the algorithm for minimizing monoidal transducers but also extends the class of output monoids for which this algorithm is valid.","accessed":{"date-parts":[[2023,8,22]]},"author":[{"family":"Aristote","given":"Quentin"}],"citation-key":"aristoteFunctorialApproachMinimizing2023","issued":{"date-parts":[[2023,7,27]]},"language":"en","source":"ens.hal.science","title":"Functorial approach to minimizing and learning deterministic transducers with outputs in arbitrary monoids","type":"manuscript","URL":"https://ens.hal.science/hal-04172251"}, {"id":"aristoteMarcheQuantiqueReseau2019","abstract":"Rapport de stage de L3. On introduit un automate cellulaire quantique à une particule, un marcheur quantique, sur une variété triangulée de dimension 2. La triangulation change à travers des Pachner moves, induits eux-même par la densité du marcheur, permettant à la surface de se transformer en n'importe quelle autre surface qui lui est topologiquement équivalente. Ce modèle généralise le marcheur quantique sur un réseau triangulaire, introduit dans un article précédent par un des auteurs, et dont la limite en espace-temps retombe sur l'équation de Dirac en 2+1 dimensions.\nDes simulations numériques montrent que le nombre de triangles et que la courbure évoluent en exp(a log(t) - bt²), où a et b paramétrisent la façon dont la géométrie change selon la densité locale du marcheur, et que, sur le long terme, la surface redevient plate. Enfin, on montre aussi numériquement que le comportement global du marcheur reste le même sous l'influence de fluctuations spatio-temporelles aléatoires.","author":[{"family":"Aristote","given":"Quentin"}],"citation-key":"aristoteMarcheQuantiqueReseau2019","issued":{"date-parts":[[2019,8,25]]},"language":"fr","license":"All rights reserved","page":"15","title":"Marche quantique sur un réseau triangulaire sujet à des Pachner moves","type":"report","URL":"https://git.eleves.ens.fr/qaristote/rapport-stage-l3/-/raw/b9f9cc78ad3eabe6508be70cc27dc9bf89d34755/rapport.pdf"}, {"id":"aristoteSmtlibbackendsFasterSMTLIBbased2023","abstract":"Announcement of smtlib-backends, a Haskell library providing a generic interface for interacting with SMT solvers using SMT-LIB.","author":[{"family":"Aristote","given":"Quentin"}],"citation-key":"aristoteSmtlibbackendsFasterSMTLIBbased2023","container-title":"Tweag Blog","issued":{"date-parts":[[2023,2,14]]},"language":"en","title":"smtlib-backends: faster SMT-LIB-based Haskell interface to SMT solvers","title-short":"smtlib-backends","type":"post-weblog","URL":"https://www.tweag.io/blog/2023-02-14-smtlib-backends"} ] -- cgit v1.2.3