### Address to the Pittsburgh City Council July 14, 2017

*This is the transcript of my testimony to the Pittsburgh City Council in support of the Pittsburgh Sanctuary City Coalition’s campaign.*

Marxist-Leninist-Maoist Type Theorist @ CMU and student of ancient languages. I co-host The Type Theory Podcast, and created the RedPRL proof assistant. Ideas written up here are rough at best.

*This is the transcript of my testimony to the Pittsburgh City Council in support of the Pittsburgh Sanctuary City Coalition’s campaign.*

What is the meaning of implication (for instance)? As with any logical construct, we must first lay down what counts as an *instance* of the implication-form, and only then may we begin to propound the conditions under which an individual instance shall be considered *true* or *evident*. This basic formula of definition in two stages is due to Per Martin-Löf, and is reflected not only in the distinction between propositionhood and truth of a proposition, but also in the concepts of “good” (comprehensible) judgment and *evident* judgment.

*This is the transcript of an address on national liberation struggles of indigenous peoples which I gave at a Pittsburgh rally organized by ANSWER Coalition on February 19, 2017.*

It is a common refrain here at Carnegie Mellon University that structural operational semantics (SOS) is the best form of dynamics, and that contextual dynamics (“Indiana-style semantics”) do not combat the bureaucratic tendency in the way that they are usually claimed to do. This is true in one formulation of contextual dynamics, but I would like to demonstrate a more fine-grained approach that is an improvement on both SOS and standard contextual dynamics.

*Dialectical materialism*, far from being merely the definitive theory of political and historical movement, also serves as the guiding light for the progressive mathematician in its manifestation as the science of adjoint functors in category theory.

As Lawvere stated in his influential note *Quantifiers and Sheaves*, the essential move in mathematics is to identify the principal contradictions of a theory in the form of pairs of adjoint functors, and to “weaponize” them as slogans to drive the further development (and generalization) of the thing. In this note, I would like to make a few remarks about the pervasiveness of dialectical phenomena, both in the mathematics itself as well as in the practical engagement in mathematical activity.

This post is an introduction to the container-oriented generalization of the core Brouwerian (co)data structures, inspired by Ghani, Hancock and Pattinson.^{1} I am not introducing anything novel; I’m merely taking their framework and showing how to round up the usual suspects of Brouwerian mathematics in their generalized, “family-friendly” setting. I am using Constable et al’s Computational Type Theory + Induction-Recursion as my metalanguage,^{2} but other variants of type theory may be used as well.

Here, I present a judgemental reconstruction of LCF-style tactic systems, called **Modernized LCF**, which admits various extensions including *validations* (checkable certificates). The purpose is to present the structure and meaning of refinement proof directly as a logical theory with a meaning explanation, in contrast to the standard practice of taking refinement proof as an extra-logical “finishing touch”.

This year’s Oregon Programming Languages Summer School, organized by Bob Harper, Greg Morrisett and Zena Ariola, has come to a close after two amazing weeks. I wanted to take a moment to thank everyone who made my time here so pleasant, with special regards to Bob Harper and Mark Bickford, who patiently answered my numerous questions about Nuprl and Brouwerian mathematics.