『Iowa Type Theory Commute』のカバーアート

Iowa Type Theory Commute

Iowa Type Theory Commute

著者: Aaron Stump
無料で聴く

Aaron Stump talks about type theory, computational logic, and related topics in Computer Science on his short commute.© 2026 Iowa Type Theory Commute 数学 科学
エピソード
  • Solving Quadratic Word Equations
    2026/08/11

    A system of word equations is called quadratic if no variable occurs more than twice in it. There is an interesting simple algorithm to solve quadratic systems of word equations, which I talk through in this episode. My source is Chapter 12 of "Algebraic Combinatorics on Words" by Lothaire.

    続きを読む 一部表示
    23 分
  • A little bit about word equations
    2026/08/03

    The problem of word equations is a rather storied one, including frustrated connections to Hilbert's Tenth problem. Word equations relate expressions consisting of concatenations of variables and constant symbols. An example is a X = X a, where X is a variable and a is a constant. A solution maps variables to strings of constant symbols making the two sides identical. In this episode, I discuss the problem a little, and what I learned so far about how it is solved.

    続きを読む 一部表示
    17 分
  • Coercive subtyping and coherence
    2026/07/01

    In this episode, I give further arguments in favor of coercive subtyping from a software-engineering perspective. I also explain the critical concept of coherence.

    続きを読む 一部表示
    21 分
adbl_web_anon_alc_button_suppression_t1
まだレビューはありません