Programming Languages Delft

@DelftPL@akademienl.social
372 Followers
111 Following
61 Posts
Official Mastodon account of the Programming Languages research group at TU Delft
Websitehttps://pl.ewi.tudelft.nl
Githubhttps://github.com/tudelft-pl
Spoofaxhttps://spoofax.dev
Agdahttps://agda-lang.org

"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

2-Functoriality of Initial Semantics, and Applications

Initial semantics aims to model inductive structures and their properties, and to provide them with recursion principles respecting these properties. An ubiquitous example is the fold operator for lists. We are concerned with initial semantics that model languages with variable binding and their substitution structure, and that provide substitution-safe recursion principles. There are different approaches to implementing languages with variable binding depending on the choice of representation for contexts and free variables, such as unscoped syntax, or well-scoped syntax with finite or infinite contexts. Abstractly, each approach corresponds to choosing a different monoidal category to model contexts and binding, each choice yielding a different notion of "model" for the same abstract specification (or "signature"). In this work, we provide tools to compare and relate the models obtained from a signature for different choices of monoidal category. We do so by showing that initial semantics naturally has a 2-categorical structure when parametrized by the monoidal category modeling contexts. We thus can relate models obtained from different choices of monoidal categories provided the monoidal categories themselves are related. In particular, we use our results to relate the models of the different implementation -- de Bruijn vs locally nameless, finite vs infinite contexts -- , and to provide a generalized recursion principle for simply-typed syntax.

arXiv.org

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

Scott's Representation Theorem and the Univalent Karoubi Envelope

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 $λ$-terms.

arXiv.org

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

Model Checking Under JAM21 | TU Delft Repository

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

LLM-Driven Synthesis of Concurrent Data Structures with SMR under Weak Memory | TU Delft Repository

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

Program Matching with Semantic Patterns | TU Delft Repository

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
Vacancies

This site collects information about positions, publications and relevant news for the project “Cyclic Structures in Programs and Proofs” project, funded by NWO. The project aims to advance the theory of cyclic structures in proofs and programs, including in coalgebraic modal logic, type theory, behavioural types, and the proof assistants Agda and Rocq (formely Coq), and create a development environment for Rust based on these techniques.

Cyclic Structures in Programs and Proofs

@jaror @DelftPL

Ook staking in #Delft: TU’ers leggen op 24 april werk neer

TU-medewerkers en studenten leggen op donderdag 24 april het werk neer als onderdeel van de landelijke estafettestaking tegen bezuinigingen op het hoger onderwijs. Dat is donderdagmiddag besloten tijdens een drukbezochte actiebijeenkomst in Pulse, georganiseerd door vakbonden #FNV, #AOb en studentenvakbond #VSSD.

https://delta.tudelft.nl/article/ook-staking-in-delft-tuers-leggen-op-24-april-werk-neer

@fonolog

#TUDelft

Ook staking in Delft: TU’ers leggen op 24 april werk neer - Delta

TU-medewerkers en studenten leggen op donderdag 24 april het werk neer als onderdeel van de landelijke estafettestaking tegen bezuinigingen op het hoger onderwijs. Dat is donderdagmiddag besloten tijdens een drukbezochte actiebijeenkomst in Pulse, georganiseerd door vakbonden FNV, AOb en studentenvakbond VSSD.

Delta

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

The Internal Language of Comprehension Categories | TU Delft Repository