Skip to content
Search jobs inside your AI agent. Claude, ChatGPT, Claude Code, Codex, Gemini, Cursor and Grok
Connect

Unknown company

Open 28d

PHD Position Systematic Derivation of Formal Languages

Posted Updated Apply by 18 views

Description

PhD Position Systematic Derivation of Formal Languages and Their Correctness (Delft, NL, 2628 CD) Delft University of Technology (TU Delft) Posted on Oct 16, 2026 From Semantics to Syntax - Systematic Derivation of Formal Languages and Their Correctness Job description Formal languages, such as type theories and program logics, let us state and prove precisely what software should do. Today, each new language is designed by hand: experts invent the syntax, then check that it really means what it should. This is slow, and it has to be redone for every new problem. This project explores a different approach: start from the mathematical meaning of a language and derive the language itself from it, together with a proof that the two match. Several recent type theories were built this way, but each one with its own ad hoc techniques. Together, we want to find out whether there is one general recipe behind them. You will develop this theory using tools from category theory and type theory, and check your results in the Agda proof assistant. You will be supervised by Dr. Benedikt Ahrens in the Department of Software Technology at TU Delft. Your responsibilities will include: - conducting this research, both individually and as part of a team; - participating in scientific life at TU Delft and in the Netherlands, for example by attending and organizing seminars; - participating in scientific life more globally, including publishing papers and attending workshops and conferences; - contributing to teaching in computer science, providing the opportunity to gain teaching experience. Job requirements Applications will be evaluated on the following criteria: - Masters degree in mathematics, computer science, or a related field - Experience in both category theory and theoretical computer science (e.g., type theory, logic or programming language semantics), or a strong motivation and ability to learn them. - Experience with a proof assista...
Apply

See also