Models of (Dependent) Type Theory
Read OriginalThis technical article explains how dependent type theory is modeled categorically. It starts with typed lambda calculus in cartesian closed categories, then details how contexts, judgments, and type families are interpreted as objects, arrows, and fibrations. It covers dependent types (like counted vectors) and terms as sections of projections, leading toward identity types and homotopy theory.
Comments
No comments yet
Be the first to share your thoughts!
Browser Extension
Get instant access to AllDevBlogs from your browser
Top of the Week
1
The Beautiful Web
Jens Oliver Meiert
•
2 votes
2
When your coding agent doesn’t understand your project, you’ll get junk
Benjamin Cane
•
1 votes
3
LLM Use in the Python Source Code
Miguel Grinberg
•
1 votes
4
Wagon’s algorithm in Python
John D. Cook
•
1 votes
5
An example conversation with Claude Code
Dumm Zeuch
•
1 votes