Chad Nester

dblp:251/2936 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
7since 2021 · last 2026
0009-0006-4763-6518ORCID · corroborated

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

Theory of computation · 6 · 2 first-author · 4 since 2021Software engineering, systems software and programming languages · 2 · 1 first-author · 2 since 2021
YearPublicationVenuePosition
2026 Combinatory Completeness inStructured Multicategories
Ivan Kuzmin, Chad Nester, Ülo Reimaa, Sam Speight
RAMICS2
2026 Resourceful Traces for Commuting Processes
abstract
We show that, when the actions of a Mazurkiewicz trace are considered not merely as atomic but as transformations from a specified type of inputs to a specified type of outputs, we obtain a novel notion of presentation for effectful categories (also known as generalized Freyd categories), a well-known algebraic structure in the semantics of side-effecting computation. Like the usual representation of traces as graphs, our notion of presentation gives rise to a graphical representation of morphisms in effectful categories. We use our presentations to give a construction of the commuting tensor product of free effectful categories, capturing the combination of systems in which the actions of each must commute with one another, while still permitting exchange of resources.
Matt Earnshaw, Chad Nester, Mario Román
CSL2
2024 Protocol choice and iteration for the free cornering
Chad Nester, Niels F. W. Voorneveld
J. Log. Algebraic Methods Program.1
2023 Concurrent Process Histories and Resource Transducers
abstract
We identify the algebraic structure of the material histories generated by concurrent processes. Specifically, we extend existing categorical theories of resource convertibility to capture concurrent interaction. Our formalism admits an intuitive graphical presentation via string diagrams for proarrow equipments. We also consider certain induced categories of resource transducers, which are of independent interest due to their unusual structure.
Chad Nester
Log. Methods Comput. Sci.1
2021 A Variety Theorem for Relational Universal Algebra
Chad Nester
RAMiCS1
2021 The Structure of Concurrent Process Histories
Chad Nester
COORDINATION1
2021 Functorial semantics for partial theories
abstract
We provide a Lawvere-style definition for partial theories, extending the classical notion of equational theory by allowing partially defined operations. As in the classical case, our definition is syntactic: we use an appropriate class of string diagrams as terms. This allows for equational reasoning about the class of models defined by a partial theory. We demonstrate the expressivity of such equational theories by considering a number of examples, including partial combinatory algebras and cartesian closed categories. Moreover, despite the increase in expressivity of the syntax we retain a well-behaved notion of semantics: we show that our categories of models are precisely locally finitely presentable categories, and that free models exist.
Ivan Di Liberti, Fosco Loregiàn, Chad Nester, Pawel Sobocinski 0001
Proc. ACM Program. Lang.3
2019 System F in Agda, for Fun and Profit
James Chapman 0001, Roman Kireev, Chad Nester, Philip Wadler
MPC3
2019 Unraveling Recursion: Compiling an IR with Recursion to System F
Michael Peyton Jones, Vasilis Gkoumas, Roman Kireev, Kenneth MacKenzie, Chad Nester, Philip Wadler
MPC5