Semantic Domain

Finally...

How to Read Papers

The Ackermann-Péter Function in Gödel's T

Actually, We Will Read Your Thesis

Linear-time parser combinators

CN: Verifying Systems C Code with Separation-Logic Refinement Types

Two Papers about Refinement Types

The Golden Age of PL Research

Fold Considered Annoying

Simple Type Inference for System F

Static typing vs. Dynamic Typing vs. Dana Scott

What is a programming language?

Obliteratingly Fast Parser Combinators

POPL till you DROPL

Design Benchmarks

Postdoctoral opening in the TypeFoundry project

Five (and a Half) Derivatives in Language Theory

TypeFoundry: new ERC Consolidator Grant

Church Encodings, Inductive Types, and Relational Parametricity

PLDI 2020 Conference Report

Thought Experiment: An Introductory Compilers Class

Every Finite Automaton has a Corresponding Regular Expression

New Draft Paper: Survey on Bidirectional Typechecking

On the Relationship Between Static Analysis and Type Theory

Michael Arntzenius on the Future of Coding Podcast