Sam Speight

dblp:215/3407 · also Samuel L. Speight · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0009-3706-9427ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 1 first-author · 2 since 2021Computer networks · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021
YearPublicationVenuePosition
2026 Combinatory Completeness inStructured Multicategories
Ivan Kuzmin, Chad Nester, Ülo Reimaa, Sam Speight
RAMICS4
2026 tptl-dist: A Calculus for Verifying Real-Time Distributed Systems
Javier Enríquez Mendoza, Sam Speight, Vincent Rahli
FORTE2
2024 Groupoidal realizability for intensional type theory
abstract
Abstract We develop realizability models of intensional type theory, based on groupoids, wherein realizers themselves carry non-trivial (non-discrete) homotopical structure. In the spirit of realizability, this is intended to formalize a homotopical BHK interpretation, whereby evidence for an identification is a path. Specifically, we study partitioned groupoidal assemblies. Categories of such are parameterized by “realizer categories” (instead of the usual partial combinatory algebras) that come equipped with an interval qua internal cogroupoid. The interval furnishes a notion of homotopy as well as a fundamental groupoid construction. Objects in a base groupoid are realized by points in the fundamental groupoid of some object from the realizer category; isomorphisms in the base groupoid are realized by paths in said fundamental groupoid. The main result is that, under mild conditions on the realizer category, the ensuing category of partitioned groupoidal assemblies models intensional (1-truncated) type theory without function extensionality. Moreover, when the underlying realizer category is “untyped,” there exists an impredicative universe of 1-types (the modest fibrations). This is a groupoidal analog of the traditional situation.
Sam Speight
Math. Struct. Comput. Sci.1
2018 Impredicative Encodings of (Higher) Inductive Types
abstract
Postulating an impredicative universe in dependent type theory allows System F style encodings of finitary inductive types, but these fail to satisfy the relevant η-equalities and consequently do not admit dependent eliminators. To recover η and dependent elimination, we present a method to construct refinements of these impredicative encodings, using ideas from homotopy type theory. We then extend our method to construct impredicative encodings of some higher inductive types, such as 1-truncation and the unit circle S1.
Steven Awodey, Jonas Frey, Sam Speight
LICS3