Compile-Time Dependent Types
Web page · https://thenumb.at/Syl-Intro
First seen by Oriel on .
AI summary
Syl is an experimental systems programming language encoding compile-time computation and dependent types through staticity and erasure modes, enabling specialization, compile-time type computation, and indexed data structures.
- Values have independent staticity and erasure modes, allowing compile-time-known values, runtime-visible values, and controlled weakening of either property.
- Dependent function arguments can determine result types, while types are erased at runtime; static functions are monomorphized and erased branches eliminated.
- Syl supports general recursion and partial compile-time functions, making typechecking undecidable but avoiding totality checking and universe machinery.
- Examples include a typed interpreter, a length-indexed vector with statically checked append, higher-kinded types, modules, imports, and reflection.
- The design remains incomplete, requiring solutions for mode polymorphism, lifetimes, linearity, implicit parameters, proofs, incremental compilation, error traces, and an LLVM backend.
#dependent types #compiler design #systems programming #type systems
Generated by gpt-5.6-sol. Check the original for details.
Metric trends
Last 30 days · Up to 120 recorded samples per source and metric, with reposts kept separate · First and latest retained
Points
Score reported by the source.
- Hacker News: 75, latest observation ; +72 over observed period since
- Lobsters: 29, latest observation ; +28 over observed period since
Comments
Comment count reported by the source.
- Hacker News: 26, latest observation ; +26 over observed period since
- Lobsters: 11, latest observation ; +11 over observed period since
Aliases
| Source | External ID | URL |
|---|---|---|
| Hacker News | 50246538 | https://thenumb.at/Syl-Intro/ Read discussion |
| Lobsters | d09iy3 | https://thenumb.at/Syl-Intro/ Read discussion |