zehaochen19 / vanilla-langLinks
An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
☆90Updated 2 years ago
Alternatives and similar repositories for vanilla-lang
Users that are interested in vanilla-lang are comparing it to the libraries listed below
Sorting:
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Example row-polymorphism implementations☆61Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Benchmarks for capture-avoiding substitution☆114Updated 3 weeks ago
- Normalization by Evaluation for Martin-Löf Type Theory☆127Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- SPLV20 course notes☆110Updated 2 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- A simple Depdently-Typed Language for Research and Learning☆57Updated 8 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆59Updated last year
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- being an operating system for typechecking processes☆126Updated 2 years ago
- A bidirectional type checker☆63Updated 8 years ago
- A core language and API for dependently typed languages☆94Updated 4 months ago
- ☆47Updated 3 weeks ago
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- Simplified Observational Type Theory☆83Updated 2 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Implementation for ICFP 2020 paper☆53Updated 3 years ago