stedolan / counterexamples
Counterexamples in Type Systems
☆374Updated last year
Related projects ⓘ
Alternatives and complementary repositories for counterexamples
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆592Updated last month
- Spartan type theory☆257Updated 5 months ago
- The Ott tool for writing definitions of programming languages and calculi☆349Updated 2 months ago
- Minimal implementations for dependent type checking and elaboration☆619Updated 2 months ago
- Demo for high-performance type theory elaboration☆519Updated last year
- A fast functional language based on two level type theory☆388Updated last year
- A work-in-progress language and compiler for verified low-level programming☆296Updated this week
- The MLscript programming language. Functional and object-oriented; structurally typed and sound; with powerful type inference. Soon to ha…☆172Updated this week
- Dependent type checker using normalisation by evaluation☆254Updated 2 months ago
- A demo implementation of a simple dependently-typed language☆563Updated this week
- Embeddable Lambda Prolog Interpreter☆290Updated this week
- Proving leftpad correct two-dozen different ways☆650Updated this week
- ☆196Updated 3 months ago
- Frank compiler☆279Updated 6 months ago
- 1ML prototype interpreter☆270Updated 4 years ago
- Metamath Zero specification language☆317Updated this week
- An introductory course to Homotopy Type Theory☆360Updated 4 years ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆368Updated last year
- A collaborative bibliography of work related to the theory and practice of computational effects☆971Updated 3 weeks ago
- Metaprogramming, verified meta-theory and implementation of Coq in Coq☆382Updated this week
- Staged compilation with dependent types☆163Updated 2 weeks ago
- A language server for Standard ML.☆219Updated 2 months ago
- A simple ML-like programming language with subtyping and full type inference.☆164Updated 5 months ago
- Proof assistant based on the λΠ-calculus modulo rewriting☆278Updated this week
- A compiler for functional programs on serialized data☆158Updated this week
- The Vellvm (Verified LLVM) coq development.☆400Updated this week
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆145Updated 8 months ago
- The Arend Proof Assistant☆694Updated this week
- Formal verification for OCaml☆255Updated 3 months ago
- A modern supercompiler for call-by-value functional languages☆390Updated last week