LC

Implement Type Inference for a Simple Expression Language

hard3/8

Detect Use-Before-Declaration and Undefined Variables Handle Type Coercion Rules (e.g. int + float = float)

Language

Compiler

2.0s Limit 256MB

Implementation

Implement type inference for a simple expression language.

Requirements:

Define types: int, float, bool, string, type variables
Build constraint generator from expressions
Implement unification algorithm
Support literals, variables, binary operations, functions
Handle polymorphic function types
Report type errors with clear messages
Test with typed and untyped expressions

Why This Matters

Local type inference like yours is how TypeScript infers types for 'const x = ...', how Rust decides the type of let bindings, and how C++ resolves auto — none of these languages make you annotate expressions. Hindley-Milner, the full version of this idea, powers OCaml and Haskell, and understanding the bottom-up propagation you implement here is the doorway to it.

Hints

0 / 3 revealed

Validation Suite

main.c

Workspace 1.0