Iowa Type Theory Commute

By: Aaron Stump
Listen for free

  • Summary

  • Aaron Stump talks about type theory, computational logic, and related topics in Computer Science on his short commute.
    © 2024 Iowa Type Theory Commute
    Show More Show Less
Mathematics Science
Show More Show Less
activate_Holiday_promo_in_buybox_DT_T2
Episodes
  • POPLmark Reloaded, Part 2

    POPLmark Reloaded, Part 2
    Dec 23 2024

    I continue the discussion of POPLmark Reloaded , discussing the solutions proposed to the benchmark problem. The solutions are in the Beluga, Coq (recently renamed Rocq), and Agda provers.
    Show More Show Less
    14 mins
  • POPLmark Reloaded, Part 1

    POPLmark Reloaded, Part 1
    Dec 23 2024

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

    Show More Show Less
    15 mins
  • Introduction to Formalizing Programming Languages Theory

    Introduction to Formalizing Programming Languages Theory
    Nov 25 2024

    In this episode, I begin discussing the question and history of formalizing results in Programming Languages Theory using interactive theorem provers like Rocq (formerly Coq) and Agda.
    Show More Show Less
    12 mins

What listeners say about Iowa Type Theory Commute

Average customer ratings

Reviews - Please select the tabs below to change the source of reviews.

Audible.co.uk reviews

Amazon reviews
No Reviews are Available