fir-lang / fir
☆38Updated this week
Alternatives and similar repositories for fir:
Users that are interested in fir are comparing it to the libraries listed below
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Duo - A research language exploring duality in programming language design☆57Updated last year
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆42Updated last month
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆38Updated 3 months ago
- A toy dependent typed language.☆28Updated last week
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆56Updated 11 months ago
- A MinCaml compiler implemented in Rust☆45Updated last year
- A dependently typed programming language with direct style effects and linearity☆19Updated 8 months ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆26Updated 2 years ago
- A Haskell 2010 type checker☆17Updated last year
- 🪆 A Staged Type Theory☆35Updated last year
- a self-hosting lambda calculus compiler☆35Updated 3 years ago
- dependent type theory experiment☆25Updated last year
- Fωμ type checker and compiler☆52Updated 2 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Slides and handwritten notes on the course on models of programming languages☆51Updated 4 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Playing with type systems☆49Updated 2 months ago
- Demo for dependent types + runtime code generation☆67Updated last month
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A verified compiler for a lazy functional language☆34Updated last month
- dependently-typed lisp with flexible compiler backends☆28Updated 5 years ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- Setoid type theory implementation☆38Updated last year
- Example language server (LSP) implementation for a toy language☆60Updated 3 years ago
- A Haskell implementation of the Formality language☆18Updated 5 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆35Updated last year