A message from my colleague Benedikt Ahrens:
Hi all,
I have funding for a postdoc position at TU Delft on combining computer proof assistants and computer algebra systems in the area of category theory, and I would be happy to hear from potential applicants before the formal advert goes out.
I am looking for someone who is interested in all three of proof assistants, computer algebra systems, and category theory, and who has some experience in at least one or two of them.
The position ideally starts no later than March 2027.
If you are interested, please email me at B.P.Ahrens@tudelft.nl with a short note about your background and your research interests. Informal questions are very welcome.
Please feel free to forward this to anyone who might be a good fit.
Best wishes, Benedikt
Master thesis by Georgi Nihrizov: Hole-Driven Development for Substructural Type Systems in Imperative Languages
"This thesis asks whether hole-driven development can be realized effectively in Rust, an imperative language with a substructural type system. We argue that this technique is well-suited to Rust as its constrained type system can provide a solid base for the hole-driven development approach."
https://resolver.tudelft.nl/uuid:12e8946e-6479-49f6-bd26-8ffddf39ffb1
Master thesis by Gijs van der Heide: Generic Traversal Fusion in Strategic Programming
"We developed an algorithm to perform traversal fusion in strategic programming languages. [...] The algorithm performs dependency analysis on strategic programs, and then attempts to fuse together recursive calls without introducing dependency violations in order to determine legal opportunities for traversal fusion."
https://resolver.tudelft.nl/uuid:4179e07b-6be2-4cd2-bfda-d801056034d6
#Thesis #ProgrammingLanguages #StrategicProgramming #Stratego
Also, a belated welcome to Ruben Backx who joined our group as a PhD student earlier this year and is working on Formal Methods for Software Engineering with Trust with Andreea Costea!
Two master students working on different parts the Agda Core project are defending this week!
Termination Checking in Agda Core Arthur Jacques (https://resolver.tudelft.nl/uuid:4b1aa307-ba0b-4816-96c9-5e740581bc48)
Correct-by-Construction eta-conversion for Agda Core by Ate-Jan de Vries (https://resolver.tudelft.nl/uuid:47bc2732-f92b-4afa-adc9-60023849e9f5)
#Agda #AgdaCore #DependentTypes #CorrectByConstruction #master #thesis
Peter Mosses (@pdmosses) has created an alternative html rendering of TypeTopology [1].
This is still a prototype.
You can compare it to the original rendering [2], and give us feedback if you wish.
You can also report issues in [3].
[1] https://pdmosses.github.io/TypeTopology/
Master thesis by Gideon Bot: "Rethinking Dependent Type Checking, Co-Contextually"
"This work explores a co-contextual formulation of a dependent type system and its accompanying type-checking algorithm. Both incremental and parallel variants of the algorithm are implemented for the dependently typed lambda calculus Elara, based on LambdaPi (Löh, McBride, and Swierstra, 2010)."
https://resolver.tudelft.nl/uuid:79e488af-6703-4558-b2c6-1606f8ba1f14
#Master #thesis #DependentTypes #Incremental #Concurrent #TypeChecking
Deadline for applications: 11th of May
academictransfer.com/en/jobs/360114/assistant-professor-in-computer-science/
#TUDelft #AssistantProfessor #Hiring #ComputerScience #SoftwareTechnology #ProgrammingLanguages #TypeTheory #SoftwareVerification #Agda #Rocq
RE: https://hachyderm.io/@Mara/116380073192703496
Featuring #tudelft ‘s very own Andreea Costea with lessons learnt from using Rust as the intro to programming”. #rust
/cc @DelftPL
Check out the pre-print of our latest work, accepted at ICPC'26:
"The Way of Types: A Report on Developer Experience with Type-Driven Development" by me, @azaidman, and @jesper
https://sarajuhosova.com/assets/files/2026-icpc.pdf
To determine how current practitioners experience the use of type-driven development (TyDD) and what inhibits its adoption by a wider range of developers, we conducted a survey with 130 participants from various backgrounds, asking them to describe their experience with current TyDD tools.
Master thesis by Arthur de Groot: Memoising Scope Graph Query Resolution
"In this thesis, we propose a memoised variant of the current state-of-the-art query resolution algorithm that memoises data encountered during graph traversal, reducing future queries to a cache lookup. [..] We construct a synthetic dataset with these patterns that is used to evaluate query resolution algorithms with microbenchmarks."
https://resolver.tudelft.nl/uuid:7c5ea32b-d4de-4c69-a5be-c866d6250547
Master thesis by Julius de Jeu: "Detecting Undefined Behavior Across Foreign Function Boundaries in Rust Programs"
"[..] we propose a novel mechanism for detecting memory safety violations across language boundaries. We implemented it in a tool called MiriPBT: a combination of MIRI, a tool that can enforce ownership rules at runtime [..] and Property Based Testing, which allows us to greatly increase the size of the domain we can test."
https://resolver.tudelft.nl/uuid:dffbff9e-6bbc-491a-a00e-8754ce0fdd77
Master thesis by José Padilla Cancio: "Integrating runtime identity functions into a dependent type system"
"We name functions between these types that behave like the identity at runtime, runtime identity (runid) functions. [..] This thesis introduces a lightweight core language that extends a QTT-style, intensional Martin-Löf Type Theory (MLTT) with explicit markers for runid functions."
https://resolver.tudelft.nl/uuid:e6d5e4a8-6df5-4867-ad9b-4ac77cdc2512
Master thesis by Csanad Farkas:
"Formalisation of Display Map Categories in Univalent Foundations"
"A display map category, originally just called a class of display maps with a stability condition, can be used to model dependent type theory. [...] The formalisation has been done using Univalent Foundations, while the implementation has been completed using Rocq, and more specifically the UniMath library."
https://resolver.tudelft.nl/uuid:25ddff49-8d20-40ce-bb35-3b3f986c65ff
"2-Functoriality of Initial Semantics, and Applications" by Benedikt Ahrens, Ambroise Lafont, and Thomas Lamiaux was accepted at #icfp
"We provide tools to compare and relate the models obtained from a signature for different choices of monoidal category [..] we use our results to relate the models of the different implementation [..] and to provide a generalized recursion principle for simply-typed syntax."
Read it on #arXiv: https://arxiv.org/abs/2503.10863
Master thesis by Maria Khakimova: "Enhancing Proof Assistant Error Messages with Hints: A User Study"
"We implemented hint enhancements for the error messages displayed upon three common mistakes: forgetting whitespace, using confusable Unicode characters, and supplying too few arguments to a function. A between-participants user study was then conducted with 70 students [..]"
https://repository.tudelft.nl/record/uuid:52513287-7149-41f1-a8e8-8e38696cb283
#Agda #DependentTypes #ProofAssistants #ErrorMessages #Usability #UserStudy #master #thesis
Master thesis by Michał Raczkiewicz: "Model Checking Under JAM21"
"This thesis presents the first known implementation of a model checker for the Java memory model JAM21 within the GenMC framework - a tool for stateless model checking using custom memory models. [..] We provide a formal proof of equivalence between the new vector clock algorithm and the original implementation to ensure correctness."
https://repository.tudelft.nl/record/uuid:3c4c7d73-b084-4a4d-9d6d-93256bc09598
#Java #ModelChecking #MemoryModels #FormalProofs #master #thesis