samuela / bidirectional-typingLinks
A bidirectional type checker
☆63Updated 8 years ago
Alternatives and similar repositories for bidirectional-typing
Users that are interested in bidirectional-typing are comparing it to the libraries listed below
Sorting:
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆59Updated last year
- Demo for dependent types + runtime code generation☆69Updated 4 months ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated 2 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- Setoid type theory implementation☆38Updated last year
- A core language and API for dependently typed languages☆94Updated 4 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Fast equality saturation in Haskell☆84Updated 4 months ago
- Experimental effects library for Idris 2☆42Updated 3 years ago
- being an operating system for typechecking processes☆126Updated 2 years ago
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- Staged compilation with dependent types☆174Updated last month
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A collection of programming languages and type systems.☆33Updated last month
- a proof-of-concept programming language based on call-by-push-value☆54Updated this week
- Implementing a small functional language with a combinator based graph-reduction machine☆31Updated last year
- Example row-polymorphism implementations☆61Updated last year
- an implementation of stuck macros☆142Updated this week
- ☆33Updated 8 months ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago