stedolan / counterexamples
Counterexamples in Type Systems
☆394Updated last year
Alternatives and similar repositories for counterexamples:
Users that are interested in counterexamples are comparing it to the libraries listed below
- Minimal implementations for dependent type checking and elaboration☆646Updated last month
- A compiler for functional programs on serialized data☆158Updated this week
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆606Updated last month
- Frank compiler☆288Updated 11 months ago
- A demo implementation of a simple dependently-typed language☆590Updated 4 months ago
- Demo for high-performance type theory elaboration☆541Updated last year
- Spartan type theory☆262Updated 10 months ago
- A collaborative bibliography of work related to the theory and practice of computational effects☆1,008Updated this week
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆374Updated last year
- Alternative algorithm for algebraic subtyping.☆158Updated this week
- A fast functional language based on two level type theory☆389Updated 2 years ago
- Dependent type checker using normalisation by evaluation☆258Updated 6 months ago
- A language server for Standard ML in Rust.☆222Updated this week
- The Ott tool for writing definitions of programming languages and calculi☆364Updated 2 months ago
- 😎TT☆225Updated last year
- Proof assistant based on the λΠ-calculus modulo rewriting☆312Updated last week
- A work-in-progress language and compiler for verified low-level programming☆303Updated last week
- The MLscript programming language. Functional and object-oriented; structurally typed and sound; with powerful type inference. Soon to ha…☆185Updated last week
- Metaprogramming, verified meta-theory and implementation of Coq in Coq☆430Updated last week
- 1ML prototype interpreter☆280Updated 4 years ago
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆147Updated last year
- An introductory course to Homotopy Type Theory☆364Updated 4 years ago
- A language with lexical effect handlers and lightweight effect polymorphism☆346Updated this week
- Haskell implemented with combinators☆456Updated this week
- Metamath Zero specification language☆338Updated 4 months ago
- A modern supercompiler for call-by-value functional languages☆402Updated this week
- Resources for type theory, functional programming, etc.☆317Updated 4 years ago
- Prototype type inference engine☆201Updated last month
- A Library for Representing Recursive and Impure Programs in Coq☆216Updated 3 weeks ago
- Staged compilation with dependent types☆169Updated 2 weeks ago