naalit / durinLinks
the Dependent Unboxed higher-oRder Intermediate Notation
☆14Updated 3 years ago
Alternatives and similar repositories for durin
Users that are interested in durin are comparing it to the libraries listed below
Sorting:
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- a self-hosting lambda calculus compiler☆36Updated 4 months ago
- A toy dependent typed language.☆31Updated 2 weeks ago
- A dependent type theory with user defined data types☆47Updated 3 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 3 years ago
- A WIP little dependently-typed systems language☆41Updated last year
- Linearizability Hoare Logic☆14Updated 5 months ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆27Updated 3 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated this week
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15Updated last year
- Label dependent dependent session types☆16Updated last year
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated last week
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- Setoid type theory implementation☆38Updated last year
- Benchmark repository of polyglot effect handler examples☆26Updated last week
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆20Updated 3 months ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 months ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- Practical type inference for arbitrary-rank types☆11Updated 6 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last week
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆28Updated last year