Skip to content
View Cypooos's full-sized avatar
💻
Coding
💻
Coding

Organizations

@Cythan-Project

Block or report Cypooos

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Content in all repositories owned by your account will be closed.
Maximum 250 characters. Please don’t include any personal information such as legal names or email addresses. Markdown is supported. This note will only be visible to you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
Cypooos/README.md

Hi, I'm Coda!

I'm a computer science student and researcher at ENS de Lyon, working mainly in theoretical computer science.

My interests include graph algorithms, logic, automata theory, lambda calculus, type systems and formal verification. I also enjoy building things close to the machine, especially in Rust and C.

Selected projects

Project Description Tech
Crepe A C top-level interpreter written from scratch, including pointer manipulation and a simulated memory layout. Rust
GenOS A hobby operating system, including low-level input, interfaces, sound and filesystem experiments. Rust, x86_64
PAWER A browser-based proof assistant for dependent type theory / the Calculus of Inductive Constructions. Rust
la Totale A large collection of theoretical computer-science exercises for French CPGE and beyond. Typst, Web
Informatique D An annual six-hour advanced theoretical CS exam / contest that I design and organise. Theoretical CS

Research

A Congestion Parameter for Depth-First Graph Traversals

MFCS 2026 — Codaline Bourotte, Gwendal Ducloz, Pekka Orponen, Shinnosuke Seki.

We introduced and studied the KLX number, a graph parameter measuring congestion in depth-first traversals. Our work gives structural characterisations and linear-time recognition algorithms for small values, and relates the parameter to treewidth and MSO₂.

Paper · Talk · Research page

Reduction graphs of I-terms

During my M2 research internship at IRIF, supervised by Giulio Manzonetto, I studied reduction graphs of λ-terms generated only from the identity combinator and application.

The project connects λ-calculus reduction with combinatorics on ordered rooted trees and Dyck words.

Internship report

What I use

Languages

Rust · C · Python · OCaml · JavaScript

Things I like working on

Algorithms · Graph Theory · Compilers · Operating Systems · Formal Methods · Type Theory · Automata

Tools

Linux / NixOS · Git · Typst

Other things

I also make video games, music and digital art. I work with Godot and Unity, and maintain my personal website at bourotte.com.

I also teach theoretical computer science, write exercises, and have taught ompilation and mathematics at EPITA.

Popular repositories Loading

  1. la-totale la-totale Public

    Une compilation au plus que possible exhaustive d'exercices d'informatique intéressants

    Typst 8 1

  2. 3D-python-renderer 3D-python-renderer Public

    A 3D python hyperbolic renderer

    Python 3

  3. GenOS GenOS Public

    an operating system based on PHIL'S tutorial, it has the goal of proposing a different way of storing data, inspired by set theory

    Rust 3 1

  4. TwitterRulesGenerator TwitterRulesGenerator Public

    An old AI (deep learning) that generate "rules" to the internet and published them on twitter.

    Python 2

  5. PythonWavegen PythonWavegen Public

    Old (and deprecated) project to generate .wav files from python instruments.

    Python 2

  6. Recaml Recaml Public

    A simple programming language inspired by Ocaml, based on non-typed lambda calculi.

    Python 2