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

#ScopeGraphs #Spoofax #Statix #LanguageEngineering #Thesis

I am co-organizing the next edition of the NetTCS seminar on the 26th of September from 13:00. NetTCS stands for "Network on Types, Coalgebras, and Semantics" and brings together researchers on these topics from different corners of the Netherlands. Please feel free to drop by if you're interested!

nettcs.cs.ru.nl/meetings.html

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 #Rust #MIRI

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

#thesis #TypeTheory #QTT #DependentTypes #agda

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

#Master #Thesis #Rocq #HoTT #UnivalentFoundations #UniMath

"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

#TypeTheory #CategoryTheory

Scott's Representation Theorem and the Univalent Karoubi Envelope

Arnoud van der Leer, Kobe Wullaert, Benedikt Ahrens
https://arxiv.org/abs/2506.22196 https://arxiv.org/pdf/2506.22196 https://arxiv.org/html/2506.22196

arXiv:2506.22196v1 Announce Type: new
Abstract: Lambek and Scott constructed a correspondence between simply-typed lambda calculi and Cartesian closed categories. Scott's Representation Theorem is a cousin to this result for untyped lambda calculi. It states that every untyped lambda calculus arises from a reflexive object in some category. We present a formalization of Scott's Representation Theorem in univalent foundations, in the (Rocq-)UniMath library. Specifically, we implement two proofs of that theorem, one by Scott and one by Hyland. We also explain the role of the Karoubi envelope -- a categorical construction -- in the proofs and the impact the chosen foundation has on this construction. Finally, we report on some automation we have implemented for the reduction of $\lambda$-terms.

toXiv_bot_toot

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

Master thesis by Alexandru Dumitriu: "LLM-Driven Synthesis of Concurrent Data Structures with SMR under Weak Memory"

"This thesis introduces a synthesis-verification pipeline that iteratively generates concurrent data structures from partial code specifications [..] We evaluate our approach using established concurrent data structure benchmarks, demonstrating rapid convergence to correct implementations"

https://repository.tudelft.nl/record/uuid:5a857798-276f-4545-af2d-8a381e84df9a

#ProgramSynthesis #SMR #WeakMemory #master #thesis

Proud to announce that our ICPC’25 paper on “Pinpointing the Learning Obstacles of an Interactive Theorem Prover” received the Distinguished Paper Award!

Huge thanks to @jesper and @azaidman for the collaboration!

The pre-print is available on my website:
https://sarajuhosova.com/assets/files/2025-icpc.pdf

Master thesis by Pepijn Vunderink: "Program Matching with Semantic Patterns"

"We propose the Dyno pattern language, in which concrete object language syntax can be used to express intuitive semantic patterns of programs. Pattern matching is performed by translating Dyno patterns to μ-calculus formulas and model checking these formulas against models extracted from object programs."

https://repository.tudelft.nl/record/uuid:a18ab135-96b1-417c-b25e-46aa02521896

#thesis #PatternMatching #MuCalculus #ModelChecking #mCRL2

With the NWO XL consortium on Cyclic Structures in Programs and Proofs, we are looking for 6 highly motivated and talented PhD students starting in September (with some flexibility).

The topics range from Modal logic, proof theory, and coalgebras to Programming languages, concurrency, and type systems and Proof assistants (#Agda, #Rocq).

Information about the positions and application procedure can be found on the website:

cyclic-structures.gitlab.io/vacancies/

Applications will be evaluated on a rolling basis but should be submitted by the 23rd of May for full consideration.

Please forward to any strong candidates you know!

#TypeTheory #ModalLogic #Concurrency #ProgrammingLanguages #TypeSystems #ProofAssistants #CyclicStructures #PhD #Netherlands #UniversityOfGroningen #LeidenUniversity #UniversityOfTwente #TUDelft #RadboudUniversity

Master thesis by Niyousha Najmaei: "The Internal Language of Comprehension Categories"

"[..] we propose a candidate type theory for the internal language of comprehension categories by extracting a type theory from the semantics given by a general comprehension category which is not full and split. We also give an interpretation of this type theory in every comprehension category."

https://repository.tudelft.nl/record/uuid:39e79d29-122c-4b54-827f-fd9908495e17

#TypeTheory #CategoryTheory #MLTT #thesis

As part of our (@sarantja@mastodon.social and yt) research on the usability of interactive theorem provers, we are conducting a study on the usage and state of tools and languages for type-driven development. We are interested in tools that encourage and facilitate type-driven development, especially in cases when they can help us reason about complex problems.

We are hoping to use your responses to identify the characteristic language features and tool interactions that enable type-driven development, with the eventual goals of enhancing them and bringing their benefits to a wider range of programmers.

Please fill in our anonymous, 10-minute survey here: https://tudelft.fra1.qualtrics.com/jfe/form/SV_bIsMxYTKUJkhVuS

You are welcome to participate if you have experience with any type-driven development tool, including dependently-typed languages (e.g., Coq, Lean, Agda), refinement types (e.g., Liquid Haskell), or even other static type systems (e.g., in Rust or Haskell).

P.S. In case you remember signing up for an interview with us in a previous survey and are now wondering whether that study will still go on, the answer is: yes! We’ve had to revise our schedule, but we are still excited to talk to you and will start inviting people for an interview soon.

#Agda #Coq #Rocq #Lean #LiquidHaskell #Rust #Haskell #TypeDrivenDevelopment #TyDe #DependentTypes #LiquidTypes #RefinementTypes #ProofAssistants #Survey

Master thesis by Jochem Broekhoff: "Domain-Specific Abstractions for Algorithmic Graph Processing"

"The Green-Marl Intermediate Representation (GMIR) [..] prevents frontier exploration algorithms and community detection algorithms to be expressed, such as Dijkstra’s shortest path and the Louvain clustering method. We [..] introduce new domain-specific abstractions for algorithmic graph processing, targeting those algorithms."

https://repository.tudelft.nl/record/uuid:a4d57d94-811c-430f-8dd1-46d6a478feb1

#GreenMarl #GraphProcessing #dsl #thesis

Master thesis by Hendy Liang: "Property-Based ASTs: Enabling Language Parametricity in Refactoring Tools"

"By leveraging Tree-Sitter, a parser generator that creates parsers that produce generic, property-based ASTs, this research adapts Renaissance, an existing industrial refactoring tool, to support multi-language extensibility with minimal additional effort."

https://repository.tudelft.nl/record/uuid:6e143a35-32b8-4f7e-928e-52057ea57566

#LanguageParametricity #refactoring #treesitter #thesis

I am happy to announce that my paper joint with Niels van der Weide, Benedikt Ahrens & Paige Randall North has been published at Computer Science Logic 2025.

We show how univalent mathematics can be used to study intricate (higher) categories. Concretely, we demonstrate that in univalent math we can introduce more precise definitions that are able to incorporate the equivalences we actually care about. Moreover, we apply this approach and study various notions of double categories. Here is a link:

https://doi.org/10.4230/LIPIcs.CSL.2025.45

If you don't have the time or energy to read the paper, you can also check out this talk, where I try to explain the main ideas to mathematicians:

https://www.youtube.com/watch?v=mAjEo8tfsQE

Finally, we also formalized our results in Coq UniMath:

https://github.com/UniMath/UniMath/tree/master/UniMath/Bicategories/DoubleCategories

The POPL paper "Relaxed Memory Concurrency Re-executed" by Evgenii Moiseenko, Matteo Meluzzi, Innokentii Meleshchenko, Ivan Kabashnyi, Anton Podkopaev, and our own Soham Chakraborty was selected for a distinguished paper award. Congratulations to all the authors!

https://dl.acm.org/doi/10.1145/3704908

#XMM #Concurrency #POPL