A Dynamic, Statically Typed Contradiction

Please log in to watch this conference skillscast.

And, what is a type system anyway?

During this talk, you will explore the Simply Typed Lambda Calculus, and it's application in a "Hindley-Milner" based type system with "full-program" type inference. How it can be mapped onto Clojure's syntax, and how it can be used to type-check a subset of Clojure code.

You will learn how expressive static type systems compare to clojure.spec, and how they can be used as a tool to complement Clojure's REPL driven workflow, not just to hinder the programmer. Finally, you will discover strategies for mixing typed and untyped code.

YOU MAY ALSO LIKE:

• Speculative Development: Using clojure.spec to write correct, beautifully documented APIs (SkillsCast recorded in December 2016)
• Keynote — Generating Programs from Types (SkillsCast recorded in November 2021)
• Stress Driven Development, and How to Avoid it (SkillsCast recorded in October 2021)