אודות פרק זה

אנגלית
ארצות הברית

תעתיק 🔗

חיפוש פרקים ישנים

חפש פרקים קודמים של Iowa Type Theory Commute.

פרקים אחרים בפודקאסט הזה

Commuting conversions are transformations on proofs in natural deduction, that move certain stuck inferences out of the way, so that the normal detour reductions (which correspond to beta-reduction under Curry-Howard) are enabled.  The stuck inferences are uses of disjunction elimination.  In prog‮…
I discuss a nice paper I quite enjoyed reading, called The Calculated Typer, by Garby, Bahr, and Hutton.  The authors take a very nice general look at the specification of a type checker, for a very simple expression language.  They then manually derive the actual code for the type checker by effe‮…
In this episode, I talk about a somewhat more advanced case of the Curry-Howard isomorphism (the connection between logic and programming languages where formulas in logic are identified with types, and proofs with programs).  This is the identification of double-negation translations in logic, wh‮…
In this episode, I talk about the control operator callcc, and how it is implemented during compilation using continuation-passing style (CPS).  I sketch how CPS conversion (transforming a program with callcc into one in CPS that does not need callcc any more) corresponds to double-negation transl‮…
I am currently on a frolic into the literature on Control Flow Analysis (CFA), and discuss what this is, for pure lambda calculus.  A wonderful reference for this is this paper by Palsberg.
הצהרה: הפודקאסט והגרפיקה המוטבעים בדף זה הם מ-Aaron Stump, שהוא רכושו של בעליו ואינו קשור או מאושר על ידי Listen Notes, Inc.