use std::collections::HashMap;
use std::sync::LazyLock;
#[derive(Clone, Debug)]
pub struct ErrorExplanation {
pub code: &'static str,
pub title: &'static str,
pub explanation: &'static str,
pub example: Option<&'static str>,
pub correct_example: Option<&'static str>,
pub doc_link: Option<&'static str>,
pub related_codes: &'static [&'static str],
pub common_mistakes: &'static [CommonMistake],
}
#[derive(Clone, Debug)]
pub struct CommonMistake {
pub pattern: &'static str,
pub fix: &'static str,
}
static ERROR_REGISTRY: LazyLock<HashMap<&'static str, ErrorExplanation>> = LazyLock::new(|| {
let mut map = HashMap::new();
map.insert(
"E0001",
ErrorExplanation {
code: "E0001",
title: "Type mismatch",
explanation: r#"
This error occurs when the type checker expects one type but finds another.
Type mismatches commonly occur when:
- A function is called with an argument of the wrong type
- A variable is used in a context that requires a different type
- A return value doesn't match the function's declared return type
The compiler shows the expected type and the actual type found. Check that
your types align, or add explicit type conversions where needed.
"#,
example: Some(
r#"
foo :: Int -> Int
foo x = "hello" -- Error: expected Int, found String
"#,
),
correct_example: Some(
r#"
foo :: Int -> Int
foo x = x + 1
"#,
),
doc_link: Some("https://bhc.dev/docs/type-system"),
related_codes: &["E0007", "E0009"],
common_mistakes: &[
CommonMistake {
pattern: "Returning wrong type from function",
fix: "Check the function's type signature matches the return expression",
},
CommonMistake {
pattern: "Passing string literal where number expected",
fix: "Use numeric literals (42) not strings (\"42\")",
},
],
},
);
map.insert(
"E0002",
ErrorExplanation {
code: "E0002",
title: "Infinite type (occurs check)",
explanation: r#"
This error occurs when type inference would create an infinite type,
typically when a value is used in a way that would require it to contain
itself.
This is detected by the "occurs check" during unification. If a type
variable would need to be unified with a type containing that same
variable, it would create an infinite loop in the type.
Common causes:
- Recursive data without proper type annotations
- Accidentally creating circular references in types
"#,
example: Some(
r#"
-- This creates an infinite type: a = [a]
foo x = [x, foo x]
"#,
),
correct_example: Some(
r#"
-- Use a recursive data type instead
data Tree a = Leaf a | Node [Tree a]
foo :: a -> Tree a
foo x = Node [Leaf x, foo x]
"#,
),
doc_link: Some("https://bhc.dev/docs/type-inference"),
related_codes: &["E0001", "E0022"],
common_mistakes: &[CommonMistake {
pattern: "Building a list containing the result of a recursive call",
fix: "Use a proper recursive data type instead of lists",
}],
},
);
map.insert(
"E0003",
ErrorExplanation {
code: "E0003",
title: "Unbound variable",
explanation: r#"
This error occurs when you use a variable name that hasn't been defined
in the current scope.
Common causes:
- Typo in the variable name
- Using a variable before it's defined
- Variable defined in a different scope (e.g., inside a let or lambda)
- Forgot to import a module
The compiler will suggest similar names if it finds a likely typo.
"#,
example: Some(
r#"
foo = x + 1 -- Error: x is not defined
"#,
),
correct_example: Some(
r#"
foo x = x + 1 -- x is now a parameter
"#,
),
doc_link: Some("https://bhc.dev/docs/scoping"),
related_codes: &["E0004"],
common_mistakes: &[
CommonMistake {
pattern: "Typo in variable name (e.g., 'lenght' instead of 'length')",
fix: "Check the 'did you mean?' suggestion in the error message",
},
CommonMistake {
pattern: "Using a variable from an inner scope",
fix: "Pass the variable as a parameter or define it in the current scope",
},
CommonMistake {
pattern: "Forgot to import a module",
fix: "Add an import statement for the missing module",
},
],
},
);
map.insert(
"E0004",
ErrorExplanation {
code: "E0004",
title: "Unbound constructor",
explanation: r#"
This error occurs when you use a data constructor that hasn't been defined
or imported.
Data constructors in Haskell/BHC must:
- Start with an uppercase letter (e.g., Just, Nothing, True)
- Be defined in a data/newtype declaration
- Be imported if defined in another module
Common causes:
- Typo in the constructor name
- Forgot to import the data type
- Constructor is not exported from its module
"#,
example: Some(
r#"
foo = Jus 42 -- Error: typo, should be Just
"#,
),
correct_example: Some(
r#"
foo = Just 42 -- Correct constructor name
"#,
),
doc_link: Some("https://bhc.dev/docs/data-types"),
related_codes: &["E0003", "E0005"],
common_mistakes: &[
CommonMistake {
pattern: "Typo in constructor name",
fix: "Check the 'did you mean?' suggestion",
},
CommonMistake {
pattern: "Constructor not exported",
fix: "Import the module with explicit constructor list",
},
],
},
);
map.insert(
"E0005",
ErrorExplanation {
code: "E0005",
title: "Pattern arity mismatch",
explanation: r#"
This error occurs when a pattern has a different number of arguments than
the data constructor expects.
Each data constructor has a fixed number of fields. When pattern matching,
you must provide exactly that many pattern variables.
"#,
example: Some(
r#"
data Point = Point Int Int
foo (Point x) = x -- Error: Point has 2 fields, but pattern has 1
"#,
),
correct_example: Some(
r#"
data Point = Point Int Int
foo (Point x y) = x + y -- Correct: matches both fields
-- Or use a wildcard:
foo (Point x _) = x -- Ignore second field
"#,
),
doc_link: Some("https://bhc.dev/docs/pattern-matching"),
related_codes: &["E0004", "E0008"],
common_mistakes: &[CommonMistake {
pattern: "Missing pattern variables",
fix: "Use wildcards (_) for fields you don't need",
}],
},
);
map.insert(
"E0006",
ErrorExplanation {
code: "E0006",
title: "Ambiguous type variable",
explanation: r#"
This error occurs when the compiler cannot determine a concrete type for
a type variable. The type is ambiguous because there's not enough
information to resolve it.
This often happens with:
- Numeric literals that could be Int, Float, etc.
- Polymorphic functions where the result type isn't constrained
- Show/Read without a concrete type context
Solution: Add a type annotation to specify the intended type.
"#,
example: Some(
r#"
foo = show (read "42") -- Error: ambiguous type for read
"#,
),
correct_example: Some(
r#"
foo = show (read "42" :: Int) -- Explicit type annotation
"#,
),
doc_link: Some("https://bhc.dev/docs/type-inference"),
related_codes: &["E0001"],
common_mistakes: &[
CommonMistake {
pattern: "Using read without type annotation",
fix: "Add :: Type after the expression",
},
CommonMistake {
pattern: "Numeric literal in polymorphic context",
fix: "Add type annotation like (42 :: Int)",
},
],
},
);
map.insert(
"E0007",
ErrorExplanation {
code: "E0007",
title: "Kind mismatch",
explanation: r#"
This error occurs when a type is used with the wrong kind.
Kinds classify types:
- `*` (or `Type`): Concrete types like Int, Bool, [Char]
- `* -> *`: Type constructors like Maybe, [], IO
- `* -> * -> *`: Two-parameter type constructors like Either, (,)
Kind errors often occur when:
- Applying a concrete type as if it were a type constructor
- Forgetting to apply a type constructor to its argument
"#,
example: Some(
r#"
foo :: Int Maybe -- Error: Int has kind *, not * -> *
"#,
),
correct_example: Some(
r#"
foo :: Maybe Int -- Correct: Maybe :: * -> *, Int :: *
"#,
),
doc_link: Some("https://bhc.dev/docs/kinds"),
related_codes: &["E0001"],
common_mistakes: &[CommonMistake {
pattern: "Type arguments in wrong order",
fix: "Put type constructor before its argument",
}],
},
);
map.insert(
"E0008",
ErrorExplanation {
code: "E0008",
title: "Function arity mismatch",
explanation: r#"
This error occurs when a function is called with the wrong number of
arguments.
While Haskell/BHC supports partial application (providing fewer arguments
than expected), this error is raised when you provide MORE arguments than
the function accepts.
The error message shows which arguments are extra.
"#,
example: Some(
r#"
add :: Int -> Int -> Int
add x y = x + y
result = add 1 2 3 -- Error: add takes 2 arguments, got 3
"#,
),
correct_example: Some(
r#"
add :: Int -> Int -> Int
add x y = x + y
result = add 1 2 -- Correct: 2 arguments
"#,
),
doc_link: Some("https://bhc.dev/docs/functions"),
related_codes: &["E0005", "E0009"],
common_mistakes: &[CommonMistake {
pattern: "Passing extra arguments",
fix: "Check the function's type signature for argument count",
}],
},
);
map.insert(
"E0009",
ErrorExplanation {
code: "E0009",
title: "Not a function",
explanation: r#"
This error occurs when you try to apply something that isn't a function
as if it were one.
In Haskell/BHC, function application is denoted by juxtaposition:
f x -- Apply f to x
If `f` is not a function type (doesn't have the form `a -> b`), you'll
get this error.
"#,
example: Some(
r#"
x = 42
result = x 10 -- Error: 42 is Int, not a function
"#,
),
correct_example: Some(
r#"
f x = x + 1
result = f 10 -- Correct: f is a function
"#,
),
doc_link: Some("https://bhc.dev/docs/functions"),
related_codes: &["E0001", "E0008"],
common_mistakes: &[
CommonMistake {
pattern: "Applying a non-function value",
fix: "Check if you meant to call a different function",
},
CommonMistake {
pattern: "Missing operator between values",
fix: "Add the operator like + or * between values",
},
],
},
);
map.insert(
"E0020",
ErrorExplanation {
code: "E0020",
title: "Dimension mismatch",
explanation: r#"
This error occurs when tensor dimensions don't match as required by an
operation.
For example, matrix multiplication requires the inner dimensions to match:
matmul :: Tensor '[m, k] a -> Tensor '[k, n] a -> Tensor '[m, n] a
The 'k' dimension (columns of first matrix, rows of second) must be equal.
Common causes:
- Matrices with incompatible shapes for multiplication
- Elementwise operations on tensors of different shapes
- Incorrect reshape operations
"#,
example: Some(
r#"
-- Shapes: [3, 5] × [7, 4] - inner dimensions 5 ≠7
result = matmul a b -- Error: dimension mismatch
"#,
),
correct_example: Some(
r#"
-- Shapes: [3, 5] × [5, 4] - inner dimensions match
result = matmul a b -- OK: produces [3, 4]
"#,
),
doc_link: Some("https://bhc.dev/docs/tensors/shapes"),
related_codes: &["E0023", "E0030", "E0031"],
common_mistakes: &[
CommonMistake {
pattern: "Matrices in wrong order for matmul",
fix: "Try swapping the arguments or transpose one matrix",
},
CommonMistake {
pattern: "Wrong reshape dimensions",
fix: "Check that total elements match before and after reshape",
},
],
},
);
map.insert(
"E0023",
ErrorExplanation {
code: "E0023",
title: "Shape rank mismatch",
explanation: r#"
This error occurs when a tensor has a different number of dimensions
(rank) than expected.
For example:
- A function expecting a matrix (rank 2) receives a vector (rank 1)
- A function expecting a vector (rank 1) receives a scalar (rank 0)
Check that your tensors have the correct number of dimensions.
"#,
example: Some(
r#"
-- matmul expects rank-2 tensors (matrices)
a :: Tensor '[10] Float -- rank 1 (vector)
b :: Tensor '[10, 5] Float -- rank 2 (matrix)
result = matmul a b -- Error: rank mismatch
"#,
),
correct_example: Some(
r#"
-- Both operands are rank-2
a :: Tensor '[1, 10] Float -- rank 2 (row vector as matrix)
b :: Tensor '[10, 5] Float -- rank 2 (matrix)
result = matmul a b -- OK: produces [1, 5]
"#,
),
doc_link: Some("https://bhc.dev/docs/tensors/ranks"),
related_codes: &["E0020", "E0030"],
common_mistakes: &[
CommonMistake {
pattern: "Vector where matrix expected",
fix: "Use reshape to add dimension: '[n] -> '[1, n] or '[n, 1]",
},
CommonMistake {
pattern: "Wrong tensor dimension count",
fix: "Use unsqueeze/squeeze to add/remove dimensions",
},
],
},
);
map.insert(
"E0030",
ErrorExplanation {
code: "E0030",
title: "Matrix multiplication dimension mismatch",
explanation: r#"
This error occurs specifically during matrix multiplication when the inner
dimensions don't match.
Matrix multiplication has the signature:
matmul :: Tensor '[m, k] a -> Tensor '[k, n] a -> Tensor '[m, n] a
The second dimension of the first matrix (k, the number of columns) must
equal the first dimension of the second matrix (k, the number of rows).
Visual representation:
[m × k] @ [k × n] = [m × n]
└───┴──── these must match
Common fixes:
- Transpose one of the matrices
- Swap the order of arguments
- Reshape to get compatible dimensions
"#,
example: Some(
r#"
weights :: Tensor '[768, 512] Float
input :: Tensor '[1024, 768] Float
-- Error: matmul expects inner dims to match
-- weights has 512 cols, input has 1024 rows
result = matmul weights input
"#,
),
correct_example: Some(
r#"
weights :: Tensor '[768, 512] Float
input :: Tensor '[768, 1024] Float
-- 768 == 768, so inner dimensions match
result = matmul (transpose weights) input -- [512, 1024]
-- Or swap the order:
result = matmul input weights -- Depends on what you want
"#,
),
doc_link: Some("https://bhc.dev/docs/tensors/matmul"),
related_codes: &["E0020", "E0023", "E0038"],
common_mistakes: &[
CommonMistake {
pattern: "Arguments in wrong order",
fix: "Try matmul b a instead of matmul a b",
},
CommonMistake {
pattern: "Forgot to transpose",
fix: "Use transpose on one of the matrices",
},
CommonMistake {
pattern: "Shapes are reversed from numpy/pytorch convention",
fix: "BHC uses [rows, cols] ordering consistently",
},
],
},
);
map.insert(
"E0031",
ErrorExplanation {
code: "E0031",
title: "Broadcast incompatible shapes",
explanation: r#"
This error occurs when two tensors have shapes that cannot be broadcast
together according to NumPy-style broadcasting rules.
Broadcasting rules:
1. Shapes are compared element-wise from the trailing dimensions
2. Dimensions are compatible if they are equal or one of them is 1
3. Missing dimensions are treated as 1
For example:
[3, 4] and [4] -> OK (becomes [3, 4])
[3, 4] and [1, 4] -> OK (becomes [3, 4])
[3, 4] and [2, 4] -> Error! (3 ≠2 and neither is 1)
"#,
example: Some(
r#"
a :: Tensor '[3, 4] Float
b :: Tensor '[2, 4] Float
result = a + b -- Error: cannot broadcast [3,4] with [2,4]
"#,
),
correct_example: Some(
r#"
a :: Tensor '[3, 4] Float
b :: Tensor '[1, 4] Float
result = a + b -- OK: b broadcasts to [3, 4]
"#,
),
doc_link: Some("https://bhc.dev/docs/tensors/broadcasting"),
related_codes: &["E0020", "E0023"],
common_mistakes: &[
CommonMistake {
pattern: "Non-1 dimensions that don't match",
fix: "Use reshape to make one dimension 1 for broadcasting",
},
CommonMistake {
pattern: "Broadcasting where elementwise was intended",
fix: "Ensure shapes match exactly or use explicit broadcast",
},
],
},
);
map.insert(
"E0037",
ErrorExplanation {
code: "E0037",
title: "Dynamic tensor conversion failed",
explanation: r#"
This error occurs when attempting to convert a DynTensor to a statically-
shaped tensor with fromDynamic, but the runtime shape doesn't match.
DynTensor is an existentially-quantified wrapper that hides the shape:
data DynTensor a where
MkDynTensor :: Tensor shape a -> DynTensor a
When using fromDynamic, you must handle the case where the shapes don't
match:
fromDynamic :: ShapeWitness shape -> DynTensor a -> Maybe (Tensor shape a)
Always pattern match on the Maybe result to handle both cases.
"#,
example: Some(
r#"
processTensor :: DynTensor Float -> Tensor '[256, 256] Float
processTensor dyn = fromJust (fromDynamic witness dyn)
-- Error if runtime shape isn't [256, 256]!
"#,
),
correct_example: Some(
r#"
processTensor :: DynTensor Float -> Maybe (Tensor '[256, 256] Float)
processTensor dyn = case fromDynamic witness dyn of
Just tensor -> Just (processStatic tensor)
Nothing -> Nothing -- Handle shape mismatch
"#,
),
doc_link: Some("https://bhc.dev/docs/tensors/dynamic"),
related_codes: &["E0020", "E0023"],
common_mistakes: &[
CommonMistake {
pattern: "Using fromJust with fromDynamic",
fix: "Always pattern match on Maybe result",
},
CommonMistake {
pattern: "Not validating runtime shapes",
fix: "Check shape at boundaries using fromDynamic safely",
},
],
},
);
map.insert(
"W0001",
ErrorExplanation {
code: "W0001",
title: "Unused variable",
explanation: r#"
This warning indicates that a variable is defined but never used.
While this doesn't prevent compilation, unused variables often indicate:
- Incomplete code (forgot to use the variable)
- Dead code that can be removed
- A typo in the variable name
To suppress this warning for intentionally unused variables, prefix the
name with an underscore: `_unused`.
"#,
example: Some(
r#"
foo x y = x + 1 -- Warning: y is unused
"#,
),
correct_example: Some(
r#"
foo x _y = x + 1 -- No warning: _y is intentionally unused
-- Or actually use y:
foo x y = x + y
"#,
),
doc_link: Some("https://bhc.dev/docs/warnings"),
related_codes: &[],
common_mistakes: &[
CommonMistake {
pattern: "Forgot to use variable in computation",
fix: "Use the variable or prefix with _ if intentionally unused",
},
CommonMistake {
pattern: "Typo in variable name causing apparent unused var",
fix: "Check for similar names used elsewhere",
},
],
},
);
map
});
#[must_use]
pub fn get_explanation(code: &str) -> Option<&'static ErrorExplanation> {
ERROR_REGISTRY.get(code)
}
#[must_use]
pub fn all_error_codes() -> Vec<&'static str> {
let mut codes: Vec<_> = ERROR_REGISTRY.keys().copied().collect();
codes.sort();
codes
}
#[must_use]
pub fn format_explanation(explanation: &ErrorExplanation) -> String {
let mut output = String::new();
output.push_str(&format!(
"# {} - {}\n\n",
explanation.code, explanation.title
));
output.push_str(explanation.explanation.trim());
output.push_str("\n\n");
if let Some(example) = explanation.example {
output.push_str("## Example of erroneous code:\n");
output.push_str("```haskell");
output.push_str(example);
output.push_str("```\n\n");
}
if let Some(correct) = explanation.correct_example {
output.push_str("## Corrected code:\n");
output.push_str("```haskell");
output.push_str(correct);
output.push_str("```\n\n");
}
if !explanation.common_mistakes.is_empty() {
output.push_str("## Common Mistakes\n\n");
for mistake in explanation.common_mistakes {
output.push_str(&format!("**{}**\n", mistake.pattern));
output.push_str(&format!(" Fix: {}\n\n", mistake.fix));
}
}
if !explanation.related_codes.is_empty() {
output.push_str("## Related\n\n");
output.push_str("See also: ");
let codes: Vec<String> = explanation
.related_codes
.iter()
.map(|c| format!("`{}`", c))
.collect();
output.push_str(&codes.join(", "));
output.push_str("\n\n");
}
if let Some(doc_link) = explanation.doc_link {
output.push_str("## Documentation\n\n");
output.push_str(&format!("For more information, see: {}\n", doc_link));
}
output
}
pub fn print_explanation(code: &str) {
match get_explanation(code) {
Some(explanation) => {
println!("{}", format_explanation(explanation));
}
None => {
println!("Error code `{code}` not found.");
println!("\nAvailable error codes:");
for code in all_error_codes() {
if let Some(exp) = get_explanation(code) {
println!(" {}: {}", code, exp.title);
}
}
}
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_get_explanation() {
let exp = get_explanation("E0001").unwrap();
assert_eq!(exp.code, "E0001");
assert_eq!(exp.title, "Type mismatch");
}
#[test]
fn test_unknown_code() {
assert!(get_explanation("E9999").is_none());
}
#[test]
fn test_all_error_codes() {
let codes = all_error_codes();
assert!(!codes.is_empty());
assert!(codes.contains(&"E0001"));
}
#[test]
fn test_format_explanation() {
let exp = get_explanation("E0001").unwrap();
let formatted = format_explanation(exp);
assert!(formatted.contains("E0001"));
assert!(formatted.contains("Type mismatch"));
}
}