The text explains the concept of De Bruijn indexes and levels, which are naming schemes used in lambda calculus to avoid variable capture problems. It compares the two methods and discusses their advantages, including the ability ...
About:
The metadata does not provide a detailed summary about the author. However, the site is named 'Blueberry Wren', which may indicate the author's pseudonym or brand name.
Website:
Outgoing Links:
Subscribe to RSS:
The text introduces the concept of De Bruijn indexes and levels, explaining how they help avoid variable capture problems. It also discusses the evaluation of complex dependent types and introduces the concept of 'Normalization by...
The text criticizes dependent types in computer science, arguing that they are not useful in the real world. It also mentions the use of runtime verification as an alternative.
The text is an excerpt from a discord conversation about dependent pattern unification. It explains the process of solving unification goals and discusses the formal treatment and implementation of pattern unification.
0Welcome back.
2025-03-27 •
...
0Crafting a dependent typechecker, part 1
2025-07-19 •
...
0Isabelle/HOL rule musings
2025-09-19 •
...
0Opinion piece: On Zig
2025-10-14 •
...
0Horrible answers to "What is a type?"
2025-11-16 •
...
0Written in Pure Sea
2025-12-18 •
...
0Axiom J in Homotopy Type Theory (HoTT)
2025-12-31 •
...
0Type safe interpreters
2026-01-16 •
...
0Hi, world.
2023-06-17 •
...