ollef / sixtyLinks
Dependent type checker using normalisation by evaluation
☆262Updated 9 months ago
Alternatives and similar repositories for sixty
Users that are interested in sixty are comparing it to the libraries listed below
Sorting:
- Staged compilation with dependent types☆174Updated last month
- The Makam Metalanguage☆198Updated 2 years ago
- Spartan type theory☆267Updated last year
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- A compiler for functional programs on serialized data☆164Updated last week
- 1ML prototype interpreter☆282Updated 4 years ago
- Frank compiler☆296Updated last year
- 😎TT☆228Updated last year
- A comparison of how computational effects and handlers are implemented in various programming languages.☆141Updated 6 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆210Updated 3 years ago
- A categorical programming language with effects☆278Updated 2 years ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆378Updated last year
- A tiny language, a subset of Haskell aimed at aiding teachers teach Haskell☆214Updated 2 years ago
- Alternative algorithm for algebraic subtyping.☆166Updated last month
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆59Updated last year
- an implementation of stuck macros☆142Updated 3 months ago
- GRIN backend for GHC☆144Updated 3 years ago
- Build system☆122Updated last year
- A small implementation of higher-order unification☆188Updated 7 years ago
- Demo for high-performance type theory elaboration☆556Updated last year
- being an operating system for typechecking processes☆126Updated 2 years ago
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆618Updated last month
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A fast functional language based on two level type theory☆391Updated 2 years ago
- Benchmarks for capture-avoiding substitution☆114Updated 3 weeks ago
- Fast parsing from bytestrings☆161Updated 2 months ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆81Updated 3 years ago
- Standard library for linear types in Haskell.☆343Updated 3 weeks ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 3 years ago
- Total Parser Combinators in Agda☆129Updated 2 years ago