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 simple implementation of linear type theory☆38Updated 8 years ago
- ☆29Updated 10 years ago
- The Alms Programming Language☆44Updated 7 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 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 4 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- secret project☆17Updated 7 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 9 months ago
- ☆21Updated 9 years ago
- ☆17Updated 7 years ago
- A playground for type theory implementations in Racket☆20Updated 10 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 9 months ago
- Generation of abstract binding trees☆27Updated 3 months ago
- Higher-order FRP compiler☆15Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- IO using sized types and copatterns☆36Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Experiments in Synthetic Differential Geometry☆16Updated 4 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago