← Back
Home › Systems › Compilers and language tooling

type-checker

type checker

TypeScript

SystemTechniques · 10Primitives · 16 type-checker Bidirectional type checkingcompilers · medium: Split checking into two mutually recursive modes, check against a known type and synthesize an unknown one, so annotations are needed only at a few points.›Control flow type narrowingcompilers · medium: Refine variable types along branches from guards (typeof, null checks, discriminants)Dataflow analysiscompilers · medium: Compute a fact per program point (live variables, reaching definitions, available expressions) by iterating transfer functions over the CFG to a fixed point.›Incremental parsingcompilers · medium: Reparse only the region an edit damaged and splice the new subtrees into the old tree, sharing everything else; O(edit) instead of O(file).›Language server protocolcompilers · medium: One JSON-RPC conversation over a pipe lets any editor drive any language's analysis server; the cost is keeping a live, edited document in sync and answering before it changes.›Structural subtypingcompilers · medium: Type compatibility by shape: object, union and intersection types, variance and cachingType inference hindley milnercompilers · medium: Algorithm W and J: unification-based inference with let-polymorphism and generalizationName resolutioncompilers · low: Bind every use of a name to its declaration with a scope stack, handling shadowing, hoisting and closure capture in one AST walk.›Unificationcompilers · low: First-order unification with union-find and occurs check; basis of type inference and logic programmingRecursive-descent parsingcompilers · low: Hand-written top-down parser with one function per grammar rule; simple, fast, with full control over error messages and recovery.›Hash consingdata-structures · low: Intern structurally equal immutable terms so equality is pointer comparison and sharing is maximalString interningdata-structures · low: Store each distinct string once and refer to it by idPratt parsingcompilers · low: Table-driven expression parsing with one loop and a numeric binding power per operator; the compact core of precedence handling in hand-written parsers.›De bruijn indicescompilers · low: Nameless variable representation for binders: shifting, substitution, de Bruijn levelsControl-flow graphcompilers · low: Split a linear instruction list into basic blocks and connect them by jumps; the graph every optimizer, SSA builder and dataflow pass walks.›Topological sortgraphs · low: Order the vertices of a DAG so every edge points forward; the core of build systems, schedulers and dependency resolution, with cycle detection for free.›Ropegraphics · low: A balanced tree of small string chunks with cached byte and newline counts, so seek, insert, delete and snapshot cost O(log n) instead of O(n).›Union-findgraphs · low: Disjoint-set forest with union by size and path compression; merges sets and answers same-set queries in effectively constant time.›Swiss tabledata-structures · low: Open-addressing hash table that filters 8-16 slots at once with 1-byte hash tags and SIMD, giving fast lookups at 87.5 % load.›Text position encodingcompilers · low: Store byte offsets, convert to (line, column) on demand with a line-start table and binary search, and count columns in the unit the peer negotiated.›Edit distancesearch-sort · low: Levenshtein/Damerau distance by DP, bit-parallel Myers variantBFS and DFSgraphs · low: The two basic graph traversals; BFS gives hop distances and levels, DFS gives discovery/finish order for cycles, components and topological order.›Sparse matrices (CSR)numerics · low: Compressed sparse row stores only nonzeros as row pointers, column indices and values; SpMV streams them once, so it is memory-bandwidth bound.›+ 3 more techniques

Similar systems

Share the most building blocks with this one.

incremental-compiler 29 %proof-assistant 29 %formatter-linter 26 %sast 22 %language-server 17 %