<p>I discuss the paper <a href='https://poplmark-reloaded.github.io/pdf/main.pdf'>POPLmark Reloaded: Mechanizing Proofs by Logical Relations</a>, which proposes a benchmark problem for mechanizing Programming Language theory.  </p>

I discuss the paper POPLmark Reloaded: Mechanizing Proofs by Logical Relations, which proposes a benchmark problem for mechanizing Programming Language theory.

<p>I discuss the paper <a href="https://poplmark-reloaded.github.io/pdf/main.pdf" rel="noopener noreferrer">POPLmark Reloaded: Mechanizing Proofs by Logical Relations</a>, which proposes a benchmark problem for mechanizing Programming Language theory. &nbsp;</p>

POPLmark Reloaded, Part 1

Aaron Stump talks about type theory, computational logic, and related topics in Computer Science on his short commute.

Share POPLmark Reloaded, Part 1

Sign up to save your podcasts

POPLmark Reloaded, Part 1

POPLmark Reloaded, Part 1