
Type Inference
- 80 installs
- 25.5k repo stars
- Updated August 5, 2026
- biomejs/biome
type-inference is a skill that guides Biome contributors to work with the module graph and type inference system for type-aware rules.
About
This skill guides a Biome contributor working with the module graph and type inference system. It covers type references, the local, thin, and full resolution phases, and the architecture designed for IDE performance. A contributor uses it when implementing type-aware lint rules or working on the module graph infrastructure.
- Guides working with Biome's module graph and type inference system
- Explains the three resolution phases: local, module-level thin, and full inference
- Documents TypeReference and the no-cross-module-copy rule for IDE performance
Type Inference by the numbers
- 80 all-time installs (skills.sh)
- Ranked #69 of 121 Rust skills by installs in the Skillselion catalog
- Data as of Aug 5, 2026 (Skillselion catalog sync)
type-inference capabilities & compatibility
- Capabilities
- lint rule development · parser development
- Use cases
- refactoring · code review
What type-inference says it does
Use this skill when working with Biome's type inference system and module graph.
No module may copy or clone data from another module, not even behind `Arc`.
Instead of direct type references, use `TypeReference`:
npx skills add https://github.com/biomejs/biome --skill type-inferenceAdd your badge
Show developers this skill is listed on Skillselion. Paste this into your README.
| Installs | 80 |
|---|---|
| repo stars | ★ 25.5k |
| Last updated | August 5, 2026 |
| Repository | biomejs/biome ↗ |
What it does
Work with Biome's module graph and type inference to implement type-aware lint rules.
Who is it for?
Contributors implementing type-aware Biome lint rules or module-graph infrastructure
Skip if: End users configuring TypeScript or Biome in their own project
When should I use this skill?
Implementing type-aware lint rules or working on the module graph infrastructure
What you get
Correct use of TypeReference and the resolution phases for type-aware analysis.
By the numbers
- 3 type resolution phases: local, thin, full
- 4 available resolvers
Files
Purpose
Use this skill when working with Biome's type inference system and module graph. Covers type references, resolution phases, and the architecture designed for IDE performance.
Prerequisites
1. Read crates/biome_js_type_info/CONTRIBUTING.md for architecture details 2. Understand Biome's focus on IDE support and instant updates 3. Familiarity with TypeScript type system concepts
Code Standards
CRITICAL: No Emojis
Emojis are BANNED in all type inference code:
- NO emojis in code comments
- NO emojis in rustdoc documentation
- NO emojis in test files
- NO emojis in debug output or error messages
Keep all code professional and emoji-free.
Key Concepts
Module Graph Constraint
Critical rule: No module may copy or clone data from another module, not even behind Arc.
Why: Any module can be updated at any time (IDE file changes). Copying data would create stale references that are hard to invalidate.
Solution: Use TypeReference instead of direct type references.
Type Data Structure
Types are stored in TypeData enum with many variants:
// Simplified — see crates/biome_js_type_info/src/type_data.rs for the full enum
enum TypeData {
Unknown, // Inference not implemented
Global, // Global type reference
BigInt, Boolean, Null, Number, // Primitive types
String, Symbol, Undefined,
Function(Box<Function>), // Function with parameters
Object(Box<Object>), // Object with properties
Class(Box<Class>), // Class definition
Interface(Box<Interface>), // Interface definition
Union(Box<Union>), // Union type (A | B)
Intersection(Box<Intersection>), // Intersection type (A & B)
Tuple(Box<Tuple>), // Tuple type
Literal(Box<Literal>), // Literal type ("foo", 42)
Reference(TypeReference), // Reference to another type
TypeofExpression(Box<TypeofExpression>), // typeof an expression
// ... plus Conditional, Generic, TypeOperator, InstanceOf,
// keyword variants (AnyKeyword, NeverKeyword, VoidKeyword, etc.)
}Type References
Instead of direct type references, use TypeReference:
enum TypeReference {
Qualifier(Box<TypeReferenceQualifier>), // Name-based reference
Resolved(ResolvedTypeId), // Resolved to type ID
Import(Box<TypeImportQualifier>), // Import reference
}Note: There is no Unknown variant. Unknown types are represented as TypeReference::Resolved(GLOBAL_UNKNOWN_ID). Use TypeReference::unknown() to create one.
Type Resolution Phases
1. Local Inference
What: Derives types from expressions without surrounding context.
Example: For a + b, creates:
TypeData::TypeofExpression(TypeofExpression::Addition {
left: TypeReference::from(TypeReferenceQualifier::from_name("a")),
right: TypeReference::from(TypeReferenceQualifier::from_name("b"))
})Where: Implemented in local_inference.rs
Output: Types with unresolved TypeReference::Qualifier references
2. Module-Level ("Thin") Inference
What: Resolves references within a single module's scope.
Process: 1. Takes results from local inference 2. Looks up qualifiers in local scopes 3. Converts to TypeReference::Resolved if found locally 4. Converts to TypeReference::Import if from import statement 5. Falls back to globals (like Array, Promise) 6. Uses TypeReference::Unknown if nothing found
Where: Implemented in js_module_info/collector.rs
Output: Types with resolved local references, import markers, or unknown
3. Full Inference
What: Resolves import references across module boundaries.
Process: 1. Has access to entire module graph 2. Resolves TypeReference::Import by following imports 3. Converts to TypeReference::Resolved after following imports
Where: Implemented in js_module_info/module_resolver.rs
Limitation: Results cannot be cached (would become stale on file changes)
Working with Type Resolvers
Available Resolvers
// 1. For tests
HardcodedSymbolResolver
// 2. For globals (Array, Promise, etc.)
GlobalsResolver
// 3. For thin inference (single module)
JsModuleInfoCollector
// 4. For full inference (across modules)
ModuleResolverUsing a Resolver
use biome_js_type_info::{TypeResolver, ResolvedTypeData};
fn analyze_type(resolver: &impl TypeResolver, type_ref: TypeReference) {
// Resolve the reference
let resolved_data: ResolvedTypeData = resolver.resolve_type(type_ref);
// Get raw data for pattern matching
match resolved_data.as_raw_data() {
TypeData::String => { /* handle string */ },
TypeData::Number => { /* handle number */ },
TypeData::Function(func) => { /* handle function */ },
_ => { /* handle others */ }
}
// Resolve nested references
if let TypeData::Reference(inner_ref) = resolved_data.as_raw_data() {
let inner_data = resolver.resolve_type(*inner_ref);
// Process inner type
}
}Type Flattening
What: Converts complex type expressions to concrete types.
Example: After resolving a + b:
- If both are
TypeData::Number→ Flatten toTypeData::Number - Otherwise → Usually flatten to
TypeData::String
Where: Implemented in flattening.rs
Common Workflows
Implement Type-Aware Lint Rule
use biome_analyze::Semantic;
use biome_js_type_info::{TypeResolver, TypeData};
impl Rule for MyTypeRule {
type Query = Semantic<JsCallExpression>;
fn run(ctx: &RuleContext<Self>) -> Self::Signals {
let node = ctx.query();
let model = ctx.model();
// Get type resolver from model
let resolver = model.type_resolver();
// Get type of expression
let expr_type = node.callee().ok()?.infer_type(resolver);
// Check the type
match expr_type.as_raw_data() {
TypeData::Function(_) => { /* valid */ },
TypeData::Unknown => { /* might be valid, can't tell */ },
_ => { return Some(()); /* not callable */ }
}
None
}
}Navigate Type References
fn is_string_type(resolver: &impl TypeResolver, type_ref: TypeReference) -> bool {
let resolved = resolver.resolve_type(type_ref);
// Follow references
let data = match resolved.as_raw_data() {
TypeData::Reference(ref_to) => resolver.resolve_type(*ref_to),
_other => resolved,
};
// Check the resolved type
matches!(data.as_raw_data(), TypeData::String)
}Work with Function Types
fn analyze_function(resolver: &impl TypeResolver, type_ref: TypeReference) {
let resolved = resolver.resolve_type(type_ref);
if let TypeData::Function(func_type) = resolved.as_raw_data() {
// Access parameters
for param in func_type.parameters() {
let param_type = resolver.resolve_type(param.type_ref());
// Analyze parameter type
}
// Access return type
let return_type = resolver.resolve_type(func_type.return_type());
}
}Architecture Principles
Why Type References?
Advantages: 1. No stale data: Module updates don't leave old types in memory 2. Better performance: Types stored in vectors (data locality) 3. Easier debugging: Can inspect all types in vector 4. Simpler algorithms: Process vectors instead of traversing graphs
Trade-off: Must explicitly resolve references (not automatic like Arc)
ResolvedTypeId Structure
struct ResolvedTypeId(ResolverId, TypeId)TypeId(u32): Index into a type vectorResolverId(u32): Identifies which vector to use- Total: 64 bits (compact representation)
ResolvedTypeData
Always work with ResolvedTypeData from resolver, not raw &TypeData:
// Good - tracks resolver context
let resolved_data: ResolvedTypeData = resolver.resolve_type(type_ref);
// Be careful - loses resolver context
let raw_data: &TypeData = resolved_data.as_raw_data();
// Can't resolve nested TypeReferences without ResolverId!Tips
- Unknown types:
TypeData::Unknownmeans inference not implemented, treat as "could be anything" - Follow references: Always follow
TypeData::Referenceto get actual type - Resolver context: Keep
ResolvedTypeDatawhen possible, don't extract rawTypeDataearly - Performance: Type vectors are fast - iterate directly instead of recursive traversal
- IDE focus: All design decisions prioritize instant IDE updates over CLI performance
- No caching: Full inference results can't be cached (would become stale)
- Globals: Currently hardcoded, eventually should use TypeScript's
.d.tsfiles
Common Patterns
// Pattern 1: Resolve and flatten
let type_ref = expr.infer_type(resolver);
let flattened = type_ref.flatten(resolver);
// Pattern 2: Check if type matches
fn is_string_type(resolver: &impl TypeResolver, type_ref: TypeReference) -> bool {
let resolved = resolver.resolve_type(type_ref);
matches!(resolved.as_raw_data(), TypeData::String)
}
// Pattern 3: Handle unknown gracefully
match resolved.as_raw_data() {
TypeData::Unknown | TypeData::UnknownKeyword => {
// Can't verify, assume valid
return None;
}
TypeData::String => { /* handle */ }
_ => { /* handle */ }
}CSS and HTML Module Graph
The module graph tracks not only JS imports/exports but also CSS class names and HTML class references, used by cross-file lint rules like noUnusedStyles and noUndeclaredStyles.
Key Types
CssModuleInfo — classes: IndexSet<CssClass>
HtmlModuleInfo — style_classes: IndexSet<CssClass> (from <style> blocks)
— referenced_classes: IndexSet<CssClass> (from class="..." attrs)
— imported_stylesheets: Vec<ResolvedPath>
JsModuleInfo — referenced_classes: IndexSet<CssClass> (from className="...")CssClass Design
CssClass stores a class name without allocating a `String` per word:
pub struct CssClass {
pub(crate) token: TokenText, // the full token (or its inner text) — refcount only
pub range: TextRange, // byte range relative to token.text()
}
impl CssClass {
pub fn text(&self) -> &str {
let start = usize::from(self.range.start());
let end = usize::from(self.range.end());
&self.token.text()[start..end]
}
}Borrow<str>,Hash, andEqall delegate toself.text(), soIndexSet::contains("foo")works with a plain&str.- For CSS selectors (
.foo), the token is the whole selector token and the range covers it entirely. - For HTML/JSX string attributes (
class="foo bar"), the token is the inner (quote-stripped)TokenTextfrominner_string_text(), and each word has its own offset range within that inner text.
Populating CssClass from a CSS selector
let token_text = token.token_text_trimmed();
let len = u32::from(token_text.len());
classes.insert(CssClass {
token: token_text,
range: TextRange::new(TextSize::from(0), TextSize::from(len)),
});Populating CssClass from a class="foo bar" attribute
// Use inner_string_text() — strips quotes, no allocation.
let inner: TokenText = html_string.inner_string_text()?;
let content = inner.text();
let mut offset: u32 = 0;
for word in content.split_ascii_whitespace() {
let word_offset = content[offset as usize..]
.find(word)
.map_or(offset, |pos| offset + pos as u32);
let start = TextSize::from(word_offset);
let end = start + TextSize::from(word.len() as u32);
classes.insert(CssClass {
token: inner.clone(), // refcount bump only
range: TextRange::new(start, end),
});
offset = word_offset + word.len() as u32;
}Cross-file class lookup
// In a CSS lint rule:
module_graph.is_class_referenced_by_importers(css_file_path, class_name_str)
// In an HTML lint rule:
let html_info = module_graph.html_module_info_for_path(file_path)?;
let css_info = module_graph.css_module_info_for_path(stylesheet_path)?;
// Zero-alloc lookup (Borrow<str> impl):
html_info.style_classes.contains("foo")
css_info.classes.contains("bar")Public Function Audit Rules
When adding or removing functions from the module graph, always verify each public function has a real production call site (not just test code).
Rules:
- A function used only in tests is not justified — remove it
- Tests calling a function do not count as "production use"
- Check with
grepacross all crates before removing anything data()is used frombiome_service/workspace/server.rs— do not remove it even if it looks test-only
References
- Architecture guide:
crates/biome_js_type_info/CONTRIBUTING.md - Module graph:
crates/biome_module_graph/ - Type resolver trait:
crates/biome_js_type_info/src/resolver.rs - Flattening:
crates/biome_js_type_info/src/flattening.rs