rowandavies / sml-cidreLinks
SML Checker for Intersection and Datasort Refinements (pronounced "cider")
☆20Updated 12 years ago
Alternatives and similar repositories for sml-cidre
Users that are interested in sml-cidre are comparing it to the libraries listed below
Sorting:
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- The Alms Programming Language☆44Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Higher-order FRP compiler☆15Updated 3 years ago
- ☆22Updated 9 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- Generation of abstract binding trees☆28Updated 10 months ago
- Standard ML compiler based on typed intermediate languages.☆48Updated 11 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- ☆29Updated 9 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- ☆21Updated 8 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- Mechanizing Types and Programming Languages using Beluga☆19Updated 5 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 months ago
- secret project☆17Updated 7 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 8 months ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- ☆17Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 8 months ago