Demo Data from VLDB 2026 / reviewers in the wild / expert
Joris Ceulemans
dblp:323/8506
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
0000-0001-9582-0789ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Software engineering, system software, and programming languages
1 paper |
Programming languages and type systems · 67% Program verification · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Programming languages and type systems › type theory
logical frameworks |
0.9 | 1 | 2025 | BiSikkel: A Multimode Logical Framework in Agda · Proc. ACM Program. Lang. 2025 |
Program verification
proof assistants |
0.9 | 1 | 2025 | BiSikkel: A Multimode Logical Framework in Agda · Proc. ACM Program. Lang. 2025 |
Programming languages and type systems
type theory |
0.9 | 1 | 2025 | BiSikkel: A Multimode Logical Framework in Agda · Proc. ACM Program. Lang. 2025 |
Methods — techniques the papers use, named apart from their topics
presheaf model · 0.9agda · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | BiSikkel: A Multimode Logical Framework in AgdaabstractEmbedding Multimode Type Theory (MTT) as a library enables the usage of additional reasoning principles in off-the-shelf proof assistants without risking soundness or compatibility. Moreover, by interpreting embedded MTT terms in an internally constructed model of MTT, we can extract programs and proofs to the meta language and obtain interoperability between the embedded language and the metalanguage. The existing Sikkel library for Agda achieves this for Multimode Simple Type Theory (MSTT) with an internal presheaf model of dependent MTT. In this work, we add, on top of the simply-typed layer, a logical framework in which users can write multimode proofs about multimode Sikkel programs, still in an off-the-shelf proof assistant. To this end, we carve out of MTT a new multimode logical framework µLF over MSTT and implement it on top of Sikkel, interpreting both in the existing internal model. In the process, we further extend and improve the original codebase for each of the three layers (syntax, semantics and extraction) of Sikkel. We demonstrate the use of µLF by proving some properties about functions manipulating guarded streams and by implementing an example involving parametricity predicates. Joris Ceulemans, Andreas Nuyts, Dominique Devriese |
Proc. ACM Program. Lang. | 1 |