naalit / durin
the Dependent Unboxed higher-oRder Intermediate Notation
☆13Updated 2 years ago
Alternatives and similar repositories for durin:
Users that are interested in durin are comparing it to the libraries listed below
- Dependently typed programming language written in Haskell☆22Updated 2 years ago
- A toy dependent typed language.☆24Updated this week
- Label dependent dependent session types☆15Updated 8 months ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆14Updated 7 months ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆25Updated 2 years ago
- a self-hosting lambda calculus compiler☆34Updated 3 years ago
- A dependent type theory with user defined data types☆45Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last month
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆19Updated 3 months ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- ☆38Updated 5 months ago
- SPSC: A Small Positive Supercompiler☆32Updated 8 months ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Grab-bag library for the MPL compiler (https://github.com/mpllang/mpl)☆16Updated last week
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- Demo for dependent types + runtime code generation☆64Updated last month
- Implementation of Quantitative Type Theory (in TypeScript)☆12Updated 4 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆26Updated 2 years ago
- An interpreter of F-ing modules☆18Updated 5 years ago
- A TOML parser for Idris 2☆15Updated 6 months ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- ☆16Updated 6 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago
- 🪆 A Staged Type Theory☆34Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago