neel-krishnaswami / adjsLinks
Higher-order FRP compiler
☆15Updated 4 years ago
Alternatives and similar repositories for adjs
Users that are interested in adjs are comparing it to the libraries listed below
Sorting:
- A simple implementation of linear type theory☆38Updated 8 years ago
- ☆29Updated 10 years ago
- OCaml backend for Agda☆39Updated 7 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Updated 7 months ago
- A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- An abstract machine using indexed containers and their zippers☆13Updated 8 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- MetaML and MetaOCaml bibliography☆96Updated 11 months ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆38Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- System F in coq.☆19Updated 10 years ago
- A prototype implementation of the Frank programming language☆17Updated 9 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated this week
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- Work in progress☆38Updated 5 months ago
- Formalizing nbe in agda☆32Updated 13 years ago
- The Alms Programming Language☆44Updated 7 years ago