In this episode, I begin discussing a paper titled <a href='https://theory.stanford.edu/people/jcm/papers/simple-sub.ps'>"Type Inference with Simple Subtypes,"</a> by John C. Mitchell.  The paper presents algorithms for computing a type and set of subtype constraints for any term of the pure lambda calculus.  I mostly focus here on how subtype constraints allow typing any term (which seems surprising). You can <a href='https://t.me/+mAzu7KuwDNFlYTBh'>join</a> the telegram group for discussion related to the podcast.

In this episode, I begin discussing a paper titled "Type Inference with Simple Subtypes," by John C. Mitchell. The paper presents algorithms for computing a type and set of subtype constraints for any term of the pure lambda calculus. I mostly focus here on how subtype constraints allow typing any term (which seems surprising). You can join the telegram group for discussion related to the podcast.

In this episode, I begin discussing a paper titled <a href="https://theory.stanford.edu/people/jcm/papers/simple-sub.ps" rel="noopener noreferrer">"Type Inference with Simple Subtypes,"</a> by John C. Mitchell.&nbsp; The paper presents algorithms for computing a type and set of subtype constraints for any term of the pure lambda calculus.&nbsp; I mostly focus here on how subtype constraints allow typing any term (which seems surprising). You can <a href="https://t.me/+mAzu7KuwDNFlYTBh" rel="noopener noreferrer">join</a> the telegram group for discussion related to the podcast.

Type inference with simple subtypes

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

Share Type inference with simple subtypes

Sign up to save your podcasts

Type inference with simple subtypes

Type inference with simple subtypes