Intuitionistic type theoryPer Martin-Löf
Intuitionistic type theory
by Per Martin-Löf · first published 1984
6mentions
1recommended by
5HN commenters
2016–2025first – last mentioned
20% recommend80% neutral
Affiliate links. As an Amazon Associate I earn from qualifying purchases.
Mentions per year
What Hacker News says
Related books
2014–2025Type theory and functional programming
Simon Thompson
Recommended by 2 · mentioned by 52 recommend · 5 mention2 recommend · 52 recommend
2016–2026Type Theory and Formal Proof
Rob Nederpelt, Herman Geuvers
Recommended by 11 · mentioned by 1311 recommend · 13 mention11 recommend · 1311 recommend
2008–2026Types and Programming Languages
Benjamin C. Pierce
Recommended by 132 · mentioned by 226132 recommend · 226 mention132 recommend · 226132 recommend
…re-start Thompson's "Type Theory and Functional Programming" and it was clear that I started to understand a lot of it. If you enjoy the nostalgia of older books like me, then pick up an original copy of "Intuitionistic Type Theory" edited by Per Martin-Löf.
on “Counterexamples in Type Systems” ↗…Thompson (PDF available via quick search) First 120 pages of "Type Theory and Formal Proof" by Rob Nederpelt / Herman Geuvers For some early stuff on dependent types (also covered in the above), check out "Intuitionistic Type Theory" by Per Martin-Lof "Computation and Reasoning: A Type Theory for Computer Science" by Zhaouhui Luo "Type-Driven Development with Idris" by Edwin Brady "Gentle Introduction to Dependent Types with Idris"…
on “Why is it worth spending time on type theory? (2013)” ↗…glance at Ada, I am nevertheless sure: this is not what type theorists mean when they talk about dependently typed languages. Such languages derive from the formulation of Per Martin-Löf (also called Intuitionistic Type Theory), they include dependent sum and dependent product types, and they allow type checkers to prove complex statements about code. (The history of dependent types is intertwined with the history of formalizing…
on “Ada's dependent types, and its types as a whole” ↗…Russell's paradox). The solution is for each type to be in a "universe" so that `Type l : Type (l + 1)`, where `l` is the universe level. Read about Martin-Lof type theory: https://en.wikipedia.org/wiki/Intuitionistic_type_theory
on “Ask HN: Any logic based software dev tool which helps building code gradually?” ↗> After 1970 with the introduction of Martin-Löf's Intuitionistic Type Theory, an inbreed of abstract math and computer science, a period of intense research on new type languages as Agda and Epigram started. This ended up forming the basic support layer for functional programming…
on “Why I don't spend time with Modern C++ anymore” ↗…dependency issues and just some general PITA's. [1] https://www.youtube.com/watch?v=YR5WdGrpoug&t=1504s [2] https://math.stackexchange.com/questions/4486995/what-is-an-... [3] https://en.wikipedia.org/wiki/Intuitionistic_type_theory#Ext... [4] https://youtu.be/YR5WdGrpoug?t=2668 [5] https://www.quora.com/In-type-theory-what-is-an-eliminator-a... [6] https://youtu.be/YR5WdGrpoug?t=2823
on “(Next Rich)” ↗