HackerTube.dev

TypeScript types can run DOOM

Michigan TypeScript · 485.6K views · 2025-02-26 · 6:59

Open on YouTube ↗

If playback is restricted in your region, try opening the original video. Use Mark watched to add it to your marked videos.

Overview

The Michigan TypeScript group shows the Doom engine running entirely inside the TypeScript type system. It is open source, and two follow-up videos cover why and how they did it.

On Hacker News

HN commenters link it as a delightful example of how far TypeScript types can be pushed, since they are Turing complete.

Recommended by 1 HN people across 1 months · HN mentions 2025–2025

Topics

Search by tags

What people said

drej · 2025-08 · Recommendation

For those not familiar with this kind of computing challenges, I must link this wonderful video about TypeScript types running... DOOM. [VIDEO]

Read the original HN comment ↗
ninetyninenine · 2025-09 · Reference

Typescript types (and Idris) are Turing complete. You can actually get typescript types to run doom. [VIDEO] Idris on the other hand is SPECIFICALLY designed so types and the program live in the same language. See the documentation intro: [LINK] THe powerful thing about these languages is that they can prove your program correct. For testing you can never verify your program to be correct. Testing is a statistical sampling technique. To verify a program as correct via tests you have to test every possible input and output combination of your program, which is impractical. So instead people write tests for a subset of the possibilities which ONLY verifies the program as correct for that subset. Think about it. If you have a function: def add(x: int, y: int) -> int How would you verify this program is 100% correct? You have to test every possible combination of x, y and add(x, y). But instead you test like 3 or 4 possibilities in your unit tests and this helps with the overall safety of the program because of statistical sampling. If a small sample of the logic is correct, it says something about the entire population of the logic.. Types on the other hand prove your program correct. def add(x: int, y: int) -> int: return x + y If the above is type checked, your program is proven correct for ALL possible types. If those types are made more advanced via being programmable, then it becomes possible for type checking to prove your ENTIRE program correct. Imagine: def add<A: addabl

Read the original HN comment ↗
stuaxo · 2025-03 · Reference

I'd like to see if it makes a difference to the version of DOOM that runs in the TypeScript type system. [LINK] [VIDEO]

Read the original HN comment ↗

Sources

Video by Michigan TypeScript, played through YouTube.

Data and selection notes

HN summaries and labels may contain AI errors. HN dates refer to discussions, not video publication.

HN Library: HackerTube export (2026-10-31) and open-index/hacker-news. Upstream summaries and classifications may contain AI errors.

Views, duration and playback status refresh separately from the published catalog. When an update fails, existing data remains visible.

Selection checks
  • SaaS & AI candidates: Topic keywords do not match
  • Editor-approved picks: Editorial review is required

Rule matches identify candidates. They do not guarantee video quality or financial results.

About the library and its sources