stedolan / counterexamplesLinks
Counterexamples in Type Systems
☆395Updated last year
Alternatives and similar repositories for counterexamples
Users that are interested in counterexamples are comparing it to the libraries listed below
Sorting:
- Spartan type theory☆266Updated last year
- The Ott tool for writing definitions of programming languages and calculi☆373Updated 5 months ago
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆618Updated 3 weeks ago
- Frank compiler☆291Updated last year
- A work-in-progress language and compiler for verified low-level programming☆307Updated this week
- Staged compilation with dependent types☆173Updated 3 weeks ago
- Formal verification for OCaml☆263Updated 9 months ago
- A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory☆370Updated this week
- 1ML prototype interpreter☆282Updated 4 years ago
- The MLscript programming language. Functional and object-oriented; structurally typed and sound; with powerful type inference. Soon to ha…☆191Updated last week
- Dependent type checker using normalisation by evaluation☆260Updated 8 months ago
- Minimal implementations for dependent type checking and elaboration☆673Updated this week
- A language server for Standard ML in Rust.☆223Updated 2 months ago
- A demo implementation of a simple dependently-typed language☆594Updated 6 months ago
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆147Updated last year
- Embeddable Lambda Prolog Interpreter☆312Updated this week
- A compiler for functional programs on serialized data☆164Updated last week
- A simple ML-like programming language with subtyping and full type inference.☆173Updated 6 months ago
- ☆220Updated last month
- A fast functional language based on two level type theory☆390Updated 2 years ago
- Demo for high-performance type theory elaboration☆554Updated last year
- The cuteness implementation of a dependently typed language.☆190Updated 2 years ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆379Updated last year
- Alternative algorithm for algebraic subtyping.☆162Updated 3 weeks ago
- Haskell implemented with combinators☆484Updated this week
- Resources for type theory, functional programming, etc.☆320Updated 4 years ago
- A language with lexical effect handlers and lightweight effect polymorphism☆368Updated this week
- Proving leftpad correct two-dozen different ways☆674Updated last month
- A collaborative bibliography of work related to the theory and practice of computational effects☆1,046Updated last month
- A modern supercompiler for call-by-value functional languages☆414Updated last month