VLDB 2026 Research / reviewers in the wild / expert
S. C. Steenkamp
dblp:254/0991
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0003-3105-4098ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 1 since 2021Software engineering, systems software and programming languages · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Quotients, inductive types, and quotient inductive typesabstractThis paper introduces an expressive class of indexed quotient-inductive types, called QWI types, within the framework of constructive type theory. They are initial algebras for indexed families of equational theories with possibly infinitary operators and equations. We prove that QWI types can be derived from quotient types and inductive types in the type theory of toposes with natural number object and universes, provided those universes satisfy the Weakly Initial Set of Covers (WISC) axiom. We do so by constructing QWI types as colimits of a family of approximations to them defined by well-founded recursion over a suitable notion of size, whose definition involves the WISC axiom. We developed the proof and checked it using the Agda theorem prover. Marcelo P. Fiore, Andrew M. Pitts, S. C. Steenkamp |
Log. Methods Comput. Sci. | 3 |
| 2020 | Constructing Infinitary Quotient-Inductive TypesabstractAbstract This paper introduces an expressive class of quotient-inductive types, called QW-types. We show that in dependent type theory with uniqueness of identity proofs, even the infinitary case of QW-types can be encoded using the combination of inductive-inductive definitions involving strictly positive occurrences of Hofmann-style quotient types, and Abel’s size types. The latter, which provide a convenient constructive abstraction of what classically would be accomplished with transfinite ordinals, are used to prove termination of the recursive definitions of the elimination and computation properties of our encoding of QW-types. The development is formalized using the Agda theorem prover. Marcelo P. Fiore, Andrew M. Pitts, S. C. Steenkamp |
FoSSaCS | 3 |