stedolan / counterexamplesLinks
Counterexamples in Type Systems
☆408Updated 2 years ago
Alternatives and similar repositories for counterexamples
Users that are interested in counterexamples are comparing it to the libraries listed below
Sorting:
- Minimal implementations for dependent type checking and elaboration☆761Updated this week
- The Ott tool for writing definitions of programming languages and calculi☆400Updated 2 weeks ago
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆694Updated 2 weeks ago
- The MLscript programming language. Functional and object-oriented; structurally typed and sound; with powerful type inference. Soon to ha…☆213Updated last week
- Dependent type checker using normalisation by evaluation☆271Updated last year
- A menagerie of cute implementations of modern typechecking algorithms☆378Updated last week
- Alternative algorithm for algebraic subtyping.☆173Updated 2 months ago
- Demo for high-performance type theory elaboration☆578Updated 2 years ago
- A demo implementation of a simple dependently-typed language☆616Updated last year
- Spartan type theory☆273Updated 4 months ago
- Frank compiler☆303Updated last year
- A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory☆418Updated last week
- A work-in-progress language and compiler for verified low-level programming☆323Updated last week
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆388Updated 2 years ago
- A language with lexical effect handlers and lightweight effect polymorphism☆421Updated this week
- Metaprogramming, verified meta-theory and implementation of Rocq in Rocq☆500Updated 3 weeks ago
- A Library for Representing Recursive and Impure Programs in Coq☆240Updated last week
- A compiler for functional programs on serialized data☆174Updated this week
- 😎TT☆241Updated 2 months ago
- ☆234Updated last year
- Staged compilation with dependent types☆187Updated 8 months ago
- A simple ML-like programming language with subtyping and full type inference.☆187Updated last year
- Metamath Zero specification language☆373Updated last month
- A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR☆227Updated 2 years ago
- Proof assistant based on the λΠ-calculus modulo rewriting☆368Updated this week
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆150Updated 4 months ago
- Visual Studio Code extension for Coq☆430Updated last month
- An introductory course to Homotopy Type Theory☆375Updated 5 years ago
- An experimental library for Cubical Agda☆530Updated this week
- A collection of tools for writing technical documents that mix Coq code and prose.☆284Updated 4 months ago